arXiv (All)
open access
Markovian Generation Chains in Large Language Models
The widespread use of large language models (LLMs) raises an important question: how do texts evolve when they are repeatedly processed by LLMs? In this paper, we define this iterative inference process as Markovian generation chains, where each step takes a specific prompt template and the previous
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
- FLEET: From Logits Entropy to Enhanced Trajectories in Text Generation#1064201
- Back on Track: Aligning Rewards and States for Reasoning in Diffusion Large Language Models#973210
- From Position Risks to Block Survival: Faster Generation for Diffusion Language Models#1118102
- AI for Legal Domain Identification and Guidance in Sri Lankan Law#1178283
- Dynamical Gibbs-non-Gibbs transitions for finite-alphabet models on trees#609226
Record · ID 1423804
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