Metraipolis › archive › dc_aa47aaa257f0

State Evolution and Universality of Iterated Linear Programs for the Binary Perceptron — arXiv:2611.04294

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04294
License (as archived)
CC0-1.0
Archived
2026-11-04T21:56:25.259Z
SHA-256 of the archived text
b45e9f2633c001c44d304fc8e29dc087de34098b37286a5ceb9f8426d8e7d5a7
Stable URL of this page
https://metraipolis.com/documento/dc_aa47aaa257f0

How to cite

State Evolution and Universality of Iterated Linear Programs for the Binary Perceptron — arXiv:2611.04294 — arXiv (en), https://arxiv.org/abs/2611.04294 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa47aaa257f0 (Metraipolis archive dc_aa47aaa257f0, sha256 b45e9f2633c001c44d304fc8e29dc087de34098b37286a5ceb9f8426d8e7d5a7)
BibTeX
@misc{dcaa47aaa257f0,
  title = {State Evolution and Universality of Iterated Linear Programs for the Binary Perceptron — arXiv:2611.04294},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04294},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa47aaa257f0; sha256 b45e9f2633c001c44d304fc8e29dc087de34098b37286a5ceb9f8426d8e7d5a7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04294. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The binary perceptron is a random constraint satisfaction problem that asks for a sign vector satisfying a system of random linear inequalities. Its solution space has a strikingly extreme geometry: at every positive constraint density, all but a vanishing fraction of the solutions are isolated. Yet polynomial-time algorithms find solutions at small enough constraint density, which raises the question of how efficient algorithms navigate such a landscape. Linear programming is a natural algorithm to study here, but its analysis has so far been limited to a single round. Li, Schramm, and Zhou (STOC 2025) analyzed one linear program followed by iterative rounding. In this work, we overcome this limitation and give a precise analysis of iterated linear programming for the binary perceptron. (1) For Gaussian matrices and any fixed number of rounds, we characterize the iterated linear programs exactly through a deterministic state-evolution recursion. (2) Adding a final rounding step, we obtain a randomized polynomial-time algorithm for the binary perceptron. Numerical evaluations of the recursion provide evidence that it succeeds at constraint density $\alpha=0.60$ with zero margin, well beyond the range $\alpha\le0.1$ guaranteed by the single-LP analysis and $\alpha\approx0.327$ (Jo and Lee, 2026), the best guarantee so far. (3) We establish universality, showing that the same characterization holds for matrices with i.i.d. entries drawn from any centered, unit-variance subgaussian law. The key idea of our proof is that, although conditioning on earlier rounds makes the matrix non-Gaussian, its conditional law can be computed explicitly and remains close to a Gaussian law, so the convex Gaussian min-max theorem applies in every round. For universality, we compare Gaussian and subgaussian matrices through the Lindeberg principle, using a regularized version of each linear program.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.04294 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T21:41:04.551Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).