L1 Control Theoretic Smoothing Splines
Masaaki Nagahara, Clyde F. Martin

TL;DR
This paper introduces control theoretic smoothing splines with L1 optimality to reduce parameters and enhance robustness against outliers, using convex optimization for efficient computation.
Contribution
It proposes a novel L1 optimality framework for control theoretic smoothing splines, improving robustness and parameter efficiency over traditional methods.
Findings
Effective outlier removal demonstrated in numerical example
Reduced number of parameters needed for curve fitting
Convex optimization enables efficient computation
Abstract
In this paper, we propose control theoretic smoothing splines with L1 optimality for reducing the number of parameters that describes the fitted curve as well as removing outlier data. A control theoretic spline is a smoothing spline that is generated as an output of a given linear dynamical system. Conventional design requires exactly the same number of base functions as given data, and the result is not robust against outliers. To solve these problems, we propose to use L1 optimality, that is, we use the L1 norm for the regularization term and/or the empirical risk term. The optimization is described by a convex optimization, which can be efficiently solved via a numerical optimization software. A numerical example shows the effectiveness of the proposed method.
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.
