Notes on stable learning with piecewise-linear basis functions
Winfried Lohmiller, Philipp Gassert, Jean-Jacques Slotine

TL;DR
This paper investigates the stability and convergence of learning algorithms that use piecewise-linear basis functions, providing theoretical insights into their performance through nonlinear contraction theory.
Contribution
It offers new theoretical analysis of the stability and convergence properties of piecewise-linear basis function learning methods.
Findings
Provides stability conditions for piecewise-linear basis functions
Demonstrates convergence guarantees using nonlinear contraction theory
Enhances understanding of function approximation techniques
Abstract
We discuss technical results on learning function approximations using piecewise-linear basis functions, and analyze their stability and convergence using nonlinear contraction theory.
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
TopicsControl and Stability of Dynamical Systems · Model Reduction and Neural Networks · Numerical methods for differential equations
