Metraipolis › archive › dc_09750ac61d64
Isotropic Yet Undecodable: The Sequential Content-Sufficiency Gap in Latent-Predictive Text Representations — arXiv:2610.07906
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07906
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:19:16.043Z
- SHA-256 of the archived text
6dd84e9d4eb827b35366e13d50b73eea27a94c02769538778568e4abf5a718c6- Stable URL of this page
https://metraipolis.com/documento/dc_09750ac61d64
How to cite
Isotropic Yet Undecodable: The Sequential Content-Sufficiency Gap in Latent-Predictive Text Representations — arXiv:2610.07906 — arXiv (en), https://arxiv.org/abs/2610.07906 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_09750ac61d64 (Metraipolis archive dc_09750ac61d64, sha256 6dd84e9d4eb827b35366e13d50b73eea27a94c02769538778568e4abf5a718c6)
BibTeX
@misc{dc09750ac61d64,
title = {Isotropic Yet Undecodable: The Sequential Content-Sufficiency Gap in Latent-Predictive Text Representations — arXiv:2610.07906},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07906},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_09750ac61d64; sha256 6dd84e9d4eb827b35366e13d50b73eea27a94c02769538778568e4abf5a718c6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07906. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study sequential content sufficiency by investigating whether a representation retains the ordered target information available in its input. An information-theoretic decomposition separates input ambiguity, representation loss, and readout mismatch. We construct recoverable views where perfect agreement and joint isotropic Gaussianity coexist with zero target information, and establish limits imposed by deterministic canonical anchors. Token log-loss provides a one-sided information-loss bound; a fixed-penalty ridge analysis shows why rank alone cannot determine prediction risk. These results motivate CANOPE, a nonautoregressive framework with ordered latent canvases, canonical-token supervision, and geometric regularization. On 40,000 validation sequences, latent-agreement (PL0) and token-grounded (PL2) have nearly identical pooled ranks but reach 13.5% and 98.8% positional Recall@1, respectively, under strong natural corruption when the correct target length is provided. On 3,930 LJSpeech validation utterances, frozen PL2 with a trained MatchaTTS readout yields 21.54% word error rate (WER) on corrupted text, versus 99.22% for frozen PL0, while end-to-end MatchaTTS reaches 10.93%. These results show that geometric regularity alone does not guarantee recoverable sequential content or effective downstream access in the text settings studied here. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Artificial Intelligence (cs.AI) ; Computation and Language (cs.CL); Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.07906 — 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-07T11:15:24.567Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).