Cover Image

Improving Thompson Sampling via Information Relaxation for Budgeted Multi-armed Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jeong, Woojin, Min, Seungki
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Meritocratic Fairness in Budgeted Combinatorial Multi-armed Bandits via Shapley Values
by: Sharma, Shradha, et al.
Published: (2026)

Causally Abstracted Multi-armed Bandits
by: Zennaro, Fabio Massimo, et al.
Published: (2024)

Deceptive Exploration in Multi-armed Bandits
by: Vurankaya, I. Arda, et al.
Published: (2025)

Towards a Pretrained Model for Restless Bandits via Multi-arm Generalization
by: Zhao, Yunfan, et al.
Published: (2023)

Distilled Thompson Sampling: Practical and Efficient Thompson Sampling via Imitation Learning
by: Namkoong, Hongseok, et al.
Published: (2020)

Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
by: Mukherjee, Arpan, et al.
Published: (2024)

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
by: Moradipari, Ahmadreza, et al.
Published: (2023)

Thompson Sampling via Fine-Tuning of LLMs
by: Menet, Nicolas, et al.
Published: (2025)

Rethinking Reinforcement fine-tuning of LLMs: A Multi-armed Bandit Learning Perspective
by: Hu, Xiao, et al.
Published: (2026)

Contextual Thompson Sampling via Generation of Missing Data
by: Zhang, Kelly W., et al.
Published: (2025)

Graph Neural Thompson Sampling
by: Wu, Shuang, et al.
Published: (2024)

FedPOB: Sample-Efficient Federated Prompt Optimization via Bandits
by: Lu, Pingchen, et al.
Published: (2025)

From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
by: Erez, Liad, et al.
Published: (2025)

FedRTS: Federated Robust Pruning via Combinatorial Thompson Sampling
by: Huang, Hong, et al.
Published: (2025)

Adaptive Budget Optimization for Multichannel Advertising Using Combinatorial Bandits
by: Gangopadhyay, Briti, et al.
Published: (2025)

MINTS: Minimalist Thompson Sampling
by: Wang, Kaizheng
Published: (2026)

Adaptive Budgeted Multi-Armed Bandits for IoT with Dynamic Resource Constraints
by: Vaishnav, Shubham, et al.
Published: (2025)

Contextual Budget Bandit for Food Rescue Volunteer Engagement
by: Tang, Ariana, et al.
Published: (2025)

Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo
by: Zheng, Haoyang, et al.
Published: (2024)

Thompson Sampling for Multi-Objective Linear Contextual Bandit
by: Park, Somangchan, et al.
Published: (2025)

Rethinking Langevin Thompson Sampling from A Stochastic Approximation Perspective
by: Wang, Weixin, et al.
Published: (2025)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
by: Erez, Liad, et al.
Published: (2026)

TimeBridge: Better Diffusion Prior Design with Bridge Models for Time Series Generation
by: Park, Jinseong, et al.
Published: (2024)

Flickering Multi-Armed Bandits
by: Chakraborty, Sourav, et al.
Published: (2026)

BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms
by: Hou, Yunlong, et al.
Published: (2025)

Efficient Multi-objective Prompt Optimization via Pure-exploration Bandits
by: Li, Donghao, et al.
Published: (2026)

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
by: Ji, Kaixuan, et al.
Published: (2026)

Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits
by: Sun, Jiazheng, et al.
Published: (2025)

BOTS: Batch Bayesian Optimization of Extended Thompson Sampling for Severely Episode-Limited RL Settings
by: Karine, Karine, et al.
Published: (2024)

Co-Exploration and Co-Exploitation via Shared Structure in Multi-Task Bandits
by: Mukherjee, Sumantrak, et al.
Published: (2025)

Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)

The Real Price of Bandit Information in Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)

Fair Algorithms with Probing for Multi-Agent Multi-Armed Bandits
by: Xu, Tianyi, et al.
Published: (2025)

Comparing Exploration-Exploitation Strategies of LLMs and Humans: Insights from Standard Multi-armed Bandit Experiments
by: Zhang, Ziyuan, et al.
Published: (2025)

Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback
by: Xiong, Guojun, et al.
Published: (2024)

Optimism Stabilizes Thompson Sampling for Adaptive Inference
by: Yan, Shunxing, et al.
Published: (2026)

Transfer in Sequential Multi-armed Bandits via Reward Samples
by: R, Rahul N, et al.
Published: (2024)

Networked Restless Multi-Arm Bandits with Reinforcement Learning
by: Zhang, Hanmo, et al.
Published: (2025)

Large Language Model-Enhanced Multi-Armed Bandits
by: Sun, Jiahang, et al.
Published: (2025)

Multi-Armed Bandits-Based Optimization of Decision Trees
by: Shanto, Hasibul Karim, et al.
Published: (2025)