arXiv (All)
open access
Composable Decoding on the Probability Simplex: Theory and Implementation
Decoding for large language models is typically treated as a collection of isolated sampling strategies, with limited theoretical understanding of the behaviours they induce and how their underlying objectives relate. We formulate decoding as an optimisation problem over next-token distributions on
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
- Filtered not mixed: filtering-based online gating for mixture of large language models#248013
- Enabling Approximate Joint Sampling in Diffusion LMs#1076751
- GradSentry: Gradient Spectral Entropy for Backdoor Sample Filtering in Large Language Model Fine-Tuning#229439
- From structure to sequence: a Multinomial Processing Tree model of syntactic encoding#215921
- CAVEWOMAN: How Large Language Models Behave Under Linguistic Input and Output Compression#303234
Record · ID 1129596
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