arXiv (OAI Expanded)
open access
Derandomizing Matrix Concentration Inequalities from Free Probability
Recently, sharp matrix concentration inequalities~\cite{BBvH23,BvH24} were developed using the theory of free probability. In this work, we design polynomial time deterministic algorithms to construct outcomes that satisfy the guarantees of these inequalities. As direct consequences, we obtain polyn
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
- MoMPy: automated construction of moment matrices for semidefinite programming relaxations#625097
- MoMPy: automated construction of moment matrices for semidefinite programming relaxations#622824
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#633159
- Topics in Theoretical Computer Science: Probabilistically Checkable Proofs#67037
- A new randomized CholeskyQR based on LU decomposition with partial pivoting#974173
Record · ID 1083015
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