Pages that link to "Item:Q5396763"

The following pages link to Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (Q5396763):

Displaying 50 items.

• Multi-armed bandits based on a variant of simulated annealing (Q2520136) (← links)
• Mechanisms with learning for stochastic multi-armed bandit problems (Q2520139) (← links)
• Distributed cooperative decision making in multi-agent multi-armed bandits (Q2663944) (← links)
• Personalized optimization with user's feedback (Q2665405) (← links)
• Worst-case regret analysis of computationally budgeted online kernel selection (Q2673319) (← links)
• Budget-limited distribution learning in multifidelity problems (Q2678969) (← links)
• Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models (Q2680788) (← links)
• Controlling unknown linear dynamics with bounded multiplicative regret (Q2692507) (← links)
• Multi-channel transmission scheduling with hopping scheme under uncertain channel states (Q2694160) (← links)
• Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points (Q2696568) (← links)
• Online learning methods for networking (Q2799529) (← links)
• Online collaborative filtering on graphs (Q2830757) (← links)
• On the Prior Sensitivity of Thompson Sampling (Q2831392) (← links)
• Cloud Conveyors System: A Versatile Application for Exploring Cyber-Physical Systems (Q2925496) (← links)
• Indifference-Zone-Free Selection of the Best (Q2957472) (← links)
• Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) (← links)
• Differentially Private and Budget-Limited Bandit Learning over Matroids (Q3386800) (← links)
• Dynamic Assortment Personalization in High Dimensions (Q3387950) (← links)
• Bayesian Incentive-Compatible Bandit Exploration (Q3387959) (← links)
• Pure Exploration in Multi-armed Bandits Problems (Q3648740) (← links)
• (Q4558161) (← links)
• (Q4558509) (← links)
• (Q4558552) (← links)
• Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback (Q4596721) (← links)
• Efficient Ranking and Selection in Parallel Computing Environments (Q4604911) (← links)
• Learning the distribution with largest mean: two bandit frameworks (Q4606431) (← links)
• (Q4633073) (← links)
• Multi-Armed Bandit for Species Discovery: A Bayesian Nonparametric Approach (Q4690972) (← links)
• On Monte-Carlo tree search for deterministic games with alternate moves and complete information (Q4967797) (← links)
• (Q4969138) (← links)
• Learning to Optimize via Information-Directed Sampling (Q4969321) (← links)
• Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
• Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems (Q4974598) (← links)
• (Q4986381) (← links)
• Nonasymptotic sequential tests for overlapping hypotheses applied to near-optimal arm identification in bandit models (Q4987192) (← links)
• Online Learning over a Finite Action Set with Limited Switching (Q4991672) (← links)
• Competing bandits: learning under competition (Q4993317) (← links)
• Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach (Q4994160) (← links)
• Matching While Learning (Q4994180) (← links)
• (Q4998863) (← links)
• (Q4998871) (← links)
• (Q4998901) (← links)
• Online Allocation and Pricing: Constant Regret via Bellman Inequalities (Q5003719) (← links)
• Nonparametric Pricing Analytics with Customer Covariates (Q5003728) (← links)
• A Bandit-Learning Approach to Multifidelity Approximation (Q5022495) (← links)
• Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models (Q5026455) (← links)
• Bounded Regret for Finitely Parameterized Multi-Armed Bandits (Q5050096) (← links)
• (Q5053204) (← links)
• (Q5053221) (← links)
• (Q5053268) (← links)