2021/06/10 by Markus Haltmeier, Housen Li, Axel Munk · 4 citations
Engineering · Mathematics · #Applied mathematics #Artificial intelligence #Augmented Lagrangian method #Computer science #Context (archaeology) #Convex optimization #Duality (order theory) #Estimator #Inverse problem #Mathematical analysis #Mathematical optimization #Mathematics #Numerical methods in inverse problems #Regular polygon #Regularization (linguistics) #Sparse and Compressive Sensing Techniques #Statistical Methods and Inference #Statistics #math.ST #msc:62-02 #msc:62G05 #stat.CO #stat.ME #stat.TH
paper · pdf · open access · doi:10.1146/annurev-statistics-040120-030531
published in Annual Review of Statistics and Its Application 9(1), 343-372 (Annual Reviews)
arxiv created 2021/06/10 · openalex publication_date 2022/03/07 · arxiv updated 2022/03/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
We present a unifying view on various statistical estimation techniques including penalization, variational and thresholding methods. These estimators will be analyzed in the context of statistical linear inverse problems including nonparametric and change point regression, and high dimensional linear models as examples. Our approach reveals many seemingly unrelated estimation schemes as special instances of a general class of variational multiscale estimators, named MIND (MultIscale Nemirovskii--Dantzig). These estimators result from minimizing certain regularization functionals under convex constraints that can be seen as multiple statistical tests for local hypotheses. For computational purposes, we recast MIND in terms of simpler unconstraint optimization problems via Lagrangian penalization as well as Fenchel duality. Performance of several MINDs is demonstrated on numerical examples.