Paper Detail

Emergence of Fibrations, Compression, and Symmetry Breaking in Artificial Neural Networks

Osvaldo M Velarde, Lucas C Parra, Alireza Hashemi, Hernan A Makse

arxiv Score 17.0

Published 2026-09-01 · First seen 2026-09-03

Research Track A

Abstract

Artificial neural networks are often regarded as powerful yet opaque black boxes. Here, we demonstrate that learning in deep neural networks generates local symmetries known in graph theory as fibrations and coverings. We prove that covering symmetries are stable attractors of stochastic gradient descent. Consistent with this theory, we report the emergence of covering symmetries across major network architectures, including multilayer, convolutional, recurrent, and transformer networks. Exploiting these symmetries enables drastic model compression - reducing networks to 17% of their original size without sacrificing performance. Furthermore, controlled breaking of covering symmetry overcomes the loss of plasticity, achieving state-of-the-art performance in continual learning. The theoretical results provide a new foundation for AI systems based on symmetries that convert black boxes into interpretable colored graphs and enable more efficient inference and lifelong learning.

Workflow Status

Review status
pending
Role
unreviewed
Read priority
now
Vote
Not set.
Saved
no
Collections
Not filed yet.
Next action
Not filled yet.

Reading Brief

No structured notes yet. Add `summary_sections`, `why_relevant`, `claim_impact`, or `next_action` in `papers.jsonl` to enrich this view.

Why It Surfaced

No ranking explanation is available yet.

Tags

No tags.

BibTeX

@article{velarde2026emergence,
  title = {Emergence of Fibrations, Compression, and Symmetry Breaking in Artificial Neural Networks},
  author = {Osvaldo M Velarde and Lucas C Parra and Alireza Hashemi and Hernan A Makse},
  year = {2026},
  abstract = {Artificial neural networks are often regarded as powerful yet opaque black boxes. Here, we demonstrate that learning in deep neural networks generates local symmetries known in graph theory as fibrations and coverings. We prove that covering symmetries are stable attractors of stochastic gradient descent. Consistent with this theory, we report the emergence of covering symmetries across major network architectures, including multilayer, convolutional, recurrent, and transformer networks. Exploit},
  url = {https://arxiv.org/abs/2609.01768},
  keywords = {cs.LG},
  eprint = {2609.01768},
  archiveprefix = {arXiv},
}

Metadata

{}