High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks
From MaRDI portal
(Redirected from Publication:5060495)
Cites work
- \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
- A consistent information criterion for support vector machines in diverging model spaces
- A general theory of concave regularization for high-dimensional sparse estimation problems
- A Statistical View of Some Chemometrics Regression Tools
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- An error bound for L₁-norm support vector machine coefficients in ultra-high dimension
- Calibrating nonconvex penalized regression in ultra-high dimension
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Convexity, Classification, and Risk Bounds
- Cubic regularization of Newton method and its global performance
- Deep vs. shallow networks: an approximation theory perspective
- Error bounds for approximations with deep ReLU networks
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- Gap safe screening rules for sparsity enforcing penalties
- Generalization Error in Deep Learning
- scientific article; zbMATH DE number 6378127 (Why is no real title available?)
- Learning ReLU Networks on Linearly Separable Data: Algorithm, Optimality, and Generalization
- Lectures on stochastic programming. Modeling and theory.
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
- Modern statistical estimation via oracle inequalities
- Nearly unbiased variable selection under minimax concave penalty
- Nonconcave Penalized Likelihood With NP-Dimensionality
- On affine scaling algorithms for nonconvex quadratic programming
- On constrained and regularized high-dimensional regression
- On the complexity of approximating a KKT point of quadratic programming
- On the conditions used to prove oracle results for the Lasso
- One-step sparse estimates in nonconcave penalized likelihood models
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Optimal nonlinear approximation
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Rademacher complexities and bounding the excess risk in active learning
- Ranking and empirical minimization of \(U\)-statistics
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming
- Simultaneous analysis of Lasso and Dantzig selector
- Smooth minimization of non-smooth functions
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- Statistics for high-dimensional data. Methods, theory and applications.
- Strong oracle optimality of folded concave penalized estimation
- The L₁ penalized LAD estimator for high dimensional linear regression
- The Adaptive Lasso and Its Oracle Properties
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Variable selection for support vector machines in moderately high dimensions
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(2)
This page was built for publication: High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060495)
