arXiv (All)
open access
Exact semantic readout from compressed vector representations
We characterize when compressed vector representations admit exact linear or affine readouts of a finite lexicon's truth conditions: one fixed map per predicate, sending each entity vector to the corresponding truth vector. A necessary and sufficient row-space condition determines existence; the aug
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Relational Compression: A Framework for Relational Fidelity in Constrained Representations#1115772
- LatentPress: Context Compression Beyond Text and Vision#926239
- The Sources of Unknowability and Self-refutation in Epistemic and Dynamic Epistemic Logic#1035724
- Constraint-Governed Compression: What Should Determine the Resolution of a Finite Representation#692479
- The Attribution-Compression Frontier in Retrieval-Augmented Generation#1083702
Record · ID 1011754
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive