English(EN) On the Computational Complexity of Structural Generalization

新论文定义结构泛化，质疑Transformer能力

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

一篇新论文定义了结构泛化，这是一个之前通过基准测试衡量但缺乏正式定义的概念。研究认为，纯粹的Transformer模型由于其可学习类别仅限于TC^0，且结构泛化的计算复杂性为NC^1完全，因此无法实现结构泛化。论文提出，神经符号系统表现更好，因为它们融入了泛化的语义层面，而纯粹的Transformer模型在这方面存在困难，并且当前的基准测试无法区分学习到的泛化和提供的泛化。 AI

影响这项研究对纯粹Transformer模型实现结构泛化的能力提出了挑战，表明需要采用神经符号方法。

排序理由该集群包含一篇学术论文，详细介绍了AI模型中结构泛化计算复杂性的理论研究。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.CL 阅读 →

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; 该集群包含一篇学术论文，详细介绍了AI模型中结构泛化计算复杂性的理论研究。[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, model release; 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: 87 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

报道来源 [1]

arXiv cs.CL TIER_1 English(EN) · Zichao Wei · 2026-07-23 04:00

结构泛化的计算复杂度

arXiv:2607.19573v1 Announce Type: new Abstract: Structural generalization has been measured repeatedly by several benchmarks, yet it has never been formally defined. We give a definition that translates the two premises (compositional structure and unbounded generalization) into …

本文如何被排名

报道来源 [1]

结构泛化的计算复杂度

相关实体

相关话题