Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 48 for “"Bandit algorithms"”.

  1. EFFICIENT AND EFFECTIVE BANDIT ALGORITHMS

    The multi-armed bandit (MAB) problem provides an elementary model for exploration-exploitation tradeoffs and finds many real applications such as medical trials \cite{thompson1933likelihood,perchet2016batched}, crowdsourcing \cite{kittur2008crowdsourcing,zhou2014optimal}, and marketing …

    nus Repository record for EFFICIENT AND EFFECTIVE BANDIT ALGORITHMS (opens in a new tab) Download file for EFFICIENT AND EFFECTIVE BANDIT ALGORITHMS (opens in a new tab)

  2. Bandit algorithms with graphical feedback models and privacy awareness

    … of learning problems in stochastic multi-armed bandits (MAB): graphical bandits and private bandits. Different from the basic MAB setting where the learning algorithm can only have one observation,for a bandit problem under a graphical feedback model, the learning algorithm may be able to have …

    uvic Repository record for Bandit algorithms with graphical feedback models and privacy awareness (opens in a new tab)

  3. mmWave beamforming facilitated by hierarchical codebooks and structural bandit algorithms

    … over time. We leverage state-of-the-art algorithms from areas such as reinforcement learning to improve upon these existing practices, in particular Multi-Armed Bandit (MAB) algorithms. Our work shows that our algorithms are competitive with scenarios in which full Channel State …

    gatech Repository record for mmWave beamforming facilitated by hierarchical codebooks and structural bandit algorithms (opens in a new tab)

  4. Recommender Systems; Contextual Multi-Armed Bandit Algorithms for the purpose of targeted advertisement within e-commerce

    … demand for smart systems using up-to-date algorithms and techniques to achieve relevant advertisements. This thesis focuses on evaluating the performance of Contextual Multi-Armed Bandit Algorithms in a, for the specific algorithm, not yet fully explored use-area of recommender systems, …

    chalmers Repository record for Recommender Systems; Contextual Multi-Armed Bandit Algorithms for the purpose of targeted advertisement within e-commerce (opens in a new tab)

  5. Optimality, Scalability, and Reneging in Bandit Learning

    Bandit learning has been widely applied to handle the exploration-exploitation dilemma in sequential decision problems. To solve the dilemma, a large number of bandit algorithms have been proposed. While many of these algorithms have been proved to be order-optimal with respect to regret, the …

    tamu Repository record for Optimality, Scalability, and Reneging in Bandit Learning (opens in a new tab)

  6. Adversarial Attack and Robust Learning in Multi-Arm Bandit Problems

    In this paper we study bandit learning problem with adversaries. Bandit learning setting is a typical sequential decisions making setting whose biggest challenge is to balance the exploration and exploitation. Models based on bandit learning setting are widely applied in a variety fields of …

    gatech Repository record for Adversarial Attack and Robust Learning in Multi-Arm Bandit Problems (opens in a new tab)

  7. Multi-armed bandits and applications to large datasets

    This thesis considers the multi-armed bandit (MAB) problem, both the traditional bandit feedback and graphical bandits when there is side information. Motivated by the Boltzmann exploration algorithm often used in the more general context of reinforcement learning, we present Almost Boltzmann …

    uiuc Repository record for Multi-armed bandits and applications to large datasets (opens in a new tab)

  8. Learning to Navigate Over Stochastic Transport Networks Using Multi-Armed Bandits: A Contextual Approach for Efficient Online Learning in Road Network Graphs with Multi-Armed Bandits to Minimize Long- Term Travel Time

    … is by viewing route selections as a multi-armed bandit problem. This allows the system to adapt and recommend better routes over time, to minimize energy consumption. For navigation systems to be useful in practice, guiding vehicles from one point to another in minimal time is crucial. Therefore, …

    chalmers Repository record for Learning to Navigate Over Stochastic Transport Networks Using Multi-Armed Bandits: A Contextual Approach for Efficient Online Learning in Road Network Graphs with Multi-Armed Bandits to Minimize Long- Term Travel Time (opens in a new tab)

  9. Contextual Bandits for Non-Stationary Multi-Agent Environments Using Assumptions-Alignment Tracking

    … optimal selections in such contexts is found in bandit algorithms. However, traditional bandits often (1) assume the environment is stationary, (2) focus on asymptotic performance, and (3) do not incorporate available external information about the environment. While contextual bandits that do …

    byu Repository record for Contextual Bandits for Non-Stationary Multi-Agent Environments Using Assumptions-Alignment Tracking (opens in a new tab) Download PDF for Contextual Bandits for Non-Stationary Multi-Agent Environments Using Assumptions-Alignment Tracking (opens in a new tab)

  10. Online learning algorithms for wireless scheduling

    … learning, and more specifically, multi-armed bandit algorithms, has recently garnered significant interest across diverse fields. Within an online learning framework, agents can leverage past interactions with their environment to optimize future decisions, making it an ideal mechanism for use …

    texas Repository record for Online learning algorithms for wireless scheduling (opens in a new tab)

  11. AlegAATr the Bandit

    … time step during task execution, the agent, or bandit, chooses which of the N behaviors to use. Traditional bandit algorithms often (1) assume the environment is stationary, (2) focus on asymptotic performance, and (3) do not incorporate external information available to them. Each of these …

    byu Repository record for AlegAATr the Bandit (opens in a new tab) Download PDF for AlegAATr the Bandit (opens in a new tab)

  12. Structured bandits and applications : exploiting problem structure for better decision-making under uncertainty

    … of decision-making under uncertainty in the bandit setting. This thesis goes beyond the well-studied multi-armed bandit model to consider structured bandit settings and their applications. In particular, we learn to make better decisions by leveraging the application-specific …

    ubc Repository record for Structured bandits and applications : exploiting problem structure for better decision-making under uncertainty (opens in a new tab) Download PDF for Structured bandits and applications : exploiting problem structure for better decision-making under uncertainty (opens in a new tab)

  13. Primary User Emulation Attacks in Cognitive Radio - An Experimental Demonstration and Analysis

    … In the second method the jammer uses adversarial bandit algorithms to avoid channels already heavily disrupted from primary user communications and concentrate efforts on channels heavily populated by secondary user communications. In addition the secondary users apply similar methods to avoid …

    ut-knoxville Repository record for Primary User Emulation Attacks in Cognitive Radio - An Experimental Demonstration and Analysis (opens in a new tab)

  14. ONLINE LARGE-SCALE HYPOTHESIS TESTING WITH CORRUPTED DATA

    … draw insights from studying corruption-robust bandit algorithms and aim to advance the adversarial online multiple-hypothesis testing field.

    nps Repository record for ONLINE LARGE-SCALE HYPOTHESIS TESTING WITH CORRUPTED DATA (opens in a new tab)

  15. Contextual Bandits with hard-safety constraints

    Recently, Contextual Bandit algorithms with stage-wise constraints have attracted much attention due to their applicability in real-world contexts such as determining optimal dosages or ad policies. Nonetheless, a drawback is that they ensure high-probability guarantees only for the expected cost …

    bu Repository record for Contextual Bandits with hard-safety constraints (opens in a new tab)

  16. Linearizing Contextual Multi-Armed Bandit Problems with Latent Dynamics

    In many real-world applications of multi-armed bandit problems, both rewards and observed contexts are often influenced by confounding latent variables which evolve stochastically over time. While the observed contexts and rewards are nonlinearly related, prior knowledge of latent graphical …

    waterloo Repository record for Linearizing Contextual Multi-Armed Bandit Problems with Latent Dynamics (opens in a new tab)

  17. Learning Heterogeneous Resource-Constrained Task Allocation Using Concurrent Multi-Task Bandits

    … algorithm called Concurrent Multi-Task Adaptive Bandits (CMTAB), which leverages and builds upon continuum-armed bandit algorithms. Our experiments, which involve detailed numerical simulations and a simulated emergency response task, demonstrate that CMTAB is effective at balancing exploration …

    gatech Repository record for Learning Heterogeneous Resource-Constrained Task Allocation Using Concurrent Multi-Task Bandits (opens in a new tab)

  18. New Spatio-temporal Hawkes Process Models For Social Good

    … integrate Hawkes Process models with multi-armed bandit algorithms, high dimensional marks, and high-dimensional auxiliary data to solve problems in search and rescue, forecasting infectious disease, and early detection of overdose spikes. In Chapter 3, we develop a method applications to the …

    iupui Repository record for New Spatio-temporal Hawkes Process Models For Social Good (opens in a new tab)

  19. Online learning for self-optimization in heterogeneous networks

    … we propose the use of online learning algorithms, which learn efficient network configurations from experience without explicitly knowing the accurate mathematical model of the network beforehand. The first part of this thesis addresses the configuration of the IC mechanism in HetNets. …

    upc-spain Repository record for Online learning for self-optimization in heterogeneous networks (opens in a new tab)

Page 1 of 3