Adaptive Regularization via Extreme Value Distributions for Gaussian Graphical Models
基于极值分布的高斯图模型自适应正则化
Edge selection in Gaussian graphical models is fundamentally a variable selection problem where pairwise relationships determine construct validity and variable importance in psychological networks. In psychology, network estimation relies predominantly on \(\ell_1\) regularization where uniform shrinkage systematically underestimates edge and centrality parameters. Alternative penalties overcome this bias but rely on fixed hyperparameters that do not adapt to the signal in…