English(EN) Learning CNF Formulas from Uniform Random Solutions: Near-Tight Sample Complexity for Valiant's Algorithm

研究重新审视用于CNF公式学习的Valiant算法

作者 PulseAugur 编辑部 · [1 个来源] · 2026-09-15 04:00

一篇新的研究论文重新审视了用于学习CNF公式的Valiant算法，重点关注其在局部引理模型下的样本复杂度。该研究为算法在子句大小大于或等于某个阈值时的性能建立了匹配的下界。对于一个特定情况，该论文通过信息论下界证明了Valiant算法实现了最优的样本复杂度（对数因子以内）。 AI

排序理由该条目是一篇发表在arXiv上的研究论文，详细介绍了理论计算机科学概念。[lever_c_demoted from research: ic=1 ai=0.4]

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

本文如何被排名

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.4]
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: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: 15 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

arXiv cs.LG TIER_1 English(EN) · Weiming Feng, Yixiao Yu, Yiyao Zhang · 2026-09-15 04:00

从均匀随机解中学习CNF公式：Valiant算法的近乎紧密的样本复杂度

arXiv:2609.15268v1 Announce Type: new Abstract: We revisit Valiant's algorithm (Commun. ACM'84) for learning $n$-variable CNF formulas with clause size $k$ and variable degree $d$ from i.i.d. uniform random solutions in the local lemma regime. For fixed $t\geq1$, under $k\gtrsim(…