arXiv (All)
open access
Divergence-Minimizing Distribution Matching for Parallel Channels and Channels with Memory
Theory for distribution matchers (DMs) is extended to distributions with memory. The divergence-minimizing DM is shown to select the sequences with the highest target probability, as in the memoryless case. A scaling law for divergence is extended to distributions driven by innovation processes. The
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
- A Memory-Magic Exchange Law in Streaming Clifford+T Compilation#1143895
- Random-Access Infinite Context Length for Transformers#291941
- Shinayaka Probability Theory: Elastic Distributions and Supple Randomness#102382
- Official Review · NEURIPS 2023#787072
- Randomized versus Deterministic Implementations of Concurrent Data Structures#320087
Record · ID 1129400
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