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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
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.
- Query-efficient model evaluation using cached responses