134 citations · 370 across the 8 of their papers we have counts for
9 papers
Provable quantum state tomography via non-convex methods
Anastasios Kyrillidis, Amir Kalev, Dohuyng Park +3
With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe…
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis +1
We consider the non-square matrix sensing problem, under restricted isometry property (RIP) assumptions. We focus on the non-convex formulation, where any rank- matrix $X \in \m…
Finding Low-Rank Solutions via Non-Convex Matrix Factorization, Efficiently and Provably
Dohyung Park, Anastasios Kyrillidis, Constantine Caramanis +1
A rank- matrix can be written as a product , where and . One could explo…
Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems
Dohyung Park, Anastasios Kyrillidis, Srinadh Bhojanapalli +2
We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce…
Fast Algorithms for Robust PCA via Gradient Descent
Xinyang Yi, Dohyung Park, Yudong Chen +1
We consider the problem of Robust PCA in the fully and partially observed settings. Without corruptions, this is the well-known matrix completion problem. From a statistical standp…
Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons
Dohyung Park, Joe Neeman, Jin Zhang +2
In this paper we consider the collaborative ranking setting: a pool of users each provides a small number of pairwise preferences between possible items; from these we need to…
Greedy Subspace Clustering
Dohyung Park, Constantine Caramanis, Sujay Sanghavi
We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first i…
Can One Achieve Multiuser Diversity in Uplink Multi-Cell Networks?
Won-Yong Shin, Dohyung Park, Bang Chul Jung
We introduce a distributed opportunistic scheduling (DOS) strategy, based on two pre-determined thresholds, for uplink -cell networks with time-invariant channel coefficients. E…
Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Wireless Multi-cell Uplink Networks
Bang Chul Jung, Dohyung Park, Won-Yong Shin
We introduce an opportunistic interference mitigation (OIM) protocol, where a user scheduling strategy is utilized in -cell uplink networks with time-invariant channel coefficie…