Image de couverture de livre

Optimal and Practical Batched Linear Bandit Algorithm

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yu, Sanghoon, 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

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

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

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

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

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

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

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

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

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

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality
par: Kim, Chaiwon, et autres
Publié: (2025)

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

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

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

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)

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

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

Optimal Batched Linear Bandits
par: Ren, Xuanfei, et autres
Publié: (2024)

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

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)

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

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

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

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

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

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

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

Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation
par: Hwang, Taehyun, et autres
Publié: (2022)

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

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
par: Zhang, Raymond, et autres
Publié: (2025)

Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning
par: Kang, Hyungkyu, et autres
Publié: (2025)

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

Convergence of Muon with Newton-Schulz
par: Kim, Gyu Yeol, et autres
Publié: (2026)

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

Latent Representation Alignment for Offline Goal-Conditioned Reinforcement Learning
par: Kang, Hyungkyu, et autres
Publié: (2026)

Batched Stochastic Bandit for Nondegenerate Functions
par: Liu, Yu, et autres
Publié: (2024)

Robust Batched Bandits
par: Guo, Yunwen, et autres
Publié: (2025)

Optimal Thresholding Linear Bandit
par: Rivera, Eduardo Ochoa, et autres
Publié: (2024)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
par: Huang, Ziyi, et autres
Publié: (2024)

Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits
par: Liu, Jingyu, et autres
Publié: (2025)