67 citations · 166 across the 20 of their papers we have counts for
6 papers · 1 filter
Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning
Jicong Fan, Yuqian Zhang, Madeleine Udell
This paper develops new methods to recover the missing entries of a high-rank or even full-rank matrix when the intrinsic dimension of the data is low compared to the ambient dimen…
Analysis of the Optimization Landscapes for Overcomplete Representation Learning
Qing Qu, Yuexiang Zhai, Xiao Li +2
We study nonconvex optimization landscapes for learning overcomplete representations, including learning (i) sparsely used overcomplete dictionaries and (ii) convolutional dictiona…
Short-and-Sparse Deconvolution -- A Geometric Approach
Yenson Lau, Qing Qu, Han-Wen Kuo +3
Short-and-sparse deconvolution (SaSD) is the problem of extracting localized, recurring motifs in signals with spatial or temporal structure. Variants of this problem arise in appl…
Global Convergence of Least Squares EM for Demixing Two Log-Concave Densities
Wei Qian, Yuqian Zhang, Yudong Chen
This work studies the location estimation problem for a mixture of two rotation invariant log-concave densities. We demonstrate that Least Squares EM, a variant of the EM algorithm…
On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution
Yuqian Zhang, Yenson Lau, Han-Wen Kuo +3
Blind deconvolution is the problem of recovering a convolutional kernel and an activation signal from their convolution $\boldsymbol y = \boldsy…
Geometry and Symmetry in Short-and-Sparse Deconvolution
Han-Wen Kuo, Yenson Lau, Yuqian Zhang +1
We study the problem of recovering a short signal and a sparse signal from their convolution. We propose…