Pages that link to "Item:Q1614793"
From MaRDI portal
The following pages link to Optimal learning and experimentation in bandit problems. (Q1614793):
Displaying 40 items.
- Optimal experimental design for a class of bandit problems (Q618180) (← links)
- Analyzing bandit-based adaptive operator selection mechanisms (Q647443) (← links)
- Periodic learning about a hidden state variable (Q690170) (← links)
- A comparative study of ad hoc techniques and evolutionary methods for multi-armed bandit problems (Q949395) (← links)
- Online regret bounds for Markov decision processes with deterministic transitions (Q982638) (← links)
- Response adaptive designs that incorporate switching costs and constraints (Q997275) (← links)
- A Bayesian analysis of human decision-making on bandit problems (Q1042313) (← links)
- An experimental analysis of the bandit problem (Q1361094) (← links)
- Learning by doing and the value of optimal experimentation (Q1606181) (← links)
- Keeping your options open (Q1657578) (← links)
- A common value experimentation with multiarmed bandits (Q1720971) (← links)
- The K-armed bandit problem with multiple priors (Q1736953) (← links)
- Optimal stopping for Brownian motion with applications to sequential analysis and option pricing (Q1763432) (← links)
- Exploration and correlation (Q2002350) (← links)
- Gittins' theorem under uncertainty (Q2076662) (← links)
- The multi-armed bandit problem: an efficient nonparametric solution (Q2176624) (← links)
- On the optimal amount of experimentation in sequential decision problems (Q2267618) (← links)
- Choosing a good toolkit. I: Prior-free heuristics (Q2291801) (← links)
- Optimal learning of a set: or how to edit a journal if you must (Q2446253) (← links)
- On the value of learning for Bernoulli bandits with unknown parameters (Q2730296) (← links)
- Online learning methods for networking (Q2799529) (← links)
- Optimal learning with non-Gaussian rewards (Q2806349) (← links)
- Optimal sequential exploration: bandits, clairvoyants, and wildcats (Q2846423) (← links)
- Variance Regularization in Sequential Bayesian Optimization (Q3387910) (← links)
- A Learning Approach for Interactive Marketing to a Customer Segment (Q3392140) (← links)
- Online Regret Bounds for Markov Decision Processes with Deterministic Transitions (Q3529915) (← links)
- INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS (Q3585147) (← links)
- (Q4558161) (← links)
- Machine learning and nonparametric bandit theory (Q4850249) (← links)
- On Incomplete Learning and Certainty-Equivalence Control (Q4971399) (← links)
- The Local Time Method for Targeting and Selection (Q4971570) (← links)
- Optimistic Gittins Indices (Q5060515) (← links)
- Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
- Algorithms for recursive delegation (Q5145458) (← links)
- Optimal Learning by Experimentation (Q5202789) (← links)
- Bandits and Experts in Metric Spaces (Q5215459) (← links)
- ON THE IDENTIFICATION AND MITIGATION OF WEAKNESSES IN THE KNOWLEDGE GRADIENT POLICY FOR MULTI-ARMED BANDITS (Q5358114) (← links)
- Corrected random walk approximations to free boundary problems in optimal stopping (Q5426468) (← links)
- Sequential Generalized Likelihood Ratios and Adaptive Treatment Allocation for Optimal Sequential Selection (Q5478885) (← links)
- Optimal anytime regret with two experts (Q6062702) (← links)
