Scaled sparse linear regression
From MaRDI portal
Abstract: Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual square and scaling the penalty in proportion to the estimated noise level. The iterative algorithm costs little beyond the computation of a path or grid of the sparse regression estimator for penalty levels above a proper threshold. For the scaled lasso, the algorithm is a gradient descent in a convex minimization of a penalized joint loss function for the regression coefficients and noise level. Under mild regularity conditions, we prove that the scaled lasso simultaneously yields an estimator for the noise level and an estimated coefficient vector satisfying certain oracle inequalities for prediction, the estimation of the noise level and the regression coefficients. These inequalities provide sufficient conditions for the consistency and asymptotic normality of the noise level estimator, including certain cases where the number of variables is of greater order than the sample size. Parallel results are provided for the least squares estimation after model selection by the scaled lasso. Numerical results demonstrate the superior performance of the proposed methods over an earlier proposal of joint convex minimization.
Recommendations
- Sparse regression: scalable algorithms and empirical performance
- Approximate sparse linear regression
- Scalable algorithms for the sparse ridge regression
- Linear Regression With a Sparse Parameter Vector
- Sparse linear regression from perturbed data
- Sparse regression using mixed norms
- Sparse Convex Regression
- scientific article; zbMATH DE number 6866335
- Scalable holistic linear regression
- scientific article; zbMATH DE number 1843055
Cited in
(only showing first 100 items - show all)- Inference for High-Dimensional Linear Mixed-Effects Models: A Quasi-Likelihood Approach
- SLOPE-adaptive variable selection via convex optimization
- Adaptive robust estimation in sparse vector model
- Adaptive estimation of high-dimensional signal-to-noise ratios
- A general theory of concave regularization for high-dimensional sparse estimation problems
- High-dimensional inference: confidence intervals, \(p\)-values and R-software \texttt{hdi}
- Ridge regression and asymptotic minimax estimation over spheres of growing dimension
- A study on tuning parameter selection for the high-dimensional lasso
- A fast trans-lasso algorithm with penalized weighted score function
- Two-sample testing of high-dimensional linear regression coefficients via complementary sketching
- A self-calibrated direct approach to precision matrix estimation and linear discriminant analysis in high dimensions
- A nonparametric empirical Bayes approach to large-scale multivariate regression
- Covariate assisted screening and estimation
- Variance prior forms for high-dimensional Bayesian variable selection
- Robust subspace clustering
- Generalized matrix decomposition regression: estimation and inference for two-way structured data
- Localized Gaussian width of \(M\)-convex hulls with applications to Lasso and convex aggregation
- Sorted concave penalized regression
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Discussion: ``A significance test for the lasso
- Are Latent Factor Regression and Sparse Regression Adequate?
- Confidence intervals for low dimensional parameters in high dimensional linear models
- Accuracy assessment for high-dimensional linear regression
- Sharp oracle inequalities for square root regularization
- Hard-thresholding regularization method for high-dimensional heterogeneous models
- A global homogeneity test for high-dimensional linear regression
- Noise covariance estimation in multi-task high-dimensional linear models
- Variance estimation for sparse ultra-high dimensional varying coefficient models
- Adapting to unknown noise level in sparse deconvolution
- Sparse regression using mixed norms
- Selective inference with a randomized response
- Online Debiasing for Adaptively Collected High-Dimensional Data With Applications to Time Series Analysis
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Sparse matrix inversion with scaled Lasso
- Scalable network estimation with L₀ penalty
- On the prediction loss of the Lasso in the partially labeled setting
- Optimal designs in sparse linear models
- Ill-posed estimation in high-dimensional models with instrumental variables
- Balanced estimation for high-dimensional measurement error models
- A significance test for the lasso
- Testing a single regression coefficient in high dimensional linear models
- Kernel-penalized regression for analysis of microbiome data
- Tuning-free heterogeneous inference in massive networks
- Improved bounds for square-root Lasso and square-root slope
- Small Tuning Parameter Selection for the Debiased Lasso
- Square root LASSO: well-posedness, Lipschitz stability, and the tuning trade-off
- Debiasing the Lasso: optimal sample size for Gaussian designs
- Scalable algorithms for the sparse ridge regression
- Linear hypothesis testing in dense high-dimensional linear models
- Oracle inequalities for high-dimensional prediction
- Confidence intervals for high-dimensional partially linear single-index models
- Power of testing for exposure effects under incomplete mediation
- Discussion: ``A significance test for the lasso
- Targeted Inference Involving High-Dimensional Data Using Nuisance Penalized Regression
- Penalised robust estimators for sparse and high-dimensional linear models
- Robust feature screening for elliptical copula regression model
- A Sparse Learning Approach to Relative-Volatility-Managed Portfolio Selection
- Sharp oracle inequalities for low-complexity priors
- High-dimensional variable screening and bias in subsequent inference, with an empirical comparison
- Testing for high-dimensional network parameters in auto-regressive models
- High-dimensional statistical inference via DATE
- A tuning-free robust and efficient approach to high-dimensional regression
- A two-stage sequential conditional selection approach to sparse high-dimensional multivariate regression models
- High-dimensional tests for functional networks of brain anatomic regions
- Innovated scalable efficient inference for ultra-large graphical models
- A new reproducing kernel‐based nonlinear dimension reduction method for survival data
- Optimal bounds for aggregation of affine estimators
- Matrix completion via max-norm constrained optimization
- On estimation of the diagonal elements of a sparse precision matrix
- Penalized estimation in high-dimensional hidden Markov models with state-specific graphical models
- Inference on Multi-level Partial Correlations Based on Multi-subject Time Series Data
- A unified precision matrix estimation framework via sparse column-wise inverse operator under weak sparsity
- Grouped Heterogeneity in Linear Panel Data Models with Heterogeneous Error Variances
- L0-Regularized Learning for High-Dimensional Additive Hazards Regression
- The Dantzig selector for a linear model of diffusion processes
- Prediction error bounds for linear regression with the TREX
- Rejoinder to “A Tuning-Free Robust and Efficient Approach to High-Dimensional Regression”
- A Critical Review of LASSO and Its Derivatives for Variable Selection Under Dependence Among Covariates
- High-dimensional partial correlation coefficients: A survey study of estimation Methods
- AIC for the Lasso in generalized linear models
- Score function-based tests for ultrahigh-dimensional linear models
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- The projected covariance measure for assumption-lean variable significance testing
- Ridge regression revisited: debiasing, thresholding and bootstrap
- A zero-estimator approach for estimating the signal level in a high-dimensional model-free setting
- Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation
- Comment on “A Tuning-Free Robust and Efficient Approach to High-Dimensional Regression”
- Discussion of “A Tuning-Free Robust and Efficient Approach to High-Dimensional Regression”
- Data-Driven Tuning Parameter Selection for High-Dimensional Vector Autoregressions
- Best subset selection with shrinkage: sparse additive hazards regression with the grouping effect
- Variance estimation in high-dimensional linear regression via adaptive elastic-net
- Adaptive posterior concentration rates for sparse high-dimensional linear regression with random design and unknown error variance
- Hierarchical correction of \(p\)-values via an ultrametric tree running Ornstein-Uhlenbeck process
- Contraction of a quasi-Bayesian model with shrinkage priors in precision matrix estimation
- Assessing influential observations in pain prediction using fMRI data
- Fdr control for high-dimensional graphical models via e-values
- A permutation approach for selecting the penalty parameter in penalized model selection
- Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
This page was built for publication: Scaled sparse linear regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143465)
