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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions
Sample-based Dynamic Hierarchical Transformer with Layer and Head Flexibility via Contextual Bandit
The Sliding Regret in Stochastic Bandits: Discriminating Index and Randomized Policies
Thompson sampling for zero-inflated count outcomes with an application to the Drink Less mobile health study
Probabilistic Inference in Reinforcement Learning Done Right
A Distributed Neural Linear Thompson Sampling Framework to Achieve URLLC in Industrial IoT
Adaptive Interventions with User-Defined Goals for Health Behavior Change
Exploration via linearly perturbed loss minimisation
Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds
Batch Bayesian Optimization for Replicable Experimental Design
Dual-Directed Algorithm Design for Efficient Pure Exploration
Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
Little Exploration is All You Need
qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling
Making RL with Preference-based Feedback Efficient via Randomization
Parallel Bayesian Optimization Using Satisficing Thompson Sampling for Time-Sensitive Black-Box Optimization
Using Adaptive Bandit Experiments to Increase and Investigate Engagement in Mental Health
Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretraining
Optimal Exploration is no harder than Thompson Sampling
Module-wise Adaptive Distillation for Multimodality Foundation Models
Thompson Exploration with Best Challenger Rule in Best Arm Identification
From Bandits Model to Deep Deterministic Policy Gradient, Reinforcement Learning with Contextual Information
Monte-Carlo tree search with uncertainty propagation via optimal transport
Task Selection and Assignment for Multi-modal Multi-task Dialogue Act Classification with Non-stationary Multi-armed Bandits
gym-saturation: Gymnasium environments for saturation provers (System description)
Simple Modification of the Upper Confidence Bound Algorithm by Generalized Weighted Averages
Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach
Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
AdaptEx: A Self-Service Contextual Bandit Platform
Bag of Policies for Distributional Deep Exploration
VITS : Variational Inference Thompson Sampling for contextual bandits
Approximate information for efficient exploration-exploitation strategies
Thompson Sampling under Bernoulli Rewards with Local Differential Privacy
Thompson sampling for improved exploration in GFlowNets
Scalable Neural Contextual Bandit for Recommender Systems
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.