多智能体语言系统会因主导节点导致语义坍缩,趋于完全一致。
Asymptotic Semantic Collapse in Hierarchical Optimization
- 用黎曼流形建模语义状态,分析层级优化中的投影动态。
- 无论更新方式如何,最终语义都收敛到相同拓扑终点,路径无关。
- 语义越依赖上下文,自由度越少,最终趋于共享统一语法。
多智能体语言系统可能表现出一种失效模式:共享的主导上下文逐渐吸收个体语义,使各智能体行为趋同。本文在封闭语言环境中研究此现象,称为层级优化中的渐近语义坍缩。当主导锚点节点具有无限惯性时,与外围代理节点的反复交互会推动语义配置向最小化全局损失的渐近对齐。我们将语义状态建模为黎曼流形上的点,分析其诱导的投影动力学。结果表明:第一,极限语义配置对优化历史不敏感,光滑梯度更新与随机噪声更新均收敛至同一拓扑终点,实现收敛路径无关;第二,上下文依赖程度决定信息容量:从原子独立表示到完全纠缠上下文绑定表示的转变,在极限下使节点熵(即可用自由度)趋于零。该理论将信息论量与微分几何结构关联,暗示一种不可变的共识规则,强制智能体遵循共享语义语法。一个轻量级无数据集基准测试基于RWKV-7 13B GGUF检查点,报告零哈希冲突,贪婪解码下均值合规率为0.50,随机解码为0.531,最终与锚点的杰卡德相似度分别为0.295和0.224。
原文摘要 · Abstract (English)
Multi-agent language systems can exhibit a failure mode where a shared dominant context progressively absorbs individual semantics, yielding near-uniform behavior across agents. We study this effect under the name Asymptotic Semantic Collapse in Hierarchical Optimization. In a closed linguistic setting with a Dominant Anchor Node whose semantic state has effectively infinite inertia, we show that repeated interactions with Peripheral Agent Nodes drive an asymptotic alignment that minimizes a global loss. We model semantic states as points on a Riemannian manifold and analyze the induced projection dynamics. Two consequences follow. First, the limiting semantic configuration is insensitive to the optimization history: both smooth gradient-style updates and stochastic noisy updates converge to the same topological endpoint, establishing path independence at convergence. Second, the degree of context dependence controls information content: moving from atomic (independent) representations to fully entangled (context-bound) representations forces the node entropy, interpreted as available degrees of freedom, to vanish in the limit. The theory connects information-theoretic quantities with differential-geometric structure and suggests an interpretation as an immutable consensus rule that constrains agents to a shared semantic grammar. A lightweight dataset-free benchmark on an RWKV-7 13B GGUF checkpoint complements the analysis, reporting zero hash collisions, mean compliance of 0.50 under greedy decoding and 0.531 under stochastic decoding, and final Jaccard-to-anchor similarity values of 0.295 and 0.224, respectively.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。