Pages that link to "Item:Q5396763"
From MaRDI portal
The following pages link to Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (Q5396763):
Displaying 50 items.
- (Q5053317) (← links)
- (Q5053323) (← links)
- Smoothness-Adaptive Contextual Bandits (Q5060496) (← links)
- Smooth Contextual Bandits: Bridging the Parametric and Nondifferentiable Regret Regimes (Q5060501) (← links)
- Setting Reserve Prices in Second-Price Auctions with Unobserved Bids (Q5060778) (← links)
- EXPLORATION–EXPLOITATION POLICIES WITH ALMOST SURE, ARBITRARILY SLOW GROWING ASYMPTOTIC REGRET (Q5070864) (← links)
- Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization (Q5072586) (← links)
- Bayesian Exploration: Incentivizing Exploration in Bayesian Games (Q5080666) (← links)
- An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization (Q5081777) (← links)
- Ranking and Selection with Covariates for Personalized Decision Making (Q5084611) (← links)
- Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization (Q5085988) (← links)
- Regret bounds for Narendra-Shapiro bandit algorithms (Q5086451) (← links)
- (Q5092356) (← links)
- Always Valid Inference: Continuous Monitoring of A/B Tests (Q5095177) (← links)
- Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency (Q5106381) (← links)
- On strict sub-Gaussianity, optimal proxy variance and symmetry for bounded random variables (Q5110208) (← links)
- Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (Q5113912) (← links)
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
- Bandits with Global Convex Constraints and Objective (Q5129206) (← links)
- Online Decision Making with High-Dimensional Covariates (Q5130496) (← links)
- Online Network Revenue Management Using Thompson Sampling (Q5131540) (← links)
- Tractable Sampling Strategies for Ordinal Optimization (Q5131546) (← links)
- A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model (Q5137960) (← links)
- Adaptive Matching for Expert Systems with Uncertain Task Types (Q5144772) (← links)
- Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors (Q5144779) (← links)
- Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds (Q5144789) (← links)
- (Q5159407) (← links)
- (Q5159414) (← links)
- (Q5159459) (← links)
- Multi-Armed Bandits: Theory and Applications to Online Learning in Networks (Q5211838) (← links)
- Best Arm Identification for Contaminated Bandits (Q5214178) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- (Q5219717) (← links)
- Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (Q5219722) (← links)
- Learning‐based iterative modular adaptive control for nonlinear systems (Q5222720) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Bayesian Uncertainty Directed Trial Designs (Q5242442) (← links)
- Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution (Q5244873) (← links)
- Learning to Optimize via Posterior Sampling (Q5247618) (← links)
- Online Learning of Nash Equilibria in Congestion Games (Q5252509) (← links)
- Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science (Q5254790) (← links)
- MULTI-ARMED BANDITS UNDER GENERAL DEPRECIATION AND COMMITMENT (Q5358026) (← links)
- Bandit-Based Task Assignment for Heterogeneous Crowdsourcing (Q5380349) (← links)
- (Q5381137) (← links)
- Learning in Repeated Auctions (Q5863991) (← links)
- Small-Loss Bounds for Online Learning with Partial Information (Q5868953) (← links)
- A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint (Q5870348) (← links)
- Satisficing in Time-Sensitive Bandit Learning (Q5870357) (← links)
- Functional Sequential Treatment Allocation (Q5881136) (← links)
- Multi-Item Nontruthful Auctions Achieve Good Revenue (Q5885584) (← links)
