PulseAugur
中
实时 04:26:56
English(EN) Improved Hardness Results for Learning Intersections of Halfspaces

研究人员证明了在高斯分布下学习半空间的近乎最优的密码学硬度

作者 PulseAugur 编辑部 · [3 个来源] ·

两篇新研究论文探讨了在高斯分布下学习半空间的计算硬度。第一篇论文关注齐次半空间，在学习错误（LWE）假设下证明了近乎最优的硬度结果，并将先前的工作扩展到这种情况。第二篇论文为学习半空间交集提供了改进的硬度结果，在统计查询框架下提供了无条件的界限，并缩小了学习多个半空间的上界和下界之间的差距。 AI

影响 这些理论发现可以通过确定学习能力的基本限制，为开发更有效和更安全的机器学习算法提供信息。

排序理由 两篇在arXiv上发表的学术论文，提出了关于机器学习中计算硬度的新理论结果。

在 arXiv stat.ML 阅读 →

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

研究人员证明了在高斯分布下学习半空间的近乎最优的密码学硬度

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Research
两篇在arXiv上发表的学术论文，提出了关于机器学习中计算硬度的新理论结果。
Source corroboration
3 independent sources
Multiple independent publishers reporting the same story raises confidence that it's real and newsworthy.
Topics
paper, safety
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
155 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.
Coverage growth since scoring
+1 source(s) since last score
New sources have picked up this story since our last re-score. Score will update on the next scoring pass.

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

报道来源 [3]

  1. arXiv cs.LG TIER_1 English(EN) · Jizhou Huang, Brendan Juba ·

    高斯边际下同质半空间学习的近乎最优的密码学硬度

    arXiv:2604.26446v1 Announce Type: new Abstract: We study three problems that involve identifying homogeneous halfspaces under Gaussian distributions: agnostic learning, one-sided reliable learning, and fairness auditing. In each of these problems, we are given labeled examples $(…

  2. arXiv cs.LG TIER_1 English(EN) · Brendan Juba ·

    高斯边际下同质半空间学习的近乎最优的密码学硬度

    We study three problems that involve identifying homogeneous halfspaces under Gaussian distributions: agnostic learning, one-sided reliable learning, and fairness auditing. In each of these problems, we are given labeled examples $(\mathbf{x}, \mathrm{y})$ drawn from an unknown d…

  3. arXiv stat.ML TIER_1 English(EN) · Stefan Tiegel ·

    学习半空间交集的硬度结果改进

    arXiv:2402.15995v2 Announce Type: replace-cross Abstract: We show strong (and surprisingly simple) lower bounds for weakly learning intersections of halfspaces in the improper setting. Strikingly little is known about this problem. For instance, it is not even known if there is a…

相关话题