Complexity \(L^0\)-penalized \(M\)-estimation: consistency in more dimensions

DOI10.3390/axioms2030311zbMath1296.41005arXiv1301.5492OpenAlexW2591852112MaRDI QIDQ402320

Gerhard Winkler, Felix Friedrich, Laurent Demaret, Volkmar Liebscher

Publication date: 28 August 2014

Published in: Axioms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5492

zbMATH Keywords

convergence ratesconsistencyvariational approachadaptive estimationDelaunay triangulationsPotts functionalcomplexity penalizedpenalized \(M\)-estimationwedgelet partitions

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Nonparametric estimation (62G05) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)

Related Items

Multiscale Change Point Inference

Cites Work

• Unnamed Item
• Unnamed Item
• Minimax theory of image reconstruction
• Consistencies and rates of convergence of jump-penalized least squares estimators
• Image compression by linear splines over adaptive triangulations
• Don't shed tears over breaks
• Wedgelets: Nearly minimax estimation of edges
• Minimal penalties for Gaussian model selection
• Modern statistical estimation via oracle inequalities
• Sparse and Redundant Representations
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• New tight frames of curvelets and optimal representations of objects with piecewise C² singularities
• Smoothers for Discontinuous Signals
• Scale space consistency of piecewise constant least squares estimators – another look at the regressogram
• Smoothlets—Multiscale Functions for Adaptive Representation of Images
• Complexity penalized least squares estimators: Analytical results
• Efficient Moment Computation over Polygonal Domains with an Application to Rapid Wedgelet Approximation
• Some Convergence Theorems for Independent Random Variables