Image de couverture de livre

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kim, Chaiwon, Lee, Jongyeong, Oh, Min-hwan
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
par: Lee, Jongyeong, et autres
Publié: (2024)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
par: Lee, Jongyeong, et autres
Publié: (2025)

A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem
par: Chen, Botao, et autres
Publié: (2026)

Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems
par: Zhan, Jingxin, et autres
Publié: (2025)

Exploration via Feature Perturbation in Contextual Bandits
par: Yi, Seouh-won, et autres
Publié: (2025)

Optimal and Practical Batched Linear Bandit Algorithm
par: Yu, Sanghoon, et autres
Publié: (2025)

Infrequent Exploration in Linear Bandits
par: Lee, Harin, et autres
Publié: (2025)

Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates
par: Yu, Sanghoon, et autres
Publié: (2026)

Improved Online Confidence Bounds for Multinomial Logistic Bandits
par: Lee, Joongkyu, et autres
Publié: (2025)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
par: Lee, Joongkyu, et autres
Publié: (2024)

Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent
par: Lee, Joongkyu, et autres
Publié: (2026)

Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
par: Lee, Harin, et autres
Publié: (2026)

Queueing Matching Bandits with Preference Feedback
par: Kim, Jung-hun, et autres
Publié: (2024)

Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification
par: Lee, Joongkyu, et autres
Publié: (2026)

Stochastic Matching Bandits with Rare Optimization Updates
par: Kim, Jung-hun, et autres
Publié: (2025)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
par: Kim, Seok-Jin, et autres
Publié: (2024)

Lasso Bandit with Compatibility Condition on Optimal Arm
par: Lee, Harin, et autres
Publié: (2024)

Experimental Design for Semiparametric Bandits
par: Kim, Seok-Jin, et autres
Publié: (2025)

Thompson Exploration with Best Challenger Rule in Best Arm Identification
par: Lee, Jongyeong, et autres
Publié: (2023)

Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
par: Hwang, Taehyun, et autres
Publié: (2026)

Blessings of Multiple Good Arms in Multi-Objective Linear Bandits
par: Ann, Heesang, et autres
Publié: (2026)

Oracle-Efficient Combinatorial Semi-Bandits
par: Kim, Jung-hun, et autres
Publié: (2025)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
par: Ito, Shinji, et autres
Publié: (2024)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
par: Kuroki, Yuko, et autres
Publié: (2023)

Thompson Sampling for Multi-Objective Linear Contextual Bandit
par: Park, Somangchan, et autres
Publié: (2025)

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
par: Chen, Botao, et autres
Publié: (2025)

Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
par: Schlisselberg, Ofir, et autres
Publié: (2025)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
par: Stradi, Francesco Emanuele, et autres
Publié: (2024)

Linear Bandits with Partially Observable Features
par: Kim, Wonyoung, et autres
Publié: (2025)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
par: Li, Mengmeng, et autres
Publié: (2025)

Peng's Q($λ$) for Conservative Value Estimation in Offline Reinforcement Learning
par: Kim, Byeongchan, et autres
Publié: (2026)

Minimax Optimal Reinforcement Learning with Quasi-Optimism
par: Lee, Harin, et autres
Publié: (2025)

Combinatorial Reinforcement Learning with Preference Feedback
par: Lee, Joongkyu, et autres
Publié: (2025)

Demystifying Linear MDPs and Novel Dynamics Aggregation Framework
par: Lee, Joongkyu, et autres
Publié: (2024)

Improved Regret of Linear Ensemble Sampling
par: Lee, Harin, et autres
Publié: (2024)

Symmetry-Aware GFlowNets
par: Kim, Hohyun, et autres
Publié: (2025)

Doubly Perturbed Task Free Continual Learning
par: Lee, Byung Hyun, et autres
Publié: (2023)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
par: Kato, Masahiro, et autres
Publié: (2024)

ADAM Optimization with Adaptive Batch Selection
par: Kim, Gyu Yeol, et autres
Publié: (2025)

Dynamic Assortment Selection and Pricing with Censored Preference Feedback
par: Kim, Jung-hun, et autres
Publié: (2025)