The Price of Competition: Effect Size Heterogeneity Matters in High Dimensions

• Published in: IEEE transactions on information theory Vol. 68; no. 8; pp. 5268 - 5294
• Main Authors: Wang, Hua, Yang, Yachong, Su, Weijie J.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Approximate message passing; Competition; Data models; Data science; Dimensional analysis; false discovery rate; Heterogeneity; high-dimensional sparse regression; Indexes; Input variables; Message passing; model selection; Noise level; Regression coefficients; Signal to noise ratio; Sparsity; Tradeoffs; Upper bound
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2022.3166720

In high-dimensional sparse regression, would increasing the signal-to-noise ratio while fixing the sparsity level always lead to better model selection? For high-dimensional sparse regression problems, surprisingly, in this paper we answer this question in the negative in the regime of linear sparsity for the Lasso method, relying on a new concept we term effect size heterogeneity . Roughly speaking, a regression coefficient vector has high effect size heterogeneity if its nonzero entries have significantly different magnitudes. From the viewpoint of this new measure, we prove that the false and true positive rates achieve the optimal trade-off uniformly along the Lasso path when this measure is maximal in a certain sense, and the worst trade-off is achieved when it is minimal in the sense that all nonzero effect sizes are roughly equal. Moreover, we demonstrate that the first false selection occurs much earlier when effect size heterogeneity is minimal than when it is maximal. The underlying cause of these two phenomena is, metaphorically speaking, the "competition" among variables with effect sizes of the same magnitude in entering the model. Taken together, our findings suggest that effect size heterogeneity shall serve as an important complementary measure to the sparsity of regression coefficients in the analysis of high-dimensional regression problems. Our proofs use techniques from approximate message passing theory as well as a novel technique for estimating the rank of the first false variable.