Segui
Qing Qu
Qing Qu
Assistant Professor, Dept. of EECS, University of Michigan
Email verificata su umich.edu - Home page
Titolo
Citata da
Citata da
Anno
A geometric analysis of phase retrieval
J Sun, Q Qu, J Wright
Foundations of Computational Mathematics 18 (5), 1131-1198, 2018
4822018
Complete dictionary recovery over the sphere I: Overview and the geometric picture
J Sun, Q Qu, J Wright
IEEE Transactions on Information Theory 63 (2), 853-884, 2016
2462016
When are nonconvex problems not scary?
J Sun, Q Qu, J Wright
arXiv preprint arXiv:1510.06096, 2015
1582015
Complete dictionary recovery using nonconvex optimization
J Sun, Q Qu, J Wright
International Conference on Machine Learning, 2351-2360, 2015
130*2015
Complete dictionary recovery over the sphere ii: Recovery by riemannian trust-region method
J Sun, Q Qu, J Wright
IEEE Transactions on Information Theory 63 (2), 885-914, 2016
1202016
Structured priors for sparse-representation-based hyperspectral image classification
X Sun, Q Qu, NM Nasrabadi, TD Tran
IEEE Geoscience and Remote Sensing Letters 11 (7), 1235-1239, 2013
1182013
Abundance estimation for bilinear mixture models via joint sparse and low-rank representation
Q Qu, NM Nasrabadi, TD Tran
IEEE Transactions on Geoscience and Remote Sensing 52 (7), 4404-4423, 2013
1062013
Finding a sparse vector in a subspace: Linear sparsity using alternating directions
Q Qu, J Sun, J Wright
Advances in Neural Information Processing Systems 27, 2014
1032014
Convolutional phase retrieval via gradient descent
Q Qu, Y Zhang, YC Eldar, J Wright
IEEE Transactions on Information Theory 66 (3), 1785-1821, 2019
43*2019
Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
X Li, S Chen, Z Deng, Q Qu, Z Zhu, AMC So
SIAM Journal on Optimization 31 (3), 1605–1634, 2021
37*2021
A nonconvex approach for exact and efficient multichannel sparse blind deconvolution
Q Qu, X Li, Z Zhu
Advances in Neural Information Processing Systems 32, 2019
30*2019
Geometric analysis of nonconvex optimization landscapes for overcomplete learning
Q Qu, Y Zhai, X Li, Y Zhang, Z Zhu
International Conference on Learning Representations 2020, 2019
28*2019
From symmetry to geometry: Tractable nonconvex problems
Y Zhang, Q Qu, J Wright
arXiv preprint arXiv:2007.06753, 2020
262020
Short-and-Sparse Deconvolution--A Geometric Approach
Y Lau, Q Qu, HW Kuo, P Zhou, Y Zhang, J Wright
International Conference on Learning Representations 2020, 2019
242019
Robust zero‐point attraction least mean square algorithm on near sparse system identification
J Jin, Q Qu, Y Gu
IET Signal Processing 7 (3), 210-218, 2013
242013
Subspace vertex pursuit: A fast and robust near-separable nonnegative matrix factorization method for hyperspectral unmixing
Q Qu, NM Nasrabadi, TD Tran
IEEE Journal of Selected Topics in Signal Processing 9 (6), 1142-1155, 2015
162015
A geometric analysis of neural collapse with unconstrained features
Z Zhu, T Ding, J Zhou, X Li, C You, J Sulam, Q Qu
Advances in Neural Information Processing Systems 34, 29820-29834, 2021
132021
Robust recovery via implicit bias of discrepant learning rates for double over-parameterization
C You, Z Zhu, Q Qu, Y Ma
Neural Information Processing Systems 2020, 2020
122020
Finding the sparsest vectors in a subspace: Theory, algorithms, and applications
Q Qu, Z Zhu, X Li, MC Tsakiris, J Wright, R Vidal
arXiv preprint arXiv:2001.06970, 2020
122020
An improved l0-LMS algorithm for sparse system identification
Q Qu, J Jin, YT Gu
电子与信息学报 33 (3), 604-609, 2011
92011
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20