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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Improving Portfolio Optimization Results with Bandit Networks
Partially Observable Contextual Bandits with Linear Payoffs
Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
Sliding-Window Thompson Sampling for Non-Stationary Settings
Multi-Task Combinatorial Bandits for Budget Allocation
Improving Thompson Sampling via Information Relaxation for Budgeted Multi-armed Bandits
An Extremely Data-efficient and Generative LLM-based Reinforcement Learning Agent for Recommenders
Contextual Bandit with Herding Effects: Algorithms and Recommendation Applications
Constructing Adversarial Examples for Vertical Federated Learning: Optimal Client Corruption through Multi-Armed Bandit
Optimization-Driven Adaptive Experimentation
Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic
Process-constrained batch Bayesian approaches for yield optimization in multi-reactor systems
Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
Thompson Sampling Itself is Differentially Private
Scalable Exploration via Ensemble++
DRL-based Joint Resource Scheduling of eMBB and URLLC in O-RAN
Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
Preferential Multi-Objective Bayesian Optimization
Joint User Association and Pairing in Multi-UAV-Assisted NOMA Networks: A Decaying-Epsilon Thompson Sampling Framework
More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling
Memory Sequence Length of Data Sampling Impacts the Adaptation of Meta-Reinforcement Learning Agents
Improving Reward-Conditioned Policies for Multi-Armed Bandits using Normalized Weight Functions
Graph Neural Thompson Sampling
A Federated Online Restless Bandit Framework for Cooperative Resource Allocation
DISCO: An End-to-End Bandit Framework for Personalised Discount Allocation
Two-Stage Resource Allocation in Reconfigurable Intelligent Surface Assisted Hybrid Networks via Multi-Player Bandits
Adaptively Learning to Select-Rank in Online Platforms
Speculative Decoding via Early-exiting for Faster LLM Inference with Thompson Sampling Control Mechanism
A Bayesian Approach to Online Planning
Approximate Thompson Sampling for Learning Linear Quadratic Regulators with $O(\sqrt{T})$ Regret
Cost-efficient Knowledge-based Question Answering with Large Language Models
On Bits and Bandits: Quantifying the Regret-Information Trade-off
Code Repair with LLMs gives an Exploration-Exploitation Tradeoff
Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
Understanding the Training and Generalization of Pretrained Transformer for Sequential Decision Making
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.