PulseAugur
中
实时 20:13:40
English(EN) KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling

新研究区分了并行采样算法中的KL散度标准

本文探讨了并行采样算法的理论复杂度,特别是比较了评估采样调度的两个标准:调度平均KL散度和输出律KL散度。研究引入了轮次复杂度分离,证明在某些条件下,输出律散度可以显著低于调度平均散度。对包括二元字符串上的均匀分布和Beta(1,1)-伯努利分布在内的各种目标分析了这种分离,结果表明可以通过稀有的长运行来实现特定的轮次计数。 AI

排序理由 该条目是发表在arXiv上的学术论文。[lever_c_demoted from research: ic=1 ai=0.1]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新研究区分了并行采样算法中的KL散度标准

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
该条目是发表在arXiv上的学术论文。[lever_c_demoted from research: ic=1 ai=0.1]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
Low
Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
Story freshness
35 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.LG TIER_1 English(EN) · Tianyi Wu ·

    KL 混合前后:并行采样中的轮复杂度分离

    arXiv:2610.13924v1 Announce Type: new 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_{\…