arXiv (All)
open access
Subgaussian Vector Balancing by an Ising Model
We show that the guaranties of the Gram-Schmidt Walk Algorithm of Bansal, Dadush, Garg, and Lovett can be achieved by an Ising model. Given vectors $v_1, \ldots, v_n$ of norm less than 1, we give a closed form for a centrally symmetric distribution on a vector $σ\in \{\pm 1 \}^n$ so that the signed
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
- Level sets and maximum likelihood estimation for the Ising model#1187277
- Berry-Esseen bounds for step-reinforced random walks#670328
- Berry-Esseen bounds for step-reinforced random walks#668263
- Variance Bounds for Minimum Perfect Matching Problem by Random Walk on Multinomial Distribution#1324938
- Randomized subspace correction methods for convex optimization#173322
Record · ID 1344139
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