Search Results for author: Hanbyul Lee

Found 4 papers, 0 papers with code

Matrix Completion from General Deterministic Sampling Patterns

no code implementations4 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.

Low-Rank Matrix Completion

Support Recovery in Sparse PCA with Non-Random Missing Data

no code implementations3 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.

Support Recovery in Sparse PCA with Incomplete Data

no code implementations30 May 2022 Hanbyul Lee, Qifan Song, Jean Honorio

We study a practical algorithm for sparse principal component analysis (PCA) of incomplete and noisy data.

Cannot find the paper you are looking for? You can Submit a new open access paper.