Cover Image

On the optimal regret of collaborative personalized linear bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huang, Bruce, Zhou, Ruida, Yang, Lin F., Diggavi, Suhas
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

ADEPT: Hierarchical Bayes Approach to Personalized Federated Unsupervised Learning
by: Ozkara, Kaan, et al.
Published: (2024)

SPIRE: Conditional Personalization for Federated Diffusion Generative Models
by: Ozkara, Kaan, et al.
Published: (2025)

An Information-Theoretic Approach to Understanding Transformers' In-Context Learning of Variable-Order Markov Chains
by: Zhou, Ruida, et al.
Published: (2024)

Reframing Data Value for Large Language Models Through the Lens of Plausibility
by: Rammal, Mohamad Rida, et al.
Published: (2024)

Linear bandits with polylogarithmic minimax regret
by: Lumbreras, Josep, et al.
Published: (2024)

Adversarial bandit optimization for approximately linear functions
by: Cheng, Zhuoyu, et al.
Published: (2025)

UCB algorithms for multi-armed bandits: Precise regret and adaptive inference
by: Han, Qiyang, et al.
Published: (2024)

Robust Federated Personalised Mean Estimation for the Gaussian Mixture Model
by: Managoli, Malhar A., et al.
Published: (2025)

ICQuant: Index Coding enables Low-bit LLM Quantization
by: Li, Xinlin, et al.
Published: (2025)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
by: Mortazavi, Ali, et al.
Published: (2024)

Risk and optimal policies in bandit experiments
by: Adusumilli, Karun
Published: (2021)

When and why randomised exploration works (in linear bandits)
by: Abeille, Marc, et al.
Published: (2025)

Ensemble sampling for linear bandits: small ensembles suffice
by: Janz, David, et al.
Published: (2023)

Asymptotically optimal regret in communicating Markov decision processes
by: Boone, Victor
Published: (2025)

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

Variance-sensitive Thompson sampling for generalised linear bandits, revisited
by: Perneczky, Tom, et al.
Published: (2026)

FairSTG: Countering performance heterogeneity via collaborative sample-level optimization
by: Lin, Gengyu, et al.
Published: (2024)

Extreme bandits
by: Carpentier, Alexandra, et al.
Published: (2026)

One Jump Is All You Need: Short-Cutting Transformers for Early Exit Prediction with One Jump to Fit All Exit Levels
by: Seshadri, Amrit Diggavi
Published: (2025)

Minimax-optimal trust-aware multi-armed bandits
by: Cai, Changxiao, et al.
Published: (2024)

Truthful mechanisms for linear bandit games with private contexts
by: Hu, Yiting, et al.
Published: (2025)

CafeQ: Calibration-free Quantization via Learned Transformations and Adaptive Rounding
by: Sun, Ziteng, et al.
Published: (2025)

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

Precision autotuning for linear solvers via contextual bandit-based RL
by: Carson, Erin, et al.
Published: (2026)

Spectral bandits
by: Kocák, Tomáš, et al.
Published: (2026)

MEL: Multi-level Ensemble Learning for Resource-Constrained Environments
by: Gudipaty, Krishna Praneet, et al.
Published: (2025)

Correlational Lagrangian Schrödinger Bridge: Learning Dynamics with Population-Level Regularization
by: You, Yuning, et al.
Published: (2024)

Automated scientific minimization of regret
by: Binz, Marcel, et al.
Published: (2025)

Active clustering with bandit feedback
by: Thuot, Victor, et al.
Published: (2024)

Practical Efficient Global Optimization is No-regret
by: Wang, Jingyi, et al.
Published: (2026)

Instance-dependent Stochastic Lipschitz bandit
by: Potfer, Marius, et al.
Published: (2026)

Spectral bandits for smooth graph functions
by: Valko, Michal, et al.
Published: (2026)

Approximate information maximization for bandit games
by: Barbier-Chebbah, Alex, et al.
Published: (2023)

Online learning in bandits with predicted context
by: Guo, Yongyi, et al.
Published: (2023)

Use Your INSTINCT: INSTruction optimization for LLMs usIng Neural bandits Coupled with Transformers
by: Lin, Xiaoqiang, et al.
Published: (2023)

From Function to Distribution Modeling: A PAC-Generative Approach to Offline Optimization
by: Zhang, Qiang, et al.
Published: (2024)

Offline-to-online hyperparameter transfer for stochastic bandits
by: Sharma, Dravyansh, et al.
Published: (2025)

Revealing graph bandits for maximizing local influence
by: Carpentier, Alexandra, et al.
Published: (2026)

The regret lower bound for communicating Markov Decision Processes
by: Boone, Victor, et al.
Published: (2025)

A second order regret bound for NormalHedge
by: Freund, Yoav, et al.
Published: (2026)