Signals 4 · free daily AI digest

KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling

Paper recorded by Signals 4 on 2026-10-09 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-09 on arXiv · recorded by Signals 4 on 2026-10-12

Category: cs.LG · 机器学习 · first seen 2026-10-12

Abstract

A parallel sampler can choose at random which coordinates to generate together. For a target $p$ and the output law $q_U$ of a schedule $U$ drawn afresh for each output, we compare the schedule-averaged divergence $\mathbb{E}_U D_{\mathrm{KL}}(p\|q_U)$ with the output-law divergence $D_{\mathrm{KL}}(p\|\mathbb{E}_U q_U)$, in nats. Rounds commit independent draws from exact conditional marginals fr

Read on arXiv →

#299 most recent of 749 cs.LG papers we have recorded · ↑ newer: AI Models Can Provably Hide Arbitrary Capabilities · ↓ older: Goal-Oriented Bundle Management and Flow Control for Deep-Space Commun
Cite this page: KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling: the #299 most recent of 749 cs.LG papers we have recorded (as of 2026-10-09). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/kl-before-and-after-mixing-a-round-complexity-separation-in-parallel-sampling.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions