English(EN) Fitting and Learning Basis-Restricted Propositional Formulas

新研究分析布尔函数公式的学习复杂度

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

研究人员分析了使用特定布尔函数集构建的命题公式的拟合和学习复杂度。该研究确定了各种问题的难度，包括找到一个与给定标记样本匹配的公式、识别一个更小的公式以及最小化不可实现样本上的错误分类。这些发现适用于公式的树和电路表示，并考虑了其他命题片段的相关问题。 AI

影响为理解布尔函数的学习和拟合复杂度提供了理论基础，这与基础人工智能研究相关。

排序理由学术论文发表在arXiv上，详细介绍了理论计算机科学研究。[lever_c_demoted from research: ic=1 ai=1.0]

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

本文如何被排名

Signal score: 12 / 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=1.0]
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: High; Clearly on-topic for AI-industry coverage.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

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

arXiv cs.LG TIER_1 English(EN) · Balder ten Cate · 2026-09-10 04:00

Fitting and Learning Basis-Restricted Propositional Formulas

arXiv:2609.08961v1 Announce Type: cross Abstract: For a finite set $O$ of Boolean functions, we consider the class of propositional formulas built using the functions in $O$ as connectives. We determine, for each possible choice of $O$, the complexity of various fitting and learn…