arXiv:2605.12756math.OCcs.AI2026-05

揭示大模型训练中对称性如何从目标分布传递到模型权重和嵌入向量。

Uncovering Symmetry Transfer in Large Language Models via Layer-Peeled Optimization

论文配图:Uncovering Symmetry Transfer in Large Language Models via Layer-Peeled Optimization
图 1 · 摘自论文原文
  • 通过分层剥离优化建模,解析训练目标对模型几何结构的影响机制。
  • 发现周期性目标分布下,输出逻辑矩阵呈循环结构,嵌入向量具循环几何特征。
  • 实证表明开源大模型自然具备理论预测的对称性,无需额外正则化。

大型语言模型(LLMs)通过最小化下一个词预测的交叉熵损失进行预训练。本文研究这种优化策略是否会在模型权重和上下文嵌入中引发几何结构。我们采用受限的分层剥离优化程序作为数学上可处理的代理模型,将输出投影矩阵和最后一层上下文嵌入视为优化变量。分析表明,目标词分布中的对称性会以群论精确的方式传递到分层剥离模型的全局最小值中。具体而言,当目标词具有循环移位对称性(如一周七天或一年十二个月)时,最优逻辑矩阵恰好为循环矩阵,输出投影和上下文嵌入的格拉姆矩阵也呈现循环几何结构。对于在对称群下不变的可交换目标分布,以及更一般地在二传递群作用下的分布,全局最优输出投影矩阵构成单纯形等角紧框架,而最优逻辑矩阵和上下文嵌入则继承输入数据中的置换对称性。关键技术步骤是将约束的非凸因子化问题转化为循环对称性的显式逻辑层凸表征,以及基于对称性的下界估计与最优因子化的精确刻画。最后,我们实证验证了开源大模型天然表现出与理论预测一致的对称性,尽管训练过程中未施加任何显式正则化来促进此类几何结构。

原文摘要 · Abstract (English)

Large language models (LLMs) are pretrained by minimizing the cross-entropy loss for next-token prediction. In this paper, we study whether this optimization strategy can induce geometric structure in the learned model weights and context embeddings. We approach this problem by analyzing a constrained layer-peeled optimization program, which serves as a mathematically tractable surrogate for LLMs by treating the output projection matrix and last-layer context embeddings as optimization variables. Our analysis of this nonconvex optimization program demonstrates that symmetries in the target next-token distributions are transferred to the global minimizers of the layer-peeled model in a precise group-theoretic sense. Specifically, we prove that when the target tokens exhibit a cyclic-shift symmetry (such as the seven days of the week or the twelve months of the year), the optimal logit matrix is exactly circulant, and the Gram matrices of both the output projections and the context embeddings form circulant geometries as well. Next, for exchangeable target distributions invariant under the symmetric group and, more generally, under two-transitive group actions, we show that the global optimal output projection matrix forms a simplex equiangular tight frame, while the optimal logit matrix and context embeddings inherit the permutation symmetries present in the input data. A key technical step is to reduce the constrained nonconvex factorized problem to an explicit logit-level convex characterization for cyclic symmetry and to a symmetry-based lower bound for permutation symmetry, together with a sharp characterization of the optimal factorization. Finally, we empirically demonstrate that open-source LLMs naturally exhibit symmetries consistent with our theoretical predictions, despite being trained without any explicit regularization promoting such geometric structure.

大模型对称性几何结构优化分析

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