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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
Bandit Theory and Thompson Sampling-Guided Directed Evolution for Sequence Optimization
Incentivizing Combinatorial Bandit Exploration
Mixed-Effect Thompson Sampling
Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits
Surrogate modeling for Bayesian optimization beyond a single Gaussian process
Information-Directed Selection for Top-Two Algorithms
Fast Change Identification in Multi-Play Bandits and its Applications in Wireless Networks
Semi-Parametric Contextual Bandits with Graph-Laplacian Regularization
Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization
Non-Stationary Bandit Learning via Predictive Sampling
Thompson Sampling for Bandit Learning in Matching Markets
Evolutionary Multi-Armed Bandits with Genetic Thompson Sampling
On Kernelized Multi-Armed Bandits with Constraints
Multi-armed bandits for resource efficient, online optimization of language model pre-training: the use case of dynamic masking
Thompson Sampling on Asymmetric $α$-Stable Bandits
Regenerative Particle Thompson Sampling
Multi-Agent Active Search using Detection and Location Uncertainty
Partial Likelihood Thompson Sampling
An Analysis of Ensemble Sampling
Scalable Bayesian Optimization Using Vecchia Approximations of Gaussian Processes
Towards Scalable and Robust Structured Bandits: A Meta-Learning Framework
Thompson Sampling with Unrestricted Delays
Double Thompson Sampling in Finite stochastic Games
Adaptive Experimentation in the Presence of Exogenous Nonstationary Variation
Fast online inference for nonlinear contextual bandit based on Generative Adversarial Network
Synthetically Controlled Bandits
Remote Contextual Bandits
Fourier Representations for Black-Box Optimization over Categorical Variables
Bayesian Non-stationary Linear Bandits for Large-Scale Recommender Systems
On learning Whittle index policy for restless bandits with scalable regret
Tsetlin Machine for Solving Contextual Bandit Problems
Deep Hierarchy in Bandits
Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework
Evaluating Deep Vs. Wide & Deep Learners As Contextual Bandits For Personalized Email Promo Recommendations
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.