Sign inGet started
Paper · arXiv

Group-Aware Matrix Estimation and Latent Subspace Recovery

Modern matrix completion problems often involve heterogeneous data whose rows simultaneously belong to many meta-categories, such as demographic and age groups in recommendation systems, or region and recording session labels in neural electrophysiological experiments. Standard low-rank estimators impose a single global latent geometry, which can recover average structure but may smooth away subgroup-specific variation, especially when observations are unevenly distributed across groups. We introduce Group-Aware Matrix Estimation (GAME), a convex estimator for overlapping subgroup-wise low-rank matrix estimation. GAME regularizes category-specific submatrices through overlapping nuclear-n...

AuthorsHamza Golubovic, Matthew Shen, Genevera I. Allen et al.
Primary categorystat.ML
Published19 May 2026
Last updated at source19 May 2026
stat.MLcs.LGstat.APstat.ME
Embed this entry
<iframe src="https://silytics.si/embed/item/8e360ce8-8ed3-400c-8b27-98f5cafd271b" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.