Pages that link to "Item:Q2810878"
From MaRDI portal
The following pages link to An information-theoretic analysis of Thompson sampling (Q2810878):
Displaying 26 items.
- Generalizations of maximal inequalities to arbitrary selection rules (Q1640918) (← links)
- Foraging decisions as multi-armed bandit problems: applying reinforcement learning algorithms to foraging data (Q1730108) (← links)
- Exploratory distributions for convex functions (Q1737974) (← links)
- Improved regret for zeroth-order adversarial bandit convex optimisation (Q2035748) (← links)
- Dismemberment and design for controlling the replication variance of regret for the multi-armed bandit (Q2081727) (← links)
- Probabilistic bisection with spatial metamodels (Q2184151) (← links)
- Adaptive policies for perimeter surveillance problems (Q2286935) (← links)
- On the Prior Sensitivity of Thompson Sampling (Q2831392) (← links)
- A Tutorial on Thompson Sampling (Q4556183) (← links)
- Multi-Armed Bandit for Species Discovery: A Bayesian Nonparametric Approach (Q4690972) (← links)
- Learning to Optimize via Information-Directed Sampling (Q4969321) (← links)
- Matching While Learning (Q4994180) (← links)
- Bandit Theory: Applications to Learning Healthcare Systems and Clinical Trials (Q5072150) (← links)
- Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning (Q5089723) (← links)
- Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
- Efficient Simulation of High Dimensional Gaussian Vectors (Q5219708) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- On the Worth of Perfect Information in Bandits with Random Discounting (Q5458027) (← links)
- Satisficing in Time-Sensitive Bandit Learning (Q5870357) (← links)
- Entropy Regularization for Mean Field Games with Learning (Q5870374) (← links)
- A Bayesian approach to (online) transfer learning: theory and algorithms (Q6066772) (← links)
- Information theory for ranking and selection (Q6093553) (← links)
- Reward Maximization Through Discrete Active Inference (Q6136191) (← links)
- Lower bounds on the noiseless worst-case complexity of efficient global optimization (Q6536837) (← links)
- Generalized probabilistic bisection for stochastic root finding (Q6600075) (← links)
- Occupancy information ratio: infinite-horizon, information-directed, parameterized policy search (Q6652398) (← links)
