Nonconvex optimization meets low-rank matrix factorization: An overview
Substantial progress has been made recently on develo** provably accurate and efficient
algorithms for low-rank matrix factorization via nonconvex optimization. While conventional …
algorithms for low-rank matrix factorization via nonconvex optimization. While conventional …
Cognitive internet of things: a new paradigm beyond connection
Current research on Internet of Things (IoT) mainly focuses on how to enable general
objects to see, hear, and smell the physical world for themselves, and make them connected …
objects to see, hear, and smell the physical world for themselves, and make them connected …
Data poisoning attacks on factorization-based collaborative filtering
Recommendation and collaborative filtering systems are important in modern information
and e-commerce applications. As these systems are becoming increasingly popular in …
and e-commerce applications. As these systems are becoming increasingly popular in …
Matrix factorization techniques in machine learning, signal processing, and statistics
Compressed sensing is an alternative to Shannon/Nyquist sampling for acquiring sparse or
compressible signals. Sparse coding represents a signal as a sparse linear combination of …
compressible signals. Sparse coding represents a signal as a sparse linear combination of …
Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees
Optimization problems with rank constraints arise in many applications, including matrix
regression, structured PCA, matrix completion and matrix decomposition problems. An …
regression, structured PCA, matrix completion and matrix decomposition problems. An …
Fast algorithms for robust PCA via gradient descent
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 …
corruptions, this is the well-known matrix completion problem. From a statistical standpoint …
Reliable propagation-correction modulation for video object segmentation
Error propagation is a general but crucial problem in online semi-supervised video object
segmentation. We aim to suppress error propagation through a correction mechanism with …
segmentation. We aim to suppress error propagation through a correction mechanism with …
Spectral compressed sensing via structured matrix completion
The paper studies the problem of recovering a spectrally sparse object from a small number
of time domain samples. Specifically, the object of interest with ambient dimension n is …
of time domain samples. Specifically, the object of interest with ambient dimension n is …
Noisy matrix completion: Understanding statistical guarantees for convex relaxation via nonconvex optimization
This paper studies noisy low-rank matrix completion: given partial and noisy entries of a
large low-rank matrix, the goal is to estimate the underlying matrix faithfully and efficiently …
large low-rank matrix, the goal is to estimate the underlying matrix faithfully and efficiently …
Incoherence-optimal matrix completion
Y Chen - IEEE Transactions on Information Theory, 2015 - ieeexplore.ieee.org
This paper considers the matrix completion problem. We show that it is not necessary to
assume joint incoherence, which is a standard but unintuitive and restrictive condition that is …
assume joint incoherence, which is a standard but unintuitive and restrictive condition that is …