#### Filter Results:

- Full text PDF available (44)

#### Publication Year

2006

2018

- This year (12)
- Last 5 years (47)
- Last 10 years (67)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Method

Learn More

- Qiaoyang Ye, Beiyu Rong, Yudong Chen, Mazin Al-Shalash, Constantine Caramanis, Jeffrey G. Andrews
- IEEE Transactions on Wireless Communications
- 2013

For small cell technology to significantly increase the capacity of tower-based cellular networks, mobile users will need to be actively pushed onto the more lightly loaded tiers (corresponding to,â€¦ (More)

- Yudong Chen, Martin J. Wainwright
- ArXiv
- 2015

Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic forâ€¦ (More)

- Xinyang Yi, Dohyung Park, Yudong Chen, Constantine Caramanis
- NIPS
- 2016

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 standpoint this problemâ€¦ (More)

- Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
- ICML
- 2011

This paper considers the problem of clustering a partially observed unweighted graph â€“ i.e. one where for some node pairs we know there is an edge between them, for some others we know there is noâ€¦ (More)

- Yudong Chen, Ali Jalali, Sujay Sanghavi, Constantine Caramanis
- ISIT
- 2011

- Canyi Lu, Jiashi Feng, Yudong Chen, Wei Liu, Zhouchen Lin, Shuicheng Yan
- 2016 IEEE Conference on Computer Vision andâ€¦
- 2016

This paper studies the Tensor Robust Principal Component (TRPCA) problem which extends the known Robust PCA [4] to the tensor case. Our model is based on a new tensor Singular Value Decompositionâ€¦ (More)

- Yudong Chen, Sujay Sanghavi, Huan Xu
- NIPS
- 2012

We develop a new algorithm to cluster sparse unweighted graphs â€“ i.e. partition the nodes into disjoint clusters so that there is higher density within clusters, and low across clusters. By sparsityâ€¦ (More)

- Yudong Chen, Jiaming Xu
- Journal of Machine Learning Research
- 2016

We consider two closely related problems: planted clustering and submatrix localization. The planted clustering problem assumes that a random graph is generated based on some underlying clusters ofâ€¦ (More)

- Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi, Rachel Ward
- Journal of Machine Learning Research
- 2015

Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictiveâ€¦ (More)

- Yudong Chen, Constantine Caramanis
- ICML
- 2013

Many models for sparse regression typically assume that the covariates are known completely, and without noise. Particularly in high-dimensional applications, this is often not the case. Worse yet,â€¦ (More)