Contracting Implicit Recurrent Neural Networks: Stable Models with Improved Trainability

December 22, 2019 ยท Declared Dead ยท ๐Ÿ› Conference on Learning for Dynamics & Control

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Max Revay, Ian R. Manchester arXiv ID 1912.10402 Category cs.LG: Machine Learning Cross-listed eess.SY, math.OC, stat.ML Citations 47 Venue Conference on Learning for Dynamics & Control Last Checked 6 months ago
Abstract
Stability of recurrent models is closely linked with trainability, generalizability and in some applications, safety. Methods that train stable recurrent neural networks, however, do so at a significant cost to expressibility. We propose an implicit model structure that allows for a convex parametrization of stable models using contraction analysis of non-linear systems. Using these stability conditions we propose a new approach to model initialization and then provide a number of empirical results comparing the performance of our proposed model set to previous stable RNNs and vanilla RNNs. By carefully controlling stability in the model, we observe a significant increase in the speed of training and model performance.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted