Graph-based Square-Root Estimation for Sparse Linear Regression
From MaRDI portal
Cites work
- A Bennett concentration inequality and its application to suprema of empirical processes
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A semi-smooth Newton method for inverse problem with uniform noise
- A Statistical View of Some Chemometrics Regression Tools
- An efficient semismooth Newton method for adaptive sparse signal recovery problems
- Calibrating nonconvex penalized regression in ultra-high dimension
- Composite difference-MAX programs for modern statistical estimation problems
- DSLRIG: leveraging predictor structure in logistic regression
- First-order methods in optimization
- Graph-based sparse linear discriminant analysis for high-dimensional classification
- Hankel matrix rank minimization with applications to system identification and realization
- High-dimensional additive modeling
- High-dimensional expectile regression incorporating graphical structure among predictors
- High-dimensional generalized linear models incorporating graphical structure among predictors
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- scientific article; zbMATH DE number 5251637 (Why is no real title available?)
- Improved bounds for square-root Lasso and square-root slope
- Incorporating Graphical Structure of Predictors in Sparse Quantile Regression
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Model Selection and Estimation in Regression with Grouped Variables
- Model selection and estimation in the Gaussian graphical model
- Multivariate adaptive regression splines
- Nearly unbiased variable selection under minimax concave penalty
- New concentration inequalities for suprema of empirical processes
- Oracle inequalities and optimal inference under group sparsity
- Proximal methods for the latent group lasso penalty
- Proximal splitting methods in signal processing
- Recovery of sums of sparse and dense signals by incorporating graphical structure among predictors
- Simultaneous analysis of Lasso and Dantzig selector
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
- Slope meets Lasso: improved oracle bounds and optimality
- Sparse inverse covariance estimation with the graphical lasso
- Sparsity in multiple kernel learning
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Statistics for high-dimensional data. Methods, theory and applications.
- The L₁ penalized LAD estimator for high dimensional linear regression
- The Bernstein-Orlicz norm and deviation inequalities
- The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Graph-based Square-Root Estimation for Sparse Linear Regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7261388)
