Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
From MaRDI portal
Publication:2425168
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A minimal algorithm for the multiple-choice knapsack problem
- Asymptotic Equivalence of Regularization Methods in Thresholded Parameter Space
- Asymptotic normality and optimalities in estimation of large Gaussian graphical models
- Best subset selection via a modern optimization lens
- Gaussian graphical model estimation with false discovery rate control
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- High-dimensional graphs and variable selection with the Lasso
- Innovated higher criticism for detecting sparse signals in correlated noise
- Innovated scalable efficient estimation in ultra-large Gaussian graphical models
- Lasso-type recovery of sparse representations for high-dimensional data
- Model selection and estimation in the Gaussian graphical model
- Network exploration via the adaptive LASSO and SCAD penalties
- On the consistency of feature selection using greedy least squares regression
- Quasi-Equilibria in Markets with Non-Convex Preferences
- Scaled sparse linear regression
- Stability Selection
- TIGER: A tuning-insensitive approach for optimally estimating Gaussian graphical models
- The design of approximation algorithms
Cited in
(3)
This page was built for publication: Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425168)
