Cover Image

Linear Bandits with Non-i.i.d. Noise

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abélès, Baptiste, Clerico, Eugenio, Flynn, Hamish, Neu, Gergely
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

Online-to-PAC generalization bounds under graph-mixing dependencies
by: Abélès, Baptiste, et al.
Published: (2024)

Generalization bounds for mixing processes via delayed online-to-PAC conversions
by: Abeles, Baptiste, et al.
Published: (2024)

Confidence Sequences for Generalized Linear Models via Regret Analysis
by: Clerico, Eugenio, et al.
Published: (2025)

Sparse Optimistic Information Directed Sampling
by: Schwartz, Ludovic, et al.
Published: (2025)

ISFL: Federated Learning for Non-i.i.d. Data with Local Importance Sampling
by: Zhu, Zheqi, et al.
Published: (2022)

Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures
by: Flynn, Hamish, et al.
Published: (2023)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

Tight Bounds on the Binomial CDF, and the Minimum of i.i.d Binomials, in terms of KL-Divergence
by: Zhu, Xiaohan, et al.
Published: (2025)

FedSiKD: Clients Similarity and Knowledge Distillation: Addressing Non-i.i.d. and Constraints in Federated Learning
by: Alsenani, Yousef, et al.
Published: (2024)

Interpretable, multi-dimensional Evaluation Framework for Causal Discovery from observational i.i.d. Data
by: Velev, Georg, et al.
Published: (2024)

Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)

Multi-Worker Selection based Distributed Swarm Learning for Edge IoT with Non-i.i.d. Data
by: Yao, Zhuoyu, et al.
Published: (2025)

FedSC: Provable Federated Self-supervised Learning with Spectral Contrastive Objective over Non-i.i.d. Data
by: Jing, Shusen, et al.
Published: (2024)

Relative Information Gain and Gaussian Process Regression
by: Flynn, Hamish
Published: (2025)

Tighter Confidence Bounds for Sequential Kernel Regression
by: Flynn, Hamish, et al.
Published: (2024)

Adaptive time series forecasting with markovian variance switching
by: Abélès, Baptiste, et al.
Published: (2024)

Online combinatorial optimization with stochastic decision sets and adversarial losses
by: Neu, Gergely, et al.
Published: (2026)

Offline RL via Feature-Occupancy Gradient Ascent
by: Neu, Gergely, et al.
Published: (2024)

Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
by: Lugosi, Gábor, et al.
Published: (2023)

Uniform mean estimation for monotonic processes
by: Clerico, Eugenio, et al.
Published: (2025)

Dealing with unbounded gradients in stochastic saddle-point optimization
by: Neu, Gergely, et al.
Published: (2024)

Inverse Q-Learning Done Right: Offline Imitation Learning in $Q^π$-Realizable MDPs
by: Moulin, Antoine, et al.
Published: (2025)

Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning
by: Moulin, Antoine, et al.
Published: (2025)

Online learning with Erdős-Rényi side-observation graphs
by: Kocák, Tomáš, et al.
Published: (2026)

Online learning with noisy side observations
by: Kocák, Tomáš, et al.
Published: (2026)

Optimistic Information Directed Sampling
by: Neu, Gergely, et al.
Published: (2024)

The eigenvalues of i.i.d. matrices are hyperuniform
by: Cipolloni, Giorgio, et al.
Published: (2026)

Maximum of the characteristic polynomial of i.i.d. matrices
by: Giorgio Cipolloni, et al.
Published: (2025)

Towards Noise-Resilient Quantum Multi-Armed and Stochastic Linear Bandits
by: Chen, Zhuoyue, et al.
Published: (2026)

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

Gaussian Multiplicative Chaos for i.i.d. matrices
by: Cipolloni, Giorgio, et al.
Published: (2026)

Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces
by: Flynn, Hamish, et al.
Published: (2026)

Quantum Non-Linear Bandit Optimization
by: Siam, Zakaria Shams, et al.
Published: (2025)

Efficient learning by implicit exploration in bandit problems with side observations
by: Kocak, Tomas, et al.
Published: (2026)

How good is PAC-Bayes at explaining generalisation?
by: Picard-Weibel, Antoine, et al.
Published: (2025)

New approaches to almost i.i.d. information theory
by: Girardi, Filippo, et al.
Published: (2026)

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

Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
by: Hwang, Taehyun, et al.
Published: (2026)

Generalisation under gradient descent via deterministic PAC-Bayes
by: Clerico, Eugenio, et al.
Published: (2022)

Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise
by: Tani, Naoto, et al.
Published: (2026)