Papers with Code 아카이브
Thompson Sampling
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
Thompson sampling, named after William R. Thompson, is a heuristic for choosing actions that addresses the exploration-exploitation dilemma in the multi-armed bandit problem. It consists of choosing the action that maximizes the expected reward with respect to a randomly drawn belief.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Augmented RBMLE-UCB Approach for Adaptive Control of Linear Quadratic Systems
IBAC: An Intelligent Dynamic Bandwidth Channel Access Avoiding Outside Warning Range Problem
On Dynamic Pricing with Covariates
Algorithms for Adaptive Experiments that Trade-off Statistical Analysis with Reward: Combining Uniform Random Assignment and Reward Maximization
Risk and optimal policies in bandit experiments
Safe Linear Leveling Bandits
Bayesian Optimization over Permutation Spaces
Adaptive Gating for Single-Photon 3D Imaging
ESCADA: Efficient Safety and Context Aware Dose Allocation for Precision Medicine
Hierarchical Bayesian Bandits
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle
Maillard Sampling: Boltzmann Exploration Done Optimally
Online Learning of Energy Consumption for Navigation of Electric Vehicles
Efficient Inference Without Trading-off Regret in Bandits: An Allocation Probability Test for Thompson Sampling
Variational Bayesian Optimistic Sampling
Differentially Private Federated Bayesian Optimization with Distributed Exploration
Analysis of Thompson Sampling for Partially Observable Contextual Multi-Armed Bandits
Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes
Show Me the Whole World: Towards Entire Item Space Exploration for Interactive Personalized Recommendations
EE-Net: Exploitation-Exploration Neural Networks in Contextual Bandits
Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning
Asymptotic Performance of Thompson Sampling in the Batched Multi-Armed Bandits
Batched Thompson Sampling
Apple Tasting Revisited: Bayesian Approaches to Partially Monitored Online Binary Classification
Deep Exploration for Recommendation Systems
Vaccine allocation policy optimization and budget sharing mechanism using Thompson sampling
Online Learning of Network Bottlenecks via Minimax Paths
Machine Learning for Online Algorithm Selection under Censored Feedback
Thompson Sampling for Bandits with Clustered Arms
A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits
A relaxed technical assumption for posterior sampling-based reinforcement learning for control of unknown linear systems
Scalable regret for learning to control network-coupled subsystems with unknown dynamics
Batched Thompson Sampling for Multi-Armed Bandits
Metadata-based Multi-Task Bandits with Bayesian Hierarchical Models
Debiasing Samples from Online Learning Using Bootstrap
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.