arXiv:2609.08561cs.LGmath.AT2026-09

用拓扑方法证明:类别分离本质是成对的,而非多类协同。

Certified Topological Interaction in Neural Representations: Class Disentanglement Is Mostly Pairwise

论文配图:Certified Topological Interaction in Neural Representations: Class Disentanglement Is Mostly Pairwise
图 1 · 摘自论文原文
  • 通过交集欧拉特征谱测量类别点云间的拓扑交互。
  • 97%三元组中最强配对主导整体纠缠,且初始状态即存在。
  • 适合关注模型表征结构与类别混淆机制的研究者。

类别解耦(表示中类别条件点云在深度和训练过程中的分离)通常依赖描述性曲线判断。本文采用新提出的交集欧拉特征谱,通过一次Alpha复形扫描计算球体并集重叠区域的欧拉特征随尺度的变化,实现类别点云间认证的拓扑交互度量。每个数值均经双向精确置换检验、保护性分离证书及配对检验验证。在111个训练网络、52,650次认证测量中,解耦呈深度分级,集中于早期训练阶段;交互商可按混淆程度排序类别对(斯皮尔曼等级相关系数=0.83),性能媲美简单可分性统计。在96模型因子实验中,数据增强是唯一能超越随机水平分离类别的训练策略;权重衰减压缩重叠但不分离,深度与宽度无显著影响。结构性发现仅可通过k-fold统计揭示:97%三元组层单元与99.5%深层单元中,三元组联合纠缠低于其最强配对,远低于观测零假设下限,适用于视觉编码器与冻结语言模型。该成对主导规律为普遍现象,源于重叠嵌套,非几何强制,初始状态与原始像素中已存在,仅在最后一阶段网络记忆随机标签时人为制造。未归一化的轮廓质量预测测试准确率(R²=0.94),而商值无法预测,二者均不及线性探测器。核心教训明确:配对检验必须使用尺度无关统计,否则会将特征范数变化误判为解耦。

原文摘要 · Abstract (English)

Class disentanglement (the separation of a representation's class-conditional point clouds along depth and over training) is usually read off descriptive curves. We measure it as certified topological interaction between labeled point clouds, using the recently introduced Intersection Euler Characteristic Profile: the Euler characteristic of the overlap of the clouds' ball unions as a function of scale, computed by one Alpha-complex sweep with no boundary-matrix reduction. Every number carries a test: exact permutation tests in both directions, a guarded separation certificate, and a paired test for the comparative claims applications make. Across 111 trained networks and 52,650 certified measurements, disentanglement is depth-graded and concentrated in the first epochs, and interaction quotients rank class pairs by confusability (Spearman rho=0.83), on par with cheap separability statistics. In a 96-model factorial population, augmentation is the one training choice that separates classes relative to chance; weight decay compresses the overlap without separating, and depth and width do nothing. The structural finding is one only a k-fold statistic can pose: the joint entanglement of a class triple sits below that of its strongest pair in 97% of triple-layer cells and 99.5% of deep cells, far below a measured null floor, in vision encoders and frozen language models alike. This pairwise dominance is a regularity, not a law: expected from the nesting of overlaps but not forced by geometry, present at initialization and in raw pixels, and manufactured in the last stage alone when a network memorizes random labels. The unnormalized profile mass predicts test accuracy (R^2=0.94), the quotient does not, and neither beats a linear probe. One lesson is reported in full: the paired test must use a scale-free statistic, or it certifies feature-norm dynamics as disentanglement.

表示学习拓扑分析类别解耦

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