The following pages link to A Tutorial on Thompson Sampling (Q4556183):
Displaying 23 items.
- Randomized allocation with nonparametric estimation for contextual multi-armed bandits with delayed rewards (Q2006767) (← links)
- IntelligentPooling: practical Thompson sampling for mHealth (Q2071414) (← links)
- Gittins' theorem under uncertainty (Q2076662) (← links)
- Fundamental design principles for reinforcement learning algorithms (Q2094028) (← links)
- Choosing the best arm with guaranteed confidence (Q2096406) (← links)
- On the sample complexity of the linear quadratic regulator (Q2194770) (← links)
- Ballooning multi-armed bandits (Q2238588) (← links)
- Quantum greedy algorithms for multi-armed bandits (Q2693852) (← links)
- Bayesian optimization package: PHYSBO (Q2701242) (← links)
- (Q4998868) (← links)
- (Q5053193) (← links)
- (Q5053221) (← links)
- SAMBA: A Generic Framework for Secure Federated Multi-Armed Bandits (Q5076321) (← links)
- (Q5159398) (← links)
- (Q5214215) (← links)
- Ensemble Kalman Sampler: Mean-field Limit and Convergence Analysis (Q5858114) (← links)
- Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (Q5868941) (← links)
- Satisficing in Time-Sensitive Bandit Learning (Q5870357) (← links)
- Fairness improvement for black-box classifiers with Gaussian process (Q6066141) (← links)
- Online learning of network bottlenecks via minimax paths (Q6097144) (← links)
- Reward Maximization Through Discrete Active Inference (Q6136191) (← links)
- Online learning of energy consumption for navigation of electric vehicles (Q6157210) (← links)
- Branching time active inference: the theory and its generality (Q6488696) (← links)
