Bandit PCA with Minimax Optimal Regret

arXiv:2607.10936 · cs.LG, stat.ML · Submitted 2026-07-12 · Read on arXiv

Moïse Blanchard, Dmitrii Ostrovskii, Aadirupa Saha

cs.LG, stat.ML

Submitted: 2026-07-12

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regret — 85× in this paper · explained in 4 episodes
• Regret Bound — 17× in this paper · explained in 2 episodes
• Trace — 8× in this paper · explained in 2 episodes
• Verification — 6× in this paper · explained in 2 episodes
• Regret Bounds — 5× in this paper · explained in 2 episodes
• Augmentation — 4× in this paper · explained in 2 episodes
• Minimax Regret — 4× in this paper · explained in 4 episodes
• Online Mirror Descent — 4× in this paper
• Accuracy — 2× in this paper · explained in 1 episode
• Generalization — 2× in this paper · explained in 14 episodes
• Parameterization — 2× in this paper · explained in 2 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Nuclear Norm — 1× in this paper · explained in 2 episodes
• Query Complexity — 1× in this paper · explained in 2 episodes
• Sparsity — 1× in this paper · explained in 5 episodes
• Structural Properties — 1× in this paper · explained in 2 episodes
• Variance Reduction — 1× in this paper · explained in 2 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