English(EN) Graph Machine: Towards Better Pretraining via Edges

Graph Machine 架构用稀疏路由取代 Transformer 层

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

研究人员开发了一种名为 Graph Machine (GM) 的新架构，该架构利用稀疏动态路由和可微分指针追逐来实现线性状态复杂度。这种设计允许用最少的性能损失有效地替换密集 Transformer 层。在实验中，用 GM 稀疏层替换 Qwen3-0.6B 模型中 75% 的密集层，并在 157 亿个 token 上进行预训练，仅导致验证损失略有下降，在某些情况下甚至略有改善。 AI

影响引入了一种可能通过降低计算复杂度来提高 LLM 效率的新颖架构。

排序理由详细介绍新模型架构的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 Hugging Face Daily Papers 阅读 →

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; 详细介绍新模型架构的学术论文。[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: 8 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

报道来源 [1]

Hugging Face Daily Papers TIER_1 English(EN) · 2026-09-02 00:00

Graph Machine：通过边实现更好的预训练

A Graph Machine architecture uses sparse dynamic routing and differentiable pointer chasing to maintain linear state complexity, enabling efficient replacement of dense Transformer layers with minimal loss degradation.

本文如何被排名

报道来源 [1]

Graph Machine：通过边实现更好的预训练

相关实体

相关话题