Artificial Intelligence · 26.08.2026, 09:02 UTC
Parameter-Level Attribution of Symmetry in Trained Networks Though Parameter-Wise Functional Sensitivity
| Schweregrad | info |
|---|---|
| Kategorie | Artificial Intelligence |
| Quelle | arXiv cs.LG ↗ |
| Veröffentlicht | 26.08.2026 UTC |
Sicherheitsmeldung mit Schweregrad noch nicht bewertet. Technische Details im Tab „Originaltext“; empfohlene Schritte in der Checkliste.
arXiv:2608.24700v1 Announce Type: new Abstract: When a network has learned a function with a known symmetry, can that symmetry be moved through the parametrisation---is there a motion in parameter space realising the group action in function space? We formulate this as a lifting problem for the realisation map $\Phi:\theta\mapsto f_\theta$, and show that a smooth parameter-space action exists only if the tangent space to the function's symmetry orbit lies within the image of $\mathrm d\Phi_\theta$, whose columns are the \emph{functional sensitivities} of individual parameters. This condition is also sufficient for pointwise first-order lifting. Relaxing it in least squares yields two local parameter directions: one following the symmetry orbit, one descending towards the equivariant subspace, with residuals measuring what the parametrisation cannot reach. On a rotationally invariant classifier we find these directions induce their predicted function-space motion, but only locally: recomputed directions track the orbit and reduce the equivariance defect, while directions held fixed depart from both after training. The same holds for Hamiltonian neural networks trained on a rotationally symmetric potential, even though the architecture does not explicitly enforce the symmetry.
Maßnahmen
⬇ Als MarkdownVerwandte Beiträge
- info Wait, Wait, Wait... Why Do Reasoning Models Loop?
- info SketchGuard: Scaling Byzantine-Robust Decentralized Federated Learning via Sketch-Based Screening
- info Round-trip Reinforcement Learning: Self-Consistent Training for Better Chemical LLMs
- info TLXML: Task-Level Explanation of Meta-Learning via Influence Functions