arXiv (All)
open access
A Measure-Theoretic Analysis of Reasoning in Transformers: Structural Generalization and Approximation Limits
Scaling laws for reasoning in large language models (LLMs) are well documented, but little theory explains their out-of-distribution (OOD) generalization. We formalize reasoning with optimal transport: each search trajectory is mapped to twelve structural coordinates, such as tree depth and backtrac
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
- DeltaTrace: Efficient Signed Attribution for Reasoning Language Models#1401069
- Transformers as In-Context Samplers: From Closed-Form Diffusion to Estimation-Free Sampling#999895
- CALM: Consistency-Aware Logit Masking in Decoding Space for Mitigating Overthinking of Large Reasoning Models#1401099
- Beyond Mode Collapse: Distribution Matching for Diverse Reasoning#232892
- Large Language Models as Statistical Decision-Makers at Inference Time#634803
Record · ID 1399867
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