no code implementations • 4 Jun 2023 • Hanbyul Lee, Rahul Mazumder, Qifan Song, Jean Honorio
Most of the existing works on provable guarantees for low-rank matrix completion algorithms rely on some unrealistic assumptions such that matrix entries are sampled randomly or the sampling pattern has a specific structure.
no code implementations • 3 Feb 2023 • Hanbyul Lee, Qifan Song, Jean Honorio
We analyze a practical algorithm for sparse PCA on incomplete and noisy data under a general non-random sampling scheme.
no code implementations • 30 May 2022 • Hanbyul Lee, Qifan Song, Jean Honorio
We study a practical algorithm for sparse principal component analysis (PCA) of incomplete and noisy data.
no code implementations • 17 Feb 2021 • Hanbyul Lee, Kevin Bello, Jean Honorio
Inference is a main task in structured prediction and it is naturally modeled with a graph.