Sökning: "bandit algorithms"

Visar resultat 1 - 5 av 23 avhandlingar innehållade orden bandit algorithms.

  1. 1. Combinatorial Semi-Bandit Methods for Navigation of Electric Vehicles

    Författare :Niklas Åkerblom; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; energy-efficient navigation; online learning; multi-armed bandit problem; Thompson sampling; combinatorial semi-bandit problem;

    Sammanfattning : Climate change is one of the most urgent global challenges humanity is currently facing. As major contributors of greenhouse gas emissions, the transport and automotive sectors have crucial roles to play in solving the problem. LÄS MER

  3. 2. Bandit Methods for Network Optimization : Safety, Exploration, and Coordination

    Författare :Filippo Vannella; Alexandre Proutiere; Vincent Tan; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : The increasing complexity of modern mobile networks poses unprecedented challenges to their optimization. Mobile Network Operators (MNOs) need to control a large number of network parameters to satisfy the users’ demands. LÄS MER

  4. 3. Efficient Exploration and Robustness in Controlled Dynamical Systems

    Författare :Alessio Russo; Alexandre Proutiere; Henrik Sandberg; Marcello Restelli; Nikolai Matni; Jana Tumova; Mikael Asplund; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; reinforcement learning; efficient exploration; bandit algorithms; adversarial attacks; conformal prediction; data posioning; markov decision processes; attack detectability; optimal control; adaptive control; Electrical Engineering; Elektro- och systemteknik; Datalogi; Computer Science; Mathematical Statistics; Matematisk statistik;

    Sammanfattning : In this thesis, we explore two distinct topics. The first part of the thesis delves into efficient exploration in  multi-task bandit models and model-free exploration in large Markov decision processes (MDPs). LÄS MER

  5. 4. Online Combinatorial Optimization under Bandit Feedback

    Författare :Mohammad Sadegh Talebi Mazraeh Shahi; Alexandre Proutiere; Vianney Perchet; KTH; []
    Nyckelord :Combinatorial Optimization; Online Learning; Multi-armed Bandits; Sequential Decision Making; Matematik; Mathematics; Datalogi; Computer Science;

    Sammanfattning : Multi-Armed Bandits (MAB) constitute the most fundamental model for sequential decision making problems with an exploration vs. exploitation trade-off. In such problems, the decision maker selects an arm in each round and observes a realization of the corresponding unknown reward distribution. LÄS MER

  7. 5. Towards Optimal Algorithms For Online Decision Making Under Practical Constraints

    Författare :Aristide Tossou; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Reinforcement Learning; Multi-Agent Learning; Differential Privacy; Multi-Armed Bandit; Markov Decision Process; Fairness;

    Sammanfattning : Artificial Intelligence is increasingly being used in real-life applications such as driving with autonomous cars; deliveries with autonomous drones; customer support with chat-bots; personal assistant with smart speakers . . . LÄS MER