Asymptotic Theory for Graphical SLOPE: Precision Estimation and Pattern Convergence

2026-04-14

AI Summary

This study addresses the poor performance of precision matrix estimation in high-dimensional graphical models when edge weights exhibit clustering structures and data are heavy-tailed. To overcome this limitation, the authors propose Graphical SLOPE, a method that employs SLOPE regularization to simultaneously recover sparsity and cluster edges with similar strengths. For the first time, they establish asymptotic theory for estimation error and pattern recovery under both Gaussian and elliptical distributions, elucidating its clustering selection mechanism. Furthermore, they introduce TSLOPE, which integrates a multivariate t-loss function to robustly handle heavy-tailed data. Theoretical analysis and empirical experiments demonstrate that Graphical SLOPE yields more accurate estimates under structured edge patterns, while TSLOPE substantially outperforms conventional Gaussian-based approaches and effectively identifies economically meaningful dependency clusters.

Technology Category

• Machine Learning: Graph-based Machine Learning
• Reasoning under Uncertainty: Graphical Models
• Data Mining & Knowledge Management: Graph Mining, Social Network Analysis & Community

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Web Mining and Content Analysis: Robustness and generalizability of Web mining methods
• Semantics and Knowledge: Scalable techniques for the creation, curation, publication, maintenance, and consumption of large, Web-based, structured, reusable, knowledge graphs and ontologies

Abstract

This paper studies Graphical SLOPE for precision matrix estimation, with emphasis on its ability to recover both sparsity and clusters of edges with equal or similar strength. In a fixed-dimensional regime, we establish that the root-$n$ scaled estimation error converges to the unique minimizer of a strictly convex optimization problem defined through the directional derivative of the SLOPE penalty. We also establish convergence of the induced SLOPE pattern, thereby obtaining an asymptotic characterization of the clustering structure selected by the estimator. A comparison with GLASSO shows that the grouping property of SLOPE can substantially improve estimation accuracy when the precision matrix exhibits structured edge patterns. To assess the effect of departures from Gaussianity, we then analyze Gaussian-loss precision matrix estimation under elliptical distributions. In this setting, we derive the limiting distribution and quantify the inflation in variability induced by heavy tails relative to the Gaussian benchmark. We also study TSLOPE, based on the multivariate $t$-loss, and derive its limiting distribution. The results show that TSLOPE offers clear advantages over GSLOPE under heavy-tailed data-generating mechanisms. Simulation evidence suggests that these qualitative conclusions persist in high-dimensional settings, and an empirical application shows that SLOPE-based estimators, especially TSLOPE, can uncover economically meaningful clustered dependence structures.

Problem

• precision matrix estimation
• sparsity
• edge clustering
• non-Gaussian data
• heavy-tailed distributions

Innovation

• Graphical SLOPE
• precision matrix estimation
• pattern convergence
• heavy-tailed distributions
• TSLOPE