Sign inGet started
Paper · arXiv

Information-Induced Training Geometry: Exact Reduction, Canonical Completion, and Structured Expressivity

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 ...

AuthorsZavier Li
Primary categorycs.LG
Published11 July 2026
Last updated at source11 July 2026
cs.LGmath.OC
Embed this entry
<iframe src="https://silytics.si/embed/item/7b84dc95-b0a8-497a-857e-0912e97b065c" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.