An L_ 1 smoothing spline algorithm with cross validation
An algorithm for computing the LAD smoothing splines in the spaces \(W_ M(D)\), with \([0,1]^ n \subseteq D\), is presented. The data are assumed to be of the form \(y_ i = f(t_ i) + \varepsilon_ i\), \(1 \leq i \leq N\) with \(t_ 1,\dots,t_ N \in D\), the \(\varepsilon\)'s are errors with \(E(\varepsilon_ i)=0\), and \(f \in W_ M\). The LAD spline \(s_ \lambda (\lambda \geq 0)\) is defined as the solution of the minimization problem \[ \text{Min} \left \{(1/N) \sum^ N_{i=1} \bigl | y_ i-g(t_ i) \bigr | + \lambda J_ M (g):g \in W_ M \right\}, \] where \(J_ M(g)\) is a suitably chosen seminorm of \(g\). Also, the so-called LAD-CV smoothing spline algorithm is discussed. An application of the latter algorithm to a problem in environment data interpretation is included.
- A comparison of Kriging with nonparametric regression methods
- A general method for the construction of interpolating or smoothing spline-functions
- A Unifying Approach to Nonparametric Regression Estimation
- scientific article; zbMATH DE number 3852235 (Why is no real title available?)
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- Kriging Nonstationary Data
- Multivariate Smoothing and Interpolating Splines
- Smoothing noisy data with spline functions
- L₁ spline fits via sliding window process: continuous and discrete cases
- LOWLAD: A locally weighted \(L_ 1\) smoothing spline algorithm with cross validated choice of smoothing parameters
- Some theory for L-spline smoothing
- Smoothing with Split Linear Fits
- Algorithm 642
- A POLYNOMIAL ALGORITHM ON COMPUTING LAG SPLINE
This page was built for publication: An \(L_ 1\) smoothing spline algorithm with cross validation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315221)
