arXiv (All)
open access
Sharpness and Rigidity of the Two-Factor Recht-Re Lower Bound
Products of positive semidefinite matrices arise when successive steps of a randomized optimization method use different data points. Their average can have a negative eigenvalue even though every individual matrix is positive semidefinite. Lai and Lim proved at ICML 2020 that $\sum_{i\ne j}A_iA_j\s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Weakly chained matrices, policy iteration, and impulse control#984767
- Affine isoperimetric inequalities for the first eigenvalue of the $m$th order Affine $p$-Laplace Operator#1105944
- Intrinsic dimension concentration inequalities for self-adjoint operators#1105952
- Stochastic Domination of Gaussian Maxima: A Resolution of the Weak Simplex Conjecture#662454
- Stochastic Domination of Gaussian Maxima: A Resolution of the Weak Simplex Conjecture#661404
Record · ID 1154778
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive