Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima

zbMath1360.62276arXiv1305.2436MaRDI QIDQ5502126

Publication date: 17 August 2015

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

model selection nonconvex optimization \(M\)-estimation high-dimensional statistics nonconvex regularization

Estimation in multivariate analysis (62H12) Ridge regression; shrinkage estimators (Lasso) (62J07) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Statistical ranking and selection procedures (62F07)

Related Items

On an extension of the promotion time cure model, The robust desparsified lasso and the focused information criterion for high-dimensional generalized linear models, Robust estimation and shrinkage in ultrahigh dimensional expectile regression with heavy tails and variance heterogeneity, A general family of trimmed estimators for robust high-dimensional data analysis, A New Principle for Tuning-Free Huber Regression, Bayesian Estimation of Gaussian Conditional Random Fields, Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA, Global solutions to folded concave penalized nonconvex learning, Sparse recovery via nonconvex regularized \(M\)-estimators over \(\ell_q\)-balls, Minimum distance Lasso for robust high-dimensional regression, A high-dimensional M-estimator framework for bi-level variable selection, GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee, Variable Selection With Second-Generation P-Values, On two recent nonconvex penalties for regularization in machine learning, High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks, Hard Thresholding Regularised Logistic Regression: Theory and Algorithms, Distributed testing and estimation under sparse high dimensional models, Bias versus non-convexity in compressed sensing, Unnamed Item, Nonconvex regularization for sparse neural networks, An improved algorithm for high-dimensional continuous threshold expectile model with variance heterogeneity, Accelerated Methods for NonConvex Optimization, Penalised robust estimators for sparse and high-dimensional linear models, Robustness and Tractability for Non-convex M-estimators, Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions, Functional additive regression, High-dimensional rank-based graphical models for non-Gaussian functional data, On high-dimensional Poisson models with measurement error: hypothesis testing for nonlinear nonconvex optimization, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Byzantine-robust distributed sparse learning for \(M\)-estimation, Penalized Estimation of Frailty-Based Illness–Death Models for Semi-Competing Risks, Statistical Inference, Learning and Models in Big Data, Penalized wavelet nonparametric univariate logistic regression for irregular spaced data, Sparse estimation in high-dimensional linear errors-in-variables regression via a covariate relaxation method, Learning Markov Models Via Low-Rank Optimization, Sparse Laplacian shrinkage for nonparametric transformation survival model, Model-Assisted Uniformly Honest Inference for Optimal Treatment Regimes in High Dimension, Misspecified nonconvex statistical optimization for sparse phase retrieval, Sparse precision matrix estimation with missing observations, A convex-Nonconvex strategy for grouped variable selection, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, Retire: robust expectile regression in high dimensions, Projection Test for Mean Vector in High Dimensions, Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression, Low-rank matrix estimation via nonconvex optimization methods in multi-response errors-in-variables regression, Unnamed Item, Differentially private inference via noisy optimization, Statistical analysis of sparse approximate factor models, A primal and dual active set algorithm for truncated \(L_1\) regularized logistic regression, Lower bounds for finding stationary points I, On the finite-sample analysis of \(\Theta\)-estimators, Finite-sample analysis of \(M\)-estimators using self-concordance, THE FACTOR-LASSO AND K-STEP BOOTSTRAP APPROACH FOR INFERENCE IN HIGH-DIMENSIONAL ECONOMIC APPLICATIONS, Hard thresholding regression, Oracle Inequalities for Local and Global Empirical Risk Minimizers, On the finite-sample analysis of \(\Theta\)-estimators, Targeted Random Projection for Prediction From High-Dimensional Features, Going beyond oracle property: selection consistency and uniqueness of local solution of the generalized linear model, Adaptive Huber Regression, Rejoinder, Pathwise coordinate optimization for sparse learning: algorithm and theory, ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models, Restricted strong convexity implies weak submodularity, I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, A Tight Bound of Hard Thresholding, Rate optimal estimation and confidence intervals for high-dimensional regression with missing covariates, Unnamed Item, Consistency bounds and support recovery of d-stationary solutions of sparse sample average approximations, Asymptotic properties on high-dimensional multivariate regression M-estimation, Sorted concave penalized regression, Endogeneity in high dimensions, Minimum average variance estimation with group Lasso for the multivariate response central mean subspace, Broken adaptive ridge regression and its asymptotic properties, A unified primal dual active set algorithm for nonconvex sparse recovery, Bi-selection in the high-dimensional additive hazards regression model, Graphical-model based high dimensional generalized linear models, Iteratively reweighted \(\ell_1\)-penalized robust regression, The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy, Wavelet-based robust estimation and variable selection in nonparametric additive models, Non-concave penalization in linear mixed-effect models and regularized selection of fixed effects, Computational and statistical analyses for robust non-convex sparse regularized regression problem, Sparse classification: a scalable discrete optimization perspective, Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning, The finite sample properties of sparse M-estimators with pseudo-observations, Asymptotic linear expansion of regularized M-estimators, Unnamed Item, Bayesian Regularization for Graphical Models With Unequal Shrinkage, Unnamed Item, Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Building a telescope to look into high-dimensional image spaces, Nonregular and minimax estimation of individualized thresholds in high dimension with binary responses, Penalized wavelet estimation and robust denoising for irregular spaced data, Unnamed Item, High-dimensional linear regression with hard thresholding regularization: theory and algorithm, Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization

Uses Software