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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Neural Bandits for Data Mining: Searching for Dangerous Polypharmacy
Online Learning-based Waveform Selection for Improved Vehicle Recognition in Automotive Radar
Monte Carlo Tree Search Algorithms for Risk-Aware and Multi-Objective Reinforcement Learning
Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits
Atlas: Automate Online Service Configuration in Network Slicing
Optimizing Pessimism in Dynamic Treatment Regimes: A Bayesian Learning Approach
Meta Learning of Interface Conditions for Multi-Domain Physics-Informed Neural Networks
Sample-Then-Optimize Batch Neural Thompson Sampling
The Typical Behavior of Bandit Algorithms
Deep Active Ensemble Sampling For Image Classification
Cost Aware Asynchronous Multi-Agent Active Search
Thompson Sampling with Virtual Helping Agents
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits
A Nonparametric Contextual Bandit with Arm-level Eligibility Control for Customer Service Routing
Sample Efficient Learning of Factored Embeddings of Tensor Fields
Causal Bandits for Linear Structural Equation Models
Dynamic collaborative filtering Thompson Sampling for cross-domain advertisements recommendation
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning
Non-Stationary Dynamic Pricing Via Actor-Critic Information-Directed Pricing
Increasing Students' Engagement to Reminder Emails Through Multi-Armed Bandits
Using Adaptive Experiments to Rapidly Help Students
Bayesian Optimization-Based Beam Alignment for MmWave MIMO Communication Systems
SPRT-based Efficient Best Arm Identification in Stochastic Bandits
Chimera: A Hybrid Machine Learning Driven Multi-Objective Design Space Exploration Tool for FPGA High-Level Synthesis
Ranking In Generalized Linear Bandits
Risk-averse Contextual Multi-armed Bandit Problem with Linear Payoffs
Langevin Monte Carlo for Contextual Bandits
Analysis of Thompson Sampling for Controlling Unknown Linear Diffusion Processes
Thompson Sampling for (Combinatorial) Pure Exploration
Thompson Sampling Achieves $\tilde O(\sqrt{T})$ Regret in Linear Quadratic Control
Thompson Sampling for Robust Transfer in Multi-Task Bandits
A Contextual Combinatorial Semi-Bandit Approach to Network Bottleneck Identification
On Provably Robust Meta-Bayesian Optimization
Top Two Algorithms Revisited
Regret Bounds for Information-Directed Reinforcement Learning
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.