Piecewise convex function estimation: Pilot estimators
From MaRDI portal
Abstract: Given noisy data, function estimation is considered when the unknown function is known a priori to consist of a small number of regions where the function is either convex or concave. When the number of regions is unknown, the model selection problem is to determine the number of convexity change points. For kernel estimates in Gaussian noise, the number of false change points is evaluated as a function of the smoothing parameter. To ensure that the number of false convexity change points tends to zero, the smoothing level must be larger than is generically optimal for minimizing the mean integrated square error (MISE). A two-stage estimator is proposed and shown to achieve the optimal rate of convergence of the MISE. In the first-stage, the number and location of the change points is estimated using strong smoothing. In the second-stage, a constrained smoothing spline fit is performed with the smoothing level chosen to minimize the MISE. The imposed constraint is that a single change point occur in a region about each empirical change point from the first-stage estimate. This constraint is equivalent to the requirement that the third derivative of the second-stage estimate have a single sign in a small neighborhood about each first-stage change point. The change points from the second-stage are in a neighborhood of the first-stage change points, but need not be at the identical locations.
Recommendations
Cites work
- scientific article; zbMATH DE number 3874417 (Why is no real title available?)
- scientific article; zbMATH DE number 3911487 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 3795187 (Why is no real title available?)
- A Data Smoothing Technique for Piecewise Convex/Concave Curves
- Density Estimation and Bump-Hunting by the Penalized Likelihood Method Exemplified by Scattering and Meteorite Data
- Error bounds for derivative estimates based on spline smoothing of exact or noisy data
- How Far Are Automatically Chosen Regression Smoothing Parameters From Their Optimum?
- Improved asymptotics for zeros of kernel estimates via a reformulation of the Leadbetter-Cryer integral
- Inequality-Constrained Multivariate Smoothing Splines with Application to the Estimation of Posterior Probabilities
- Multivariate Smoothing Spline Functions
- Nonparametric regression under qualitative smoothness assumptions
- On Qualitative Smoothness of Kernel Density Estimates1
- Piecewise Convex Function Estimation and Model Selection
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Smoothing noisy data under monotonicity constraints existence, characterization and convergence rates
- Some asymptotics for multimodality tests based on kernel density estimates
- Spline smoothing: The equivalent variable kernel method
- Variational solution of penalized likelihood problems and smooth curve estimation
Cited in
(2)
This page was built for publication: Piecewise convex function estimation: Pilot estimators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383095)