Variable Clustering via Distributionally Robust Nodewise Regression
About
We study a multi-factor block model for variable clustering and connect it to regularized subspace clustering through a distributionally robust version of nodewise regression. To solve the latter problem, we derive a convex relaxation, provide a data-driven approach for selecting the size of the robust region, and develop an ADMM algorithm for efficient implementation. We validate our method in extensive numerical studies and demonstrate its superior performance.
Kaizheng Wang, Xiao Xu, Xun Yu Zhou• 2022
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Variable Clustering | Simulation Data | Average AMI96 | 19 | |
| Face Clustering | Extended Yale-B | Mean AMI0.576 | 10 | |
| Portfolio Optimization | S&P 500 stocks Minimum Variance Portfolios | VAMI1.07e+4 | 10 | |
| Subspace Clustering | Extended Yale B (3 standard splits + 20 random trials) | Mean AMI0.58 | 10 |
Showing 4 of 4 rows