Variable Clustering via Distributionally Robust Nodewise Regression
Kaizheng Wang, Xiao Xu, Xun Yu Zhou
2026Year
2Citations
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Distributionally Robust Linear Regression with Block Lewis WeightsNaren Sarayu Manoj, Kumar Kshitij PatelICLR 2026
- Coordinate Linear Variance Reduction for Generalized Linear ProgrammingChaobing Song, Cheuk Yin Lin, Stephen J. Wright, Jelena DiakonikolasNeurIPS 2022 · 15 citations
- Finding a latent k-simplex in O* (k · nnz(data)) time via Subset SmoothingChiranjib Bhattacharyya, Ravindran KannanSODA 2020 · 1 citation
- Robust Consensus Anchor Learning for Efficient Multi-view Subspace ClusteringYalan Qin, Nan Pu, Guorui Feng, Nicu SebeICML 2025
- Constrained Robust Submodular PartitioningShengjie Wang, Tianyi Zhou, Chandrashekhar Lavania, Jeff A. BilmesNeurIPS 2021 · 6 citations
