# Beyond Symmetry: Best Submatrix Selection for the Sparse Truncated SVD

arXiv: https://arxiv.org/abs/2105.03179 · HTML: https://mlsanity.com/paper/2105.03179/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 May 2021.

## Built on by (most cited first, 6 of 6)

- [Variable Selection for Kernel Two-Sample Tests](https://mlsanity.com/paper/2302.07415/) (2023)
- [Sparse PCA With Multiple Components](https://mlsanity.com/paper/2209.14790/) (2022)
- [On the Partial Convexification for Low-Rank Spectral Optimization: Rank Bounds and Algorithms](https://mlsanity.com/paper/2305.07638/) (2023)
- [A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering](https://mlsanity.com/paper/2403.11351/) (2024)
- [Exact and Heuristic Algorithms for Constrained Biclustering](https://mlsanity.com/paper/2508.05493/) (2025)
- [Variable Selection for Feature-Based Newsvendor](https://mlsanity.com/paper/2609.01544/) (2026)

## Abstract (arXiv)

Truncated singular value decomposition (SVD), also known as the best low-rank matrix approximation, has been successfully applied to many domains such as biology, healthcare, and others, where high-dimensional datasets are prevalent. To enhance the interpretability of the truncated SVD, sparse SVD (SSVD) is introduced to select a few rows and columns of the original matrix along with the low rank approximation. Different from the literature, this paper presents a novel SSVD formulation that can select the best submatrix precisely up to a given size to maximize its truncated Ky Fan norm. The fact that the SSVD problem is NP-hard motivates us to study effective algorithms with provable performance guarantees. To do so, we first reformulate SSVD as a mixed-integer semidefinite program, which can be solved exactly for small- or medium-sized instances by a customized branch and cut algorithm with closed-form cuts, and is extremely useful to evaluate the quality of approximation algorithms. We next develop three selection algorithms based on different selection criteria and two searching algorithms -- greedy and local search. We prove the approximation ratios for all the approximation algorithms and show that all the ratios are tight, i.e., we demonstrate that these approximation ratios are unimprovable. Finally, our numerical study demonstrates the high solution quality and computational efficiency of the proposed algorithms.