Riemannian Optimization in Modular Systems
Christian Pehle, Jean-Jacques Slotine

TL;DR
This paper introduces a Riemannian geometric framework for understanding and optimizing modular systems, including neural networks, providing new theoretical insights, efficient metrics, and stability guarantees.
Contribution
It combines Riemannian geometry with backpropagation, introduces a recursive layerwise metric, and develops a framework for analyzing modular system optimization.
Findings
Layerwise Riemannian metrics can be computed efficiently.
The framework offers stability guarantees for modular system optimization.
Applicable to neural networks and biological systems.
Abstract
Understanding how systems built out of modular components can be jointly optimized is an important problem in biology, engineering, and machine learning. The backpropagation algorithm is one such solution and has been instrumental in the success of neural networks. Despite its empirical success, a strong theoretical understanding of it is lacking. Here, we combine tools from Riemannian geometry, optimal control theory, and theoretical physics to advance this understanding. We make three key contributions: First, we revisit the derivation of backpropagation as a constrained optimization problem and combine it with the insight that Riemannian gradient descent trajectories can be understood as the minimum of an action. Second, we introduce a recursively defined layerwise Riemannian metric that exploits the modular structure of neural networks and can be efficiently computed using the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning in Materials Science · Model Reduction and Neural Networks · Neural Networks and Reservoir Computing
