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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Smart Routing with Precise Link Estimation: DSEE-Based Anypath Routing for Reliable Wireless Networking
Analyzing and Enhancing Queue Sampling for Energy-Efficient Remote Control of Bandits
Bayesian Optimization with LLM-Based Acquisition Functions for Natural Language Preference Elicitation
Efficient and Adaptive Posterior Sampling Algorithms for Bandits
Bayesian-Guided Generation of Synthetic Microbiomes with Minimized Pathogenicity
Randomized Exploration in Cooperative Multi-Agent Reinforcement Learning
Feel-Good Thompson Sampling for Contextual Dueling Bandits
Online Learning of Decision Trees with Thompson Sampling
A Reinforcement Learning based Reset Policy for CDCL SAT Solvers
On the Importance of Uncertainty in Decision-Making with Large Language Models
Meta Learning in Bandits within Shared Affine Subspaces
A resource-constrained stochastic scheduling algorithm for homeless street outreach and gleaning edible food
ε-Neural Thompson Sampling of Deep Brain Stimulation for Parkinson Disease Treatment
Cramming Contextual Bandits for On-policy Statistical Evaluation
TS-RSR: A provably efficient approach for batch Bayesian Optimization
Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems
Epsilon-Greedy Thompson Sampling to Bayesian Optimization
Influencing Bandits: Arm Selection for Preference Shaping
Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification
Diffusion Models Meet Contextual Bandits with Large Action Spaces
Thompson Sampling in Partially Observable Contextual Bandits
Tree Ensembles for Contextual Bandits
Context in Public Health for Underserved Communities: A Bayesian Approach to Online Restless Bandits
Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
Efficient Exploration for LLMs
Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo
Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
Model-Free Approximate Bayesian Learning for Large-Scale Conversion Funnel Optimization
Decentralized Multi-Agent Active Search and Tracking when Targets Outnumber Agents
Improving sample efficiency of high dimensional Bayesian optimization with MCMC
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
Zero-Inflated Bandits
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs
Best Arm Identification in Batched Multi-armed Bandit Problems
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.