arXiv:2506.22389cs.LGcond-mat.dis-nn2025-06被引 2

让神经网络模块按需动态组合,实现高效智能计算。

Towards Distributed Neural Architectures

  • 模块与路由可动态重组,路径由数据内容决定。
  • 模型在视觉语言任务中性能媲美密集网络,且能自学习效率优化。
  • 路径分布呈幂律,部分模块出现功能专化,计算分配可解释。

我们引入并训练了分布式神经架构(DNA),应用于视觉和语言领域。DNAs 以包含(Transformer、MLP、注意力等)模块和路由器的原型架构初始化,任意标记(或图像块)可按任意顺序遍历任意模块序列。DNAs 是稀疏方法(如专家混合、深度混合、参数共享等)的自然推广。DNA 模块的计算与通信模式在训练中端到端学习,取决于每个标记(或图像块)的内容与上下文。这些模式可通过优化目标中的额外要求(如计算/内存效率、负载均衡)进行调节。实验证明:(i) 训练后的 DNAs 在两个领域均具有与密集基线相当的性能;(ii) 计算效率与参数共享可从数据中学习。进一步分析发现,标记所走路径本身服从幂律分布,部分路径(或模块组)表现出涌现的功能专化。最后,模型展现出可解释的计算与活跃参数分配策略。

原文摘要 · Abstract (English)

We introduce and train distributed neural architectures (DNA) in vision and language domains. DNAs are initialized with a proto-architecture that consists of (transformer, MLP, attention, etc.) modules and routers. Any token (or patch) can traverse any series of modules in any order. DNAs are a natural generalization of the sparse methods such as Mixture-of-Experts, Mixture-of-Depths, parameter sharing, etc. Computation and communication patterns of DNA modules are learnt end-to-end during training and depend on the content and context of each token (or patch). These patterns can be shaped by further requirements added to the optimization objective such as compute/memory efficiency or load balancing. We empirically show that (i) trained DNAs are competitive with the dense baselines in both domains and (ii) compute efficiency/parameter sharing can be learnt from data. Next, we analyze the emergent connectivity and computation patterns in the trained DNAs. We find that the paths that tokens take through the models are themselves distributed according to a power-law. We show that some paths (or, equivalently, groups of modules) show emergent specialization. Finally, we demonstrate that models learn to allocate compute and active parameters in an interpretable way.

分布式架构动态计算模型优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。