Sparse Matrix Inversion with Scaled Lasso
Tingni Sun, Cun-Hui Zhang

TL;DR
This paper introduces a scaled Lasso-based method for estimating sparse inverse covariance matrices, achieving faster convergence rates and improved theoretical guarantees without cross-validation, demonstrated through simulations.
Contribution
The paper presents a novel scaled Lasso algorithm for sparse matrix inversion with theoretical convergence guarantees and practical efficiency, surpassing existing methods.
Findings
Faster convergence rates under weaker conditions.
Data-driven penalty level determination without cross-validation.
Superior performance demonstrated in simulations.
Abstract
We propose a new method of learning a sparse nonnegative-definite target matrix. Our primary example of the target matrix is the inverse of a population covariance or correlation matrix. The algorithm first estimates each column of the target matrix by the scaled Lasso and then adjusts the matrix estimator to be symmetric. The penalty level of the scaled Lasso for each column is completely determined by data via convex minimization, without using cross-validation. We prove that this scaled Lasso method guarantees the fastest proven rate of convergence in the spectrum norm under conditions of weaker form than those in the existing analyses of other regularized algorithms, and has faster guaranteed rate of convergence when the ratio of the and spectrum norms of the target inverse matrix diverges to infinity. A simulation study demonstrates the computational feasibility…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Statistical Methods and Inference · Distributed Sensor Networks and Detection Algorithms
