Preconditioning to comply with the Irrepresentable Condition
Jinzhu Jia, Karl Rohe

TL;DR
This paper introduces a preconditioning method that transforms the design matrix in linear regression, making it satisfy the irrepresentable condition and thus improving the effectiveness of sparse model selection techniques.
Contribution
The paper proposes a novel preconditioning approach that ensures the design matrix meets the irrepresentable condition, enhancing sign consistency in sparse linear regression.
Findings
Preconditioning transforms the design matrix to satisfy the irrepresentable condition.
The method improves model selection performance in high-dimensional settings.
Simulation results demonstrate significant practical benefits.
Abstract
Preconditioning is a technique from numerical linear algebra that can accelerate algorithms to solve systems of equations. In this paper, we demonstrate how preconditioning can circumvent a stringent assumption for sign consistency in sparse linear regression. Given and that satisfy the standard regression equation, this paper demonstrates that even if the design matrix does not satisfy the irrepresentable condition for the Lasso, the design matrix often does, where is a preconditioning matrix defined in this paper. By computing the Lasso on , instead of on , the necessary assumptions on become much less stringent. Our preconditioner ensures that the singular values of the design matrix are either zero or one. When , the columns of are orthogonal and the preconditioner always…
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 · Blind Source Separation Techniques
