The gradient flow of recurrent networks can be written as -P K P* Err, and the low rank of K explains dynamic collapse to low-dimensional attractors.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
KPFlow: An Operator Perspective on Dynamic Collapse Under Gradient Descent Training of Recurrent Networks
The gradient flow of recurrent networks can be written as -P K P* Err, and the low rank of K explains dynamic collapse to low-dimensional attractors.