arxiv
PublishedJuly 16, 2026 at 4:00 AM
—neutral
Bandit PCA with Minimax Optimal Regret
Publisher summary· verbatim
arXiv:2607.10936v2 Announce Type: replace Abstract: We study the bandit-feedback version of online principal component analysis (Bandit PCA): in each round $t = 1,\dots,T$, the adversary selects a $d \times d$ symmetric gain matrix $G_t$ with spectrum in $[0,1]$ and rank at most $r$; the learner sim
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivAdaptive Mamba Neural Operators1harxivThe Many Senses of Visual Similarity: A Text-Prompted Image Perceptual Metric1harxivHierarchical Reinforcement Learning for Air Combat at DARPA's AlphaDogfight Trials1harxivmHC-GNN: Manifold-Constrained Hyper-Connections for Graph Neural Networks1hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗