Pure exploration in multi-armed bandits problems
From MaRDI portal
Recommendations
- Pure exploration in finitely-armed and continuous-armed bandits
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Finite-time analysis of the multiarmed bandit problem
- The sample complexity of exploration in the multi-armed bandit problem
- Lower bounds on the sample complexity of exploration in the multi-armed bandit problem.
Cites work
- Asymptotically efficient adaptive allocation rules
- Finite-time analysis of the multiarmed bandit problem
- scientific article; zbMATH DE number 2089367 (Why is no real title available?)
- Learning Theory
- Pure exploration in multi-armed bandits problems
- Some aspects of the sequential design of experiments
- The Nonstochastic Multiarmed Bandit Problem
- The sample complexity of exploration in the multi-armed bandit problem
Cited in
(37)- Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
- Sequential estimation of quantiles with applications to A/B testing and best-arm identification
- Pure exploration in finitely-armed and continuous-armed bandits
- Algorithm portfolios for noisy optimization
- Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search
- scientific article; zbMATH DE number 3867090 (Why is no real title available?)
- Bayesian Incentive-Compatible Bandit Exploration
- Pure exploration in multi-armed bandits problems
- Exploration and exploitation of scratch games
- scientific article; zbMATH DE number 6982311 (Why is no real title available?)
- Learning Theory
- scientific article; zbMATH DE number 1907146 (Why is no real title available?)
- A bandit-learning approach to multifidelity approximation
- Optimal policy for dynamic assortment planning under multinomial logit models
- Smoothness-Adaptive Contextual Bandits
- Exploration-exploitation policies with almost sure, arbitrarily slow growing asymptotic regret
- Always Valid Inference: Continuous Monitoring of A/B Tests
- Optimal exploration-exploitation in a multi-armed bandit problem with non-stationary rewards
- Tractable sampling strategies for ordinal optimization
- Simple Bayesian algorithms for best-arm identification
- Explore first, exploit next: the true shape of regret in bandit problems
- Variable Selection Via Thompson Sampling
- Convergence rate analysis for optimal computing budget allocation algorithms
- Constrained regret minimization for multi-criterion multi-armed bandits
- Treatment recommendation with distributional targets
- Pure Exploration for Multi-Armed Bandit Problems
- A dynamic programming strategy to balance exploration and exploitation in the bandit problem
- Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
- Optimizing Sharpe ratio: risk-adjusted decision-making in multi-armed bandits
- On the problem of best arm retention
- On the problem of best arm retention
- Top-k combinatorial bandits with full-bandit feedback
- General parallel optimization a without metric
- Hyperband: a novel bandit-based approach to hyperparameter optimization
- Quantum spatial best-arm identification on a complete bipartite graph
- Multi-armed bandits with episode context
- Adaptive-treed bandits
This page was built for publication: Pure exploration in multi-armed bandits problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648740)
