GL-LowPopArt: A Nearly Instance-Wise Minimax-Optimal Estimator for Generalized Low-Rank Trace Regression
Not on the map. Why?
Abstract (arXiv)
We present `GL-LowPopArt`, a novel Catoni-style estimator for generalized low-rank trace regression. Building on `LowPopArt` (Jang et al., 2024), it employs a two-stage approach: nuclear norm regularization followed by matrix Catoni estimation. We establish state-of-the-art estimation error bounds, surpassing existing guarantees (Fan et al., 2019; Kang et al., 2022), and reveal a novel experimental design objective, GL(π). The key technical challenge is controlling bias from the nonlinear inverse link function, which we address with our two-stage approach. We prove a *local minimax lower bound*, showing that our `GL-LowPopArt` enjoys instance-wise optimality up to the condition number of the ground-truth Hessian. Our method immediately achieves an improved Frobenius error guarantee for generalized linear matrix completion. We also introduce a new problem setting called **bilinear dueling bandits**, a contextualized version of dueling bandits with a general preference model. Using an explore-then-commit approach with `GL-LowPopArt', we show an improved Borda regret bound over na"ive vectorization (Wu et al., 2024).
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Jun 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2026Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferencescited by 5
- 2025Too Easily Fooled? Prompt Injection Breaks LLMs on Frustratingly Simple Multiple-Choice Questionscited by 4
- 2025Online Minimization of Polarization and Disagreement via Low-Rank Matrix Banditscited by 1
- 2026A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptionscited by 1
- 2026Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences26 Feb 2026
- 2026A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions11 Feb 2026
- 2025Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits1 Oct 2025
- 2025Too Easily Fooled? Prompt Injection Breaks LLMs on Frustratingly Simple Multiple-Choice Questions16 Aug 2025