Notes on stable learning with piecewise-linear basis functions
We discuss technical results on learning function approximations using piecewise-linear basis functions, and analyze their stability and convergence using nonlinear contraction theory.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions
This paper presents a parametric solution to piecewise linear regression through the Adaptive Block Gradient Descent (ABGD) algorithm. The heart of the method is the parametrization of piecewise linear functions as the d…
Representing Piecewise Linear Functions by Functions with Small Arity
A piecewise linear function can be described in different forms: as an arbitrarily nested expression of $\min$- and $\max$-functions, as a difference of two convex piecewise linear functions, or as a linear combination o…
Parametric Level-sets Enhanced To Improve Reconstruction (PaLEnTIR)
We introduce PaLEnTIR, a significantly enhanced parametric level-set (PaLS) method addressing the restoration and reconstruction of piecewise constant objects. Our key contribution involves a unique PaLS formulation util…
DenoisingDeep Neural Networks and Finite Elements of Any Order on Arbitrary Dimensions
In this study, we establish that deep neural networks employing ReLU and ReLU$^2$ activation functions can effectively represent Lagrange finite element functions of any order on various simplicial meshes in arbitrary di…
Hyperplane Arrangements and Fixed Points in Iterated PWL Neural Networks
We leverage the framework of hyperplane arrangements to analyze potential regions of (stable) fixed points. We provide an upper bound on the number of fixed points for multi-layer neural networks equipped with piecewise …