The following pages link to The Lasso problem and uniqueness (Q1951165):
Displayed 50 items.
- Estimation of high-dimensional graphical models using regularized score matching (Q138467) (← links)
- Analysis of a nonsmooth optimization approach to robust estimation (Q254560) (← links)
- Inference in adaptive regression via the Kac-Rice formula (Q282472) (← links)
- Exact post-selection inference, with application to the Lasso (Q292865) (← links)
- The use of vector bootstrapping to improve variable selection precision in Lasso models (Q309418) (← links)
- The geometry of least squares in the 21st century (Q373539) (← links)
- Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control (Q781560) (← links)
- On cross-validated Lasso in high dimensions (Q820794) (← links)
- Hybrid safe-strong rules for efficient optimization in Lasso-type problems (Q830584) (← links)
- Model selection consistency of Lasso for empirical data (Q1624086) (← links)
- Degrees of freedom for piecewise Lipschitz estimators (Q1650119) (← links)
- Lasso, fractional norm and structured sparse estimation using a Hadamard product parametrization (Q1658387) (← links)
- Natural coordinate descent algorithm for \(\ell_1\)-penalised regression in generalised linear models (Q1659358) (← links)
- A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso (Q1662870) (← links)
- LARS-type algorithm for group Lasso (Q1703818) (← links)
- Maximal solutions of sparse analysis regularization (Q1730389) (← links)
- Efficient Bayesian regularization for graphical model selection (Q1738143) (← links)
- The generalized Lasso problem and uniqueness (Q2002568) (← links)
- Machine learning subsurface flow equations from data (Q2009819) (← links)
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions (Q2013141) (← links)
- Second-order Stein: SURE for SURE and other applications in high-dimensional inference (Q2054467) (← links)
- Free disposal hull condition to verify when efficiency coincides with weak efficiency (Q2073052) (← links)
- Sparsest piecewise-linear regression of one-dimensional data (Q2074905) (← links)
- In defense of the indefensible: a very naïve approach to high-dimensional inference (Q2075709) (← links)
- Feature selection for data integration with mixed multiview data (Q2078739) (← links)
- LASSO for streaming data with adaptative filtering (Q2104007) (← links)
- The inverse problem for conducting defective lattices (Q2138811) (← links)
- Random weighting in LASSO regression (Q2154956) (← links)
- Adaptive multi-penalty regularization based on a generalized Lasso path (Q2175012) (← links)
- On the distribution, model selection properties and uniqueness of the Lasso estimator in low and high dimensions (Q2180053) (← links)
- Primal path algorithm for compositional data analysis (Q2189589) (← links)
- An inexact proximal generalized alternating direction method of multipliers (Q2191781) (← links)
- Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons (Q2225312) (← links)
- Oscillation of metropolis-Hastings and simulated annealing algorithms around LASSO estimator (Q2229034) (← links)
- A significance test for the lasso (Q2249837) (← links)
- Discussion: ``A significance test for the lasso'' (Q2249838) (← links)
- Rejoinder: ``A significance test for the lasso'' (Q2249839) (← links)
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
- Robust elastic net estimators for variable selection and identification of proteomic biomarkers (Q2291496) (← links)
- Numerical analysis for conservation laws using \(l_1\) minimization (Q2291861) (← links)
- Safe feature elimination for non-negativity constrained convex optimization (Q2302836) (← links)
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis (Q2317847) (← links)
- On Lasso refitting strategies (Q2325356) (← links)
- Risk bound of transfer learning using parametric feature mapping and its application to sparse coding (Q2331678) (← links)
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations (Q2374380) (← links)
- Leave-one-out cross-validation is risk consistent for Lasso (Q2512895) (← links)
- Iteration-complexity analysis of a generalized alternating direction method of multipliers (Q2633539) (← links)
- Quadratic growth conditions and uniqueness of optimal solution to Lasso (Q2671439) (← links)
- Convergence rates of the heavy-ball method under the Łojasiewicz property (Q2687044) (← links)
- When Ramanujan meets time-frequency analysis in complicated time series analysis (Q2688183) (← links)