GAME is a convex estimator using overlapping nuclear-norm penalties on subgroup submatrices for low-rank matrix completion with known overlapping groups, providing finite-sample guarantees on reconstruction error and subgroup subspace recovery.
and Bühlmann, Peter , title =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
ClusterChirp is a freely available web tool for scalable interactive visualization, hierarchical clustering, and natural-language-guided analysis of high-dimensional omics datasets.
A review consolidating zero-handling methods for compositional count data, critiquing log-ratio assumptions, and comparing imputation strategies adapted to discrete zero-inflated counts.
citing papers explorer
-
Group-Aware Matrix Estimation and Latent Subspace Recovery
GAME is a convex estimator using overlapping nuclear-norm penalties on subgroup submatrices for low-rank matrix completion with known overlapping groups, providing finite-sample guarantees on reconstruction error and subgroup subspace recovery.
-
ClusterChirp: Scalable Interactive Exploration of Omics Data with Natural Language-Guided Analysis
ClusterChirp is a freely available web tool for scalable interactive visualization, hierarchical clustering, and natural-language-guided analysis of high-dimensional omics datasets.
-
A critical comparison of handling zeros in high-dimensional compositional count data
A review consolidating zero-handling methods for compositional count data, critiquing log-ratio assumptions, and comparing imputation strategies adapted to discrete zero-inflated counts.