Cover Image

Minimum Empirical Divergence for Sub-Gaussian Linear Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Balagopalan, Kapilan, Jun, Kwang-Sung
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification
by: Balagopalan, Kapilan, et al.
Published: (2024)

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
by: Bian, Jie, et al.
Published: (2024)

Fixed Budget is No Harder Than Fixed Confidence in Best-Arm Identification up to Logarithmic Factors
by: Balagopalan, Kapilan, et al.
Published: (2026)

Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization
by: Jun, Kwang-Sung, et al.
Published: (2024)

A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits
by: Lee, Junghyun, et al.
Published: (2024)

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
by: Qin, Hao, et al.
Published: (2023)

Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits
by: Jang, Kyoungseok, et al.
Published: (2024)

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
by: Lee, Junghyun, et al.
Published: (2023)

Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
by: Ryu, J. Jon, et al.
Published: (2025)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
by: Zhu, Yifan, et al.
Published: (2026)

Second-Order Bounds for [0,1]-Valued Regression via Betting Loss
by: Li, Yinan, et al.
Published: (2025)

Nearly Optimal Active Preference Learning and Its Application to LLM Alignment
by: Zhao, Yao, et al.
Published: (2026)

$\varepsilon$-Good Action Identification in Fixed-Budget Monte Carlo Tree Search
by: Li, Yinan, et al.
Published: (2026)

Empirical Bayesian Multi-Bandit Learning
by: Jiang, Xia, et al.
Published: (2025)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

HR-Bandit: Human-AI Collaborated Linear Recourse Bandit
by: Cao, Junyu, et al.
Published: (2024)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)

Optimal Thresholding Linear Bandit
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

Infrequent Exploration in Linear Bandits
by: Lee, Harin, et al.
Published: (2025)

Federated Linear Dueling Bandits
by: Huang, Xuhan, et al.
Published: (2025)

HAVER: Instance-Dependent Error Bounds for Maximum Mean Estimation and Applications to Q-Learning and Monte Carlo Tree Search
by: Nguyen, Tuan Ngo, et al.
Published: (2024)

Restless Bandit Problem with Rewards Generated by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2024)

An Exploration-free Method for a Linear Stochastic Bandit Driven by a Linear Gaussian Dynamical System
by: Gornet, Jonathan, et al.
Published: (2025)

Restless Linear Bandits
by: Khaleghi, Azadeh
Published: (2024)

Empirical Risk Minimization with $f$-Divergence Regularization
by: Daunas, Francisco, et al.
Published: (2026)

Linear Contextual Bandits with Interference
by: Xu, Yang, et al.
Published: (2024)

Generalized Linear Bandits with Limited Adaptivity
by: Sawarni, Ayush, et al.
Published: (2024)

Symmetric Linear Bandits with Hidden Symmetry
by: Tran, Nam Phuong, et al.
Published: (2024)

Sparse Linear Bandits with Blocking Constraints
by: Jain, Adit, et al.
Published: (2024)

Pure Exploration in Bandits with Linear Constraints
by: Carlsson, Emil, et al.
Published: (2023)

Directional Optimism for Safe Linear Bandits
by: Hutchinson, Spencer, et al.
Published: (2023)

Linear Bandits with Partially Observable Features
by: Kim, Wonyoung, et al.
Published: (2025)

Contextual Linear Bandits with Delay as Payoff
by: Zhang, Mengxiao, et al.
Published: (2025)

Self-Concordant Perturbations for Linear Bandits
by: Lévy, Lucas, et al.
Published: (2025)

Robust Causal Bandits for Linear Models
by: Yan, Zirui, et al.
Published: (2023)

Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport
by: Croissant, Lorenzo
Published: (2025)

Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
by: Kang, Yue, et al.
Published: (2025)

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
by: Qin, Hao, et al.
Published: (2025)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness
by: Manupriya, Piyushi, et al.
Published: (2025)