arXiv (All)
open access
Sample complexity bounds for categorical Markov random fields via Discrete Diffusions
Many applications in statistics, economics, and physics require sampling from high-dimensional categorical distributions with local dependence structures. Examples include finite memory language models, Ising and Potts systems in statistical physics and protein folding, etc. In modern machine learni
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
- Sample complexity bounds for categorical Markov random fields via Discrete Diffusions#1161032
- Higher-Order Fluctuations of the Log-Partition Function for Ising Models on Inhomogeneous Random Graphs#1156570
- A variational approach to dimension-free self-normalized concentration#1061620
- Tightness Analysis of First Passage Times of $d$-Dimensional Branching Random Walk#128311
- Second-order perturbation bounds for Gibbs samplers under strong spatial mixing#1071279
Record · ID 1157476
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