Cover Image

Self-Concordant Perturbations for Linear Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lévy, Lucas, Valeau, Jean-Lou, Akhavan, Arya, Rebeschini, Patrick
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-stationary Bandit Convex Optimization: A Comprehensive Study
by: Liu, Xiaoqi, et al.
Published: (2025)

Sharp Risk Bounds for Early-Stopping in Gaussian Linear Regression
by: Wegel, Tobias, et al.
Published: (2025)

Robust Gradient Descent for Phase Retrieval
by: Buna, Alex, et al.
Published: (2024)

A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence
by: Alfano, Carlo, et al.
Published: (2023)

Gradient-free stochastic optimization for additive models
by: Akhavan, Arya, et al.
Published: (2025)

A Perturbation Approach to Unconstrained Linear Bandits
by: Jacobsen, Andrew, et al.
Published: (2026)

Sharp analysis of linear ensemble sampling
by: Akhavan, Arya, et al.
Published: (2026)

Best-of-Both Worlds for linear contextual bandits with paid observations
by: Boyer, Nathan, et al.
Published: (2025)

Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
by: Cheng, Zhuoyu, et al.
Published: (2026)

High-probability zeroth-order online convex optimisation beyond Euclidean geometry
by: Janz, David, et al.
Published: (2025)

Differentiable Cost-Parameterized Monge Map Estimators
by: Howard, Samuel, et al.
Published: (2024)

Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity
by: Johnson, Emmeran, et al.
Published: (2023)

Stochastic Shortest Path with Sparse Adversarial Costs
by: Johnson, Emmeran, et al.
Published: (2025)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
by: Lee, Jongyeong, et al.
Published: (2025)

Implicit Regularisation in Diffusion Models: An Algorithm-Dependent Generalisation Analysis
by: Farghly, Tyler, et al.
Published: (2025)

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

A conversion theorem and minimax optimality for continuum contextual bandits
by: Akhavan, Arya, et al.
Published: (2024)

On the necessity of adaptive regularisation:Optimal anytime online learning on $\boldsymbol{\ell_p}$-balls
by: Johnson, Emmeran, et al.
Published: (2025)

Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, 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)

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

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

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

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)

Learning mirror maps in policy mirror descent
by: Alfano, Carlo, et al.
Published: (2024)

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

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
by: Chen, Botao, et al.
Published: (2025)

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

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)

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)

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)

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

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)

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality
by: Kim, Chaiwon, et al.
Published: (2025)