A Jointly Efficient and Near-Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions

arXiv:2602.10971 · cs.LG, stat.ML · Submitted 2026-02-11 · Read on arXiv

cs.LG, stat.ML

Submitted: 2026-02-11

Updated: 2026-10-20

Terminology

• Corruption Robustness — 1× in this paper · explained in 2 episodes
• Minimax Optimality — 1× in this paper · explained in 3 episodes
• Regret — 1× in this paper · explained in 4 episodes
• Robustness — 1× in this paper · explained in 5 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks