arXiv — Machine Learning · · 3 min read

Task-Restricted Symmetries in Recurrent Weight Space

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2606.18457 (cs)
[Submitted on 16 Jun 2026]

Title:Task-Restricted Symmetries in Recurrent Weight Space

View a PDF of the paper titled Task-Restricted Symmetries in Recurrent Weight Space, by Simon Dr\"ager
View PDF HTML (experimental)
Abstract:Recurrent networks can contain substantial functional redundancy in
weight space: changing a recurrent matrix may leave the input-output
rollout nearly unchanged on a task distribution, while similar-scale
changes can destroy the same behavior. We study this redundancy in
one-layer tanh RNNs using ordered real Schur coordinates. The Schur
form separates spectral blocks from directed nonnormal couplings,
giving a diagnostic basis for structured ablations that keep the input
and readout maps fixed. In a fixed-length copy task, selected
nonnormal Schur couplings can be removed with little loss in some
trained solutions, whereas other couplings are necessary for accurate
autonomous replay. Across flip-flop, sine generation, and
context-dependent integration, the loss-preserving ablation profile
varies across tasks and trained solutions. These results identify
candidate approximate functional invariances, not universal symmetries
of recurrent weight space. Schur-coordinate ablations provide a
practical diagnostic for which structured perturbations preserve a
trained recurrent solution and which ones disrupt its computation.
Comments: 6 pages, 2 figures. Accepted at the ICML 2026 Workshop on Weight-Space Symmetries
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2606.18457 [cs.LG]
  (or arXiv:2606.18457v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2606.18457
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Simon Dräger [view email]
[v1] Tue, 16 Jun 2026 20:04:07 UTC (471 KB)
Full-text links:

Access Paper:

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:
cs

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning