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 53 for “"Multi-Armed Bandit Problem"”.
-
Comparison of Arm Selection Policies for the Multi-Armed Bandit Problem
… customer experience and satisfaction. Contextual multi-armed bandit provides several strategies to address this online decision-making problem at a lower experimental cost than traditional A/B testing. In this study, we compare three common Contextual Bandit strategies that exist in literature …
-
Mathematical properties of the Stochastic Approximation and the Multi-Armed Bandit problem
… Τέλος, στο Κεφάλαιο 4, μελετάμε το πρόβλημα των multi-armed bandit, το αντικείμενο του οποίου είναι ο προσδιορισμός της πιο κερδοφόρας δράσης από ένα δοσμένο σύνολο, μαζί με την ταυτόχρονη μεγιστοποίηση του αναμενόμενου κέρδους μας σε βάθος χρόνου. Αποδεικνύουμε το φράγμα των Lai-Robbins, σύμφωνα …
-
THE CONFIDENCE BOUND METHOD FOR THE MULTI-ARMED BANDIT PROBLEM WITH LARGE ARM SIZE
We consider two modifications of the confidence bound method that achieve optimality in the case of large arm sizes. In the first situation we assume the arm size is infinitely large. We establish a regret lower bound and construct confidence bounds that achieve the regret lower bound …
-
A Control Theoretic Approach to the Stochastic Multi-armed Bandit Problem With Applications in Hyperparameter Optimization
… under uncertainty is a fundamental problem encountered frequently in many real-world applications. This challenge has been rigorously formulated as the Stochastic Multi-Armed Bandit (SMAB) problem, which consists of a learner interacting with an environment. For each interaction, the …
-
Stochastic control approach to the multi-armed bandit problems
<p>A multi-armed bandit is the simplest problem to study learning under uncertainty when decisions affect information. A standard approach to the multi-armed bandit often gives a heuristic construction of an algorithm and proves its regret bound. Following a constructive approach, it is often …
-
Multi-Armed Bandits with Risk-Aware Performance Measures
The classical multi-armed bandit problem involves a learner and a collection of arms with unknown reward distributions. At each round, the learner selects an arm and receives new information. The learner faces a tradeoff between exploiting the current information and exploring all arms. The …
-
Optimal Learning with Non-Gaussian Rewards
… the author studies sequential Bayesian learning problems modeled under non-Gaussian distributions. We focus on a class of problems called the multi-armed bandit problem, and studies its optimal learning strategy, the Gittins index policy. The Gittins index is computationally intractable and …
-
Sequential Decision Making With Resource Constraints
… decision making with partial feedback is the multi-armed bandit problem. This model has also found applications to a very diverse set of problems such as sequential design of experiments including medical decision-making, learning click-through rates in search engines, economic theory, network …
-
PERFORMANCE GUARANTEES FOR ONLINE LEARNING: CASCADING BANDITS AND ADVERSARIAL CORRUPTIONS
The multi-armed bandit problem (MAB) is an important online learning problem that exemplifies the dilemma between exploration and exploitation in sequential decision making. We explore different objectives for several settings of the MAB problem. Firstly, the prevalence of online recommender …
-
Efficient Text-Image Retrieval Using Large Language Models
… as applications increasingly rely on multimodal models such as CLIP. While CLIP offers strong joint image–text representations for semantic search, its globally pooled embeddings often struggle with fine-grained, multi-concept queries, leading to high false positives and reliance on …
-
Adaptive algorithms for stochastic optimization and bandit learning
… II focuses on two variants Prophet Inequality problem, where we design constant-competitive policies in limited information settings, and in dynamic variant of the problem with time-varying feasibility constraints. Finally, in Part III, we study a bandit-inspired algorithm for domain …
-
Spectrum monitoring in cognitive radio networks: a game-theoretical approach
… but it also generates spectrum misuse problems. We employ limited number of monitors to dynamically monitor all channels concerned, then detect and punish the malicious secondary users. The problem is which channels to monitor, how long to monitor each channel, and in which order to …
-
Low-complexity, low-regret link rate selection in rapidly varying wireless channels
We consider the problem of transmitting at the optimal rate over a rapidly varying wireless channel with unknown statistics when the feedback about channel quality is very limited. One motivation for this problem is that, in emerging wireless networks, the use of mmWave bands means that the channel …
-
Sequential decision problems in online education
… concerned with the study of sequential decision problems motivated by the challenge of selecting questions to give to students in an online educational environment. In online education there is the potential to develop personalized and adaptive learning environments, where students can receive …
-
Learning for exploration/exploitation in reinforcement learning
We consider the problem of learning high-performance Exploration/Exploitation (E/E) strategies for finite Markov Decision Processes (MDPs) when the MDP to be controlled is supposed to be drawn from a known probability distribution pM(·). The performance criterion is the sum of discounted rewards …
-
Group-Envy Fairness in the Stochastic Bandit Setting
… a new, group fairness-inspired stochastic multi-armed bandit problem in the pure exploration setting. We look at the discrepancy between an arm’s mean reward from a group and the highest mean reward for any arm from that group, and call this the disappointment that group suffers from that …
-
Bias-Corrected Peaks-Over-Threshold Estimation of theCVaR and Application to Multi-Armed Bandits
… to the CVaR level. To mitigate this problem, the CVaR can be estimated by extrapolating above a lower threshold than the VaR using a generalized Pareto distribution (GPD), which is often referred to as the peaks-over-threshold (POT) approach. This method often requires a very high …
-
ONLINE LEARNING, UNIFORM CONVERGENCE, AND A THEORY OF INTERPRETABILITY
… we address the role of feedback models for multiple online learning problems, the sample complexity for uniform convergence, and a learning-theoretic approach to interpretable machine learning. First, we focus on online learning and investigate variants of the multi-armed bandit problem, …
-
Leveraging Computational Tools to Inform Public Policy Process for Social Good
… out by the government needs to go through a multi-stage process from inception to conclusion. The multi-stage process is called the public policy process. Carrying out such a public policy process is time-consuming and error prone due to the complex nature of societal system. Using …
-
Constrained learning in the bandit setting: doubly optimistic strategies and fast rates
The (stochastic) bandit problem is a classic example used to address the challenge of balancing exploration and exploitation when dealing with bandit feedback. This dissertation focuses on stochastic bandits with constraints, where each action (or arm) bears both a reward and a safety risk. The …
Page 1 of 3