4.5 Article

Robust Grouped Variable Selection Using Distributionally Robust Optimization

Journal

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 194, Issue 3, Pages 1042-1071

Publisher

SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-022-02065-4

Keywords

Regression; Classification; Grouped LASSO; Wasserstein metric; Spectral clustering

Funding

  1. NSF [DMS-1664644, CNS-1645681, IIS-1914792]
  2. ONR [N00014-19-1-2571, N00014-21-1-2844]
  3. NIH [R01 GM135930, UL54 TR004130]
  4. DOE [DE-AR-0001282, NETL-EE0009696]
  5. Boston University Kilachand Fund for Integrated Life Science and Engineering

Ask authors/readers for more resources

This paper proposes a distributionally robust optimization formulation with a Wasserstein-based uncertainty set for selecting grouped variables in linear regression and classification problems. The resulting model offers robustness explanations for grouped least absolute shrinkage and selection operator algorithms and highlights the connection between robustness and regularization. The authors prove probabilistic bounds on the out-of-sample loss and the estimation bias, and establish the grouping effect of their estimator. They also propose a method using the spectral clustering algorithm for variable grouping, making their approach applicable without prior knowledge of the grouping structure.
We propose a distributionally robust optimization formulation with a Wasserstein-based uncertainty set for selecting grouped variables under perturbations on the data for both linear regression and classification problems. The resulting model offers robustness explanations for grouped least absolute shrinkage and selection operator algorithms and highlights the connection between robustness and regularization. We prove probabilistic bounds on the out-of-sample loss and the estimation bias, and establish the grouping effect of our estimator, showing that coefficients in the same group converge to the same value as the sample correlation between covariates approaches 1. Based on this result, we propose to use the spectral clustering algorithm with the Gaussian similarity function to perform grouping on the predictors, which makes our approach applicable without knowing the grouping structure a priori. We compare our approach to an array of alternatives and provide extensive numerical results on both synthetic data and a real large dataset of surgery-related medical records, showing that our formulation produces an interpretable and parsimonious model that encourages sparsity at a group level and is able to achieve better prediction and estimation performance in the presence of outliers.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available