Cover Image

Non-Stationary Lipschitz Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nguyen, Nicolas, Gaucher, Solenne, Vernade, Claire
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

Demographic parity in regression and classification within the unawareness framework
by: Divol, Vincent, et al.
Published: (2024)

Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Bandits
by: Nguyen, Nicolas, et al.
Published: (2024)

Variational Bayes Portfolio Construction
by: Nguyen, Nicolas, et al.
Published: (2024)

Put CASH on Bandits: A Max K-Armed Problem for Automated Machine Learning
by: Balef, Amir Rezaei, et al.
Published: (2025)

Tight Sample Complexity Bounds for Entropic Best Policy Identification
by: Essakine, Amer, et al.
Published: (2026)

Improved Algorithms for Contextual Dynamic Pricing
by: Tullii, Matilde, et al.
Published: (2024)

Multi-Agent Lipschitz Bandits
by: Chakraborty, Sourav, et al.
Published: (2026)

Incentivized Lipschitz Bandits
by: Chakraborty, Sourav, et al.
Published: (2025)

Partially Observable Reinforcement Learning with Memory Traces
by: Eberhard, Onno, et al.
Published: (2025)

Commit to the Bit: Reactive Reinforcement Learning Done Right
by: Eberhard, Onno, et al.
Published: (2026)

Adaptive Smooth Non-Stationary Bandits
by: Suk, Joe
Published: (2024)

Non-Stationary Bandit Learning via Predictive Sampling
by: Liu, Yueyang, et al.
Published: (2022)

Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
by: Iwazaki, Shogo, et al.
Published: (2024)

Smooth Non-Stationary Bandits
by: Jia, Su, et al.
Published: (2023)

Incentivized Exploration of Non-Stationary Stochastic Bandits
by: Chakraborty, Sourav, et al.
Published: (2024)

Non-Stationary Latent Auto-Regressive Bandits
by: Trella, Anna L., et al.
Published: (2024)

A Pontryagin Perspective on Reinforcement Learning
by: Eberhard, Onno, et al.
Published: (2024)

Quantum Lipschitz Bandits
by: Yi, Bongsoo, et al.
Published: (2025)

Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee
by: Hung, Yu-Heng, et al.
Published: (2025)

Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits
by: Li, Shaoang, et al.
Published: (2025)

On The Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
by: Maynard-Zhang, Leo, et al.
Published: (2026)

Partition Tree Weighting for Non-Stationary Stochastic Bandits
by: Veness, Joel, et al.
Published: (2025)

Split the Differences, Pool the Rest: Provably Efficient Multi-Objective Imitation
by: Sheebaelhamd, Ziyad, et al.
Published: (2026)

Online Decision Deferral under Budget Constraints
by: Reid, Mirabel, et al.
Published: (2024)

Fooling Algorithms in Non-Stationary Bandits using Belief Inertia
by: Mendelson, Gal, et al.
Published: (2025)

A Practical Algorithm for Feature-Rich, Non-Stationary Bandit Problems
by: Loh, Wei Min, et al.
Published: (2026)

Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits
by: Werge, Nicklas, et al.
Published: (2023)

Non-Stationary Dueling Bandits Under a Weighted Borda Criterion
by: Suk, Joe, et al.
Published: (2024)

Quantization-Free Autoregressive Action Transformer
by: Sheebaelhamd, Ziyad, et al.
Published: (2025)

Online Learning of Whittle Indices for Restless Bandits with Non-Stationary Transition Kernels
by: Shisher, Md Kamran Chowdhury, et al.
Published: (2025)

Lipschitz Bandits with Stochastic Delayed Feedback
by: Liu, Zhongxuan, et al.
Published: (2025)

Adaptive Requesting in Decentralized Edge Networks via Non-Stationary Bandits
by: Zhuang, Yi, et al.
Published: (2026)

DAL: A Practical Prior-Free Black-Box Framework for Non-Stationary Bandits
by: Gerogiannis, Argyrios, et al.
Published: (2025)

Clustered KL-barycenter design for policy evaluation
by: Weissmann, Simon, et al.
Published: (2025)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2025)

Contextual Bandits with Non-Stationary Correlated Rewards for User Association in MmWave Vehicular Networks
by: He, Xiaoyang, et al.
Published: (2024)

Efficient Risk-sensitive Planning via Entropic Risk Measures
by: Marthe, Alexandre, et al.
Published: (2025)

Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance
by: Iwazaki, Shogo, et al.
Published: (2025)

Inverse Contextual Bandits without Rewards: Learning from a Non-Stationary Learner via Suffix Imitation
by: Kong, Yuqi, et al.
Published: (2026)

A Modularized Framework for Piecewise-Stationary Restless Bandits
by: Li, Kuan-Ta, et al.
Published: (2026)