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 14 of 14 for “"Multi-Arm Bandit"”.

  1. 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)

  2. Study of Customer Behavior in a Revenue Management Setting Using Data-Driven Approaches

    … One way of modeling this trade-off is using the multi-arm bandit modeling approach. Many algorithms have been proposed to solve stochastic multi-arm bandit problems. Our focus is on the Thompson Sampling (TS) algorithm which takes a Bayesian approach and was introduced by William R. Thompson. We …

    washington Repository record for Study of Customer Behavior in a Revenue Management Setting Using Data-Driven Approaches (opens in a new tab)

  3. A Lightweight Machine-Learning Framework for Enhancing Security in Iot Blockchain Networks

    … through a novel reward function and robust multi-arm bandit algorithm. The second section synthesizes realistic blockchain attack transaction data to empower learning in a distributed setting. The third and fourth sections together create a reputation system and consensus scheme for …

    must-thes Repository record for A Lightweight Machine-Learning Framework for Enhancing Security in Iot Blockchain Networks (opens in a new tab)

  4. Bandit-based Delay-Aware Service Function Chain Orchestration at the Edge

    … management for mobile applications that requires multiple computing resources. Such applications are often handled in a fashion of service function chain (SFC), which designates a sequence of virtual network functions (VNF) for users’ traffic to traverse in order to realize their network …

    calgary Repository record for Bandit-based Delay-Aware Service Function Chain Orchestration at the Edge (opens in a new tab)

  5. Adaptive Model Aggregation for Decentralized Federated Learning in Vehicular Networks

    … innovates an algorithm inspired by Contextual Multi-Arm Bandit (CMAB) theory, adapting the threshold for each vehicle based on the current communication dynamics of the network. The efficacy of AMA is tested through a series of comprehensive evaluations conducted within simulated environments, …

    calgary Repository record for Adaptive Model Aggregation for Decentralized Federated Learning in Vehicular Networks (opens in a new tab)

  6. A multi-armed bandit approach to superquantile selection

    … framework for this problem is that of a multi-armed bandit, a classic iterative decision learning process. This thesis presents a new approach to identifying the optimal arm(s) of a multi-arm bandit with the largest or smallest quantile or superquantile risk, under a loss constraint. This …

    nps Repository record for A multi-armed bandit approach to superquantile selection (opens in a new tab)

  7. Optimizing deep learning networks using multi-armed bandits

    … for pruning that utilize a framework, known as a multi-armed bandit, which has been successfully applied in applications where there is a need to learn which option to select given the outcome of trials. There are several different multi-arm bandit methods, and these have been used to develop new …

    salford Download PDF for Optimizing deep learning networks using multi-armed bandits (opens in a new tab)

  8. DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback

    We study the problem of restless multi-arm Bandit in which a decision maker pulls arms to maximize the reward function. Each arm is associated with a Markov decision process containing various states and the action space of cardinality 2 based on whether the arm is pulled or activated. Based on the …

    tamu Repository record for DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback (opens in a new tab) Embargoed until 2026-12-01

  9. Statistical inference for change-point detection, adaptive trials, and preference learning

    … Thompson Sampling (RiTS), a contextual multi-arm bandit algorithm for adaptive dose allocation in early-phase clinical trials with composite endpoints. By combining separate Thompson samplers for efficacy and safety with a pre-specified risk-tolerance weight, RiTS personalizes dose …

    iastate Repository record for Statistical inference for change-point detection, adaptive trials, and preference learning (opens in a new tab)

  10. Optimal Route Planning for Parking Enforcement Patrol using Reinforcement Learning

    … for the proposed problem; then, we propose a multi-arm bandit formulation and use reinforcement learning to sequentially generate routes to maximize the system's expected reward. Next, we will analyze the performance of our framework against the current patrol policies being conducted in the …

    calgary Repository record for Optimal Route Planning for Parking Enforcement Patrol using Reinforcement Learning (opens in a new tab)

  11. The effect of stress on the explore-exploit dilemma

    When humans are faced with multiple options, they must decide whether to choose a novel or less certain option (explore) or stick with what they know (exploit). Exploration is a fundamental cognitive process. Importantly, when humans attempt to solve the explore-exploit dilemma, they must …

    uvic Repository record for The effect of stress on the explore-exploit dilemma (opens in a new tab)

  12. Online Decision Making Under Information-Theoretic Constraints

    We consider the problems of online decision-making under two categories of information theoretical constraints, namely, security and communication constraints. Three types of security constraints considered in this thesis are secrecy, covertness, and robustness, where the objectives are to make the …

    gatech Repository record for Online Decision Making Under Information-Theoretic Constraints (opens in a new tab)

  13. EFFICIENT RESOURCE MANAGEMENT OF CLOUD NATIVE SYSTEMS

    … allocations with an algorithm inspired by multi-arm bandit (MAP). Although Sinan outperforms traditional approaches such as autoscaling, it requires a lengthy exploration process and triggers a large number of SLA violations, hindering its practicality. Furthermore, the ML models are on the …

    cornell Repository record for EFFICIENT RESOURCE MANAGEMENT OF CLOUD NATIVE SYSTEMS (opens in a new tab)