Consistencies and rates of convergence of jump-penalized least squares estimators

DOI10.1214/07-AOS558MaRDI QIDQ1002154zbMATH OpenFDO

Authors Leif Boysen, Angela Kempe, Volkmar Liebscher, Axel Munk, Olaf Wittich

Publication date 25 February 2009

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0902.4838, https://projecteuclid.org/euclid.aos/1232115931

zbMATH Keywords

variable selectionpenalized maximum likelihoodadaptive estimationchange-point analysisjump detectionSkorokhod topologyPotts functionalapproximation spacesmultiscale resolution analysisregressogram

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Nonparametric regression and quantile regression (62G08) Asymptotic properties of nonparametric inference (62G20) Central limit and other weak theorems (60F05) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)

Abstract: We study the asymptotics for jump-penalized least squares regression aiming at approximating a regression function by piecewise constant functions. Besides conventional consistency and convergence rates of the estimates in $L^2([0,1))$ our results cover other metrics like Skorokhod metric on the space of c`{a}dl`{a}g functions and uniform metrics on $C([0,1])$. We will show that these estimators are in an adaptive sense rate optimal over certain classes of "approximation spaces." Special cases are the class of functions of bounded variation (piecewise) H"{o}lder continuous functions of order $0<alphale1$ and the class of step functions with a finite but arbitrary number of jumps. In the latter setting, we will also deduce the rates known from change-point analysis for detecting the jumps. Finally, the issue of fully automatic selection of the smoothing parameter is addressed.

Recommendations

• Scale space consistency of piecewise constant least squares estimators – another look at the regressogram
• Complexity penalized least squares estimators: Analytical results
• Jump estimation in inverse regression
• scientific article; zbMATH DE number 10785
• Nonparametric estimation of piecewise smooth regression functions

Cites work

• scientific article; zbMATH DE number 3171491 (Why is no real title available?)
• scientific article; zbMATH DE number 4169866 (Why is no real title available?)
• scientific article; zbMATH DE number 3954047 (Why is no real title available?)
• scientific article; zbMATH DE number 3504209 (Why is no real title available?)
• scientific article; zbMATH DE number 1215245 (Why is no real title available?)
• scientific article; zbMATH DE number 1306459 (Why is no real title available?)
• scientific article; zbMATH DE number 477682 (Why is no real title available?)
• scientific article; zbMATH DE number 739533 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• scientific article; zbMATH DE number 3076589 (Why is no real title available?)
• A nonlinear gaussian filter applied to images with discontinuities
• An introduction to -convergence
• CART and best-ortho-basis: a connection
• Change point estimation using nonparametric regression
• Change-points in nonparametric regression analysis
• Discontinuous versus smooth regression
• Don't shed tears over breaks
• Edge-Preserving Smoothers for Image Processing
• Epi-convergence of sequences of normal integrands and strong consistency of the maximum likelihood estimator
• Estimating the number of change-points via Schwarz' criterion
• Estimation of a function with discontinuities via local polynomial fit with an adaptive window choice
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Ideal spatial adaptation by wavelet shrinkage
• Image denoising: Pointwise adaptive approach
• Inference about the change-point in a sequence of random variables
• Least squares estimation with complexity penalties
• Local extremes, runs, strings and multiresolution. (With discussion)
• Locally adaptive regression splines
• Minimal penalties for Gaussian model selection
• Multiple changepoint fitting via quasilikelihood, with application to DNA sequence segmentation
• Nonparametric estimation of piecewise smooth regression functions
• On a Conjecture of Revesz
• On the law of the iterated logarithm for double sequences of random variables
• Piecewise polynomial approximation on optimal meshes
• Robust priors for smoothing and image restoration
• Scale space consistency of piecewise constant least squares estimators – another look at the regressogram
• Scale space view of curve estimation.
• Smoothers for Discontinuous Signals
• Sparse estimators and the oracle property, or the return of Hodges' estimator
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Wedgelets: Nearly minimax estimation of edges

Cited in

(64)

• Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
• Multiple change points detection in high-dimensional multivariate regression
• Oracle efficient estimation of structural breaks in cointegrating regressions
• Complexity \(L^0\)-penalized \(M\)-estimation: consistency in more dimensions
• Consistent change-point detection with kernels
• Efficient multiple change point detection for high‐dimensional generalized linear models
• Recursive computation of piecewise constant volatilities
• Scale space consistency of piecewise constant least squares estimators – another look at the regressogram
• A kernel multiple change-point algorithm via model selection
• Joint Structural Break Detection and Parameter Estimation in High-Dimensional Nonstationary VAR Models
• Group Lasso for structural break time series
• Optimal change-point detection and localization
• Fused-MCP With Application to Signal Processing
• Multiscale change point inference. With discussion and authors' reply
• Univariate mean change point detection: penalization, CUSUM and optimality
• Detecting change points in the stress-strength reliability \(P(X < Y)\)
• Estimating the number of block boundaries from diagonal blockwise matrices without penalization
• Multiscale change-point segmentation: beyond step functions
• A computationally efficient nonparametric approach for changepoint detection
• Locally adaptive image denoising by a statistical multiresolution criterion
• Active-set based block coordinate descent algorithm in group LASSO for self-exciting threshold autoregressive model
• A sequential feature selection approach to change point detection in mean-shift change point models
• Change-point analysis for binomial autoregressive model with application to price stability counts
• Cardinality minimization, constraints, and regularization: a survey
• Nonparametric maximum likelihood approach to multiple change-point problems
• Convergence rates of least squares regression estimators with heavy-tailed errors
• Modified path algorithm of fused Lasso signal approximator for consistent recovery of change points
• Multiscale blind source separation
• Mumford-Shah and Potts regularization for manifold-valued data
• Concentration behavior of the penalized least squares estimator
• Density estimation via best \(L^2\)-approximation on classes of step functions.
• Complexity penalized least squares estimators: Analytical results
• Multiscale Quantile Segmentation
• Statistical methodology in single-molecule experiments
• Threshold estimation for continuous three‐phase polynomial regression models with constant mean in the middle regime
• LASSO estimation of threshold autoregressive models
• Jump-penalized least absolute values estimation of scalar or circle-valued signals
• Statistical challenges in microrheology
• Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
• Hypothesis testing for populations of networks
• Scalable multiple changepoint detection for functional data sequences
• On estimation of isotonic piecewise constant signals
• Fast and Scalable Algorithm for Detection of Structural Breaks in Big VAR Models
• Exact spike train inference via \(\ell_{0}\) optimization
• Wild binary segmentation for multiple change-point detection
• Two-stage data segmentation permitting multiscale change points, heavy tails and dependence
• Non-smooth variational regularization for processing manifold-valued data
• The \(L^1\)-Potts functional for robust jump-sparse reconstruction
• Optimal covariance change point localization in high dimensions
• FDR-control in multiscale change-point segmentation
• scientific article; zbMATH DE number 4169866 (Why is no real title available?)
• Robust change point detection method via adaptive LAD-Lasso
• Jump estimation in inverse regression
• Rank-based multiple change-point detection
• Multiple change-points detection in high dimension
• Properties and refinements of the fused Lasso
• Detecting possibly frequent change-points: wild binary segmentation 2 and steepest-drop model selection
• Changepoint detection by the quantile Lasso method
• Mining events with declassified diplomatic documents
• Consistency of a range of penalised cost approaches for detecting multiple changepoints
• Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework
• Bump detection in the presence of dependency: does it ease or does it load?
• A heuristic, iterative algorithm for change-point detection in abrupt change models
• Tail-greedy bottom-up data decompositions and fast multiple change-point detection

Describes a project that uses

Uses Software

• ftnonpar

This page was built for publication: Consistencies and rates of convergence of jump-penalized least squares estimators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002154)