Metraipolis › archive › dc_3d73bf29f754

Testing Algebraic Complete Intersections — arXiv:2610.12288

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.12288
License (as archived)
CC0-1.0
Archived
2026-10-09T06:27:36.315Z
SHA-256 of the archived text
0d2f08b71cd13e5363c6082b55e3bd1a46e7c3059d4b32d67c998ad092e73b19
Stable URL of this page
https://metraipolis.com/documento/dc_3d73bf29f754

How to cite

Testing Algebraic Complete Intersections — arXiv:2610.12288 — arXiv (en), https://arxiv.org/abs/2610.12288 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d73bf29f754 (Metraipolis archive dc_3d73bf29f754, sha256 0d2f08b71cd13e5363c6082b55e3bd1a46e7c3059d4b32d67c998ad092e73b19)
BibTeX
@misc{dc3d73bf29f754,
  title = {Testing Algebraic Complete Intersections — arXiv:2610.12288},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.12288},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d73bf29f754; sha256 0d2f08b71cd13e5363c6082b55e3bd1a46e7c3059d4b32d67c998ad092e73b19},
  year = {2026}
}

Archived text

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

Given independent and identically distributed samples samples from a probability distribution in a potentially high-dimensional real space, we study the problem of testing whether the distribution is concentrated near a real algebraic complete intersection of prescribed dimension, bounded degree, and bounded condition number. We design an explicit and effective learning procedure which either certifies the nonexistence of such a manifold, up to a controlled relaxation of the approximation threshold, or returns a candidate regression manifold with controlled geometric complexity. Equivalently, the procedure tests the manifold hypothesis within this hypothesis class. The proposed procedure relies on quantitative geometric estimates for regular polynomial systems, which lead to a tractable auxiliary optimization problem. We then develop a data-driven algorithm to solve this auxiliary optimization problem, establishing explicit bounds on its sample and arithmetic complexity.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (stat.ML) ; Algebraic Geometry (math.AG); Differential Geometry (math.DG); Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2610.12288 — 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-10-09T05:51:31.506Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).