{"ID":2881376,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.12258","arxiv_id":"2508.12258","title":"Identifying Network Hubs with the Partial Correlation Graphical LASSO","abstract":"Graphical LASSO (GLASSO) is a widely used method for estimating sparse precision matrices and learning undirected graphical models in high-dimensional settings. Because GLASSO penalizes entries of the precision matrix directly, however, it is not scale-invariant. Partial Correlation Graphical LASSO (PCGLASSO), introduced by Carter et al. (2024), addresses this limitation by penalizing partial correlations, which directly characterize conditional dependence. In this paper, we study both statistical and computational properties of the PCGLASSO estimator. Our main contribution is the introduction of a scale-invariant irrepresentability condition for PCGLASSO and the proof that this condition is sufficient for consistent model selection. We further show that this condition is weaker than the corresponding irrepresentability condition for GLASSO, helping to explain the improved empirical behavior of PCGLASSO in settings such as hub-structured graphs. In addition, we develop two efficient algorithms for computing the estimator and analyze the nonconvex optimization problem underlying PCGLASSO, deriving conditions for global uniqueness and showing consistency of all minimizers.","short_abstract":"Graphical LASSO (GLASSO) is a widely used method for estimating sparse precision matrices and learning undirected graphical models in high-dimensional settings. Because GLASSO penalizes entries of the precision matrix directly, however, it is not scale-invariant. Partial Correlation Graphical LASSO (PCGLASSO), introduc...","url_abs":"https://arxiv.org/abs/2508.12258","url_pdf":"https://arxiv.org/pdf/2508.12258v2","authors":"[\"Małgorzata Bogdan\",\"Adam Chojecki\",\"Ivan Hejný\",\"Bartosz Kołodziejek\",\"Jonas Wallin\"]","published":"2025-08-17T06:43:51Z","proceeding":"math.ST","tasks":"[\"math.ST\",\"math.OC\"]","methods":"[]","has_code":false}