Incremental stability in $p=1$ and $p=\infty$: classification and synthesis
Simon Kuang, Xinfan Lin

TL;DR
This paper presents a structure theorem for Lipschitz dynamics with weak infinitesimal contraction in $p=1$ and $p=$ norms, enabling neural network-based approximation and efficient Lipschitz certification.
Contribution
It introduces a neural network parameterization for WIC vector fields in $p=1$ and $p=$ norms, simplifying certification and demonstrating practical applications.
Findings
Neural networks can effectively approximate Lipschitz functions with WIC property.
Lipschitz certification costs are reduced to $O(d^2)$ operations.
Numerical experiments show successful reconstruction of contracting dynamics.
Abstract
All Lipschitz dynamics with the weak infinitesimal contraction (WIC) property can be expressed as a Lipschitz nonlinear system in proportional negative feedback -- this statement, a ``structure theorem,'' is true in the and norms. Equivalently, a Lipschitz vector field is WIC if and only if it can be written as a scalar decay plus a Lipschitz-bounded residual. We put this theorem to use using neural networks to approximate Lipschitz functions. This results in a map from unconstrained parameters to the set of WIC vector fields, enabling standard gradient-based training with no projections or penalty terms. Because the induced - and -norms of a matrix reduce to row or column sums, Lipschitz certification costs only operations -- the same order as a forward pass and appreciably cheaper than eigenvalue or semidefinite methods for the -norm. Numerical…
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.
