Metraipolis › archive › dc_0fa4f5bf5bb0
Information-Induced Training Geometry: Exact Reduction, Canonical Completion, and Structured Expressivity — arXiv:2609.12991
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.12991
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T03:15:52.924Z
- SHA-256 of the archived text
4b80b9c5e9ca92dbdb6f6b7526f5746b242ed124941709066368a9b69c4d1cf2- Stable URL of this page
https://metraipolis.com/documento/dc_0fa4f5bf5bb0
How to cite
Information-Induced Training Geometry: Exact Reduction, Canonical Completion, and Structured Expressivity — arXiv:2609.12991 — arXiv (en), https://arxiv.org/abs/2609.12991 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0fa4f5bf5bb0 (Metraipolis archive dc_0fa4f5bf5bb0, sha256 4b80b9c5e9ca92dbdb6f6b7526f5746b242ed124941709066368a9b69c4d1cf2)
BibTeX
@misc{dc0fa4f5bf5bb0,
title = {Information-Induced Training Geometry: Exact Reduction, Canonical Completion, and Structured Expressivity — arXiv:2609.12991},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.12991},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0fa4f5bf5bb0; sha256 4b80b9c5e9ca92dbdb6f6b7526f5746b242ed124941709066368a9b69c4d1cf2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12991. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Training data constrains optimizer geometry through the covectors visible to a declared information channel. We study how such partial information determines a full positive cometric relative to a reference and which degrees of freedom remain unidentified. Our central result resolves full-column-rank positive-definite compression under affine-invariant Riemannian geometry. The compression map is a split-Hadamard metric submetry and admits an explicit unique completion that is the affine-invariant nearest full geometry realizing a visible target and yields exact full-to-visible variational reduction. When the channel moves, the completions form a gauge-invariant rank stratification of the positive-definite cone. Its closed-form pullback pair metric separates visible-metric motion from subspace rotation through a reference-mismatch weight, yields an explicit positive-semidefinite multi-direction Gram matrix, and exposes the precise singularity of reference-valued modes. The mechanism is explained by a metric theorem equating ball submetry, attained fiber distance, and lossless reduction of every monotone radial visible decision problem. A smooth split-Hadamard theorem supplies coherent information sheets, proximal commutation, and solution-wise gradient-flow lifting. The positive-definite realization also gives closed-form prior-data shrinkage. Diagonal and block optimizer families reduce to relative-interior conic image tests with valid facial certificates, while deterministic and finite-sample bounds quantify recovery of the visible geometry and its subspace. Together these results characterize exact reduction, reference-dependent completion, and structured expressivity for the stated finite-dimensional affine-invariant model. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-14 in cs.LG). Categorie arXiv: Machine Learning (cs.LG) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.12991 — 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-16T03:05:44.074Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).