Qing Qu

Orcid: 0000-0001-9136-558X

Affiliations:
  • University of Michigan, Department of Electrical Engineering and Computer Science, Ann Arbor, MI, USA
  • New York University, Center for Data Science, NY, USA
  • Columbia University, Data Science Institute, New York, NY, USA (PhD 2018)
  • Microsoft Research, USA (2016)
  • United States Army Research Laboratory, MD, USA (2012 - 2013)
  • Johns Hopkins University, Department of Electrical and Computer Engineering, Baltimore, MD, USA (former)
  • Tsinghua University, Department of Electrical and Computer Engineering, Beijing, China (former)


According to our database1, Qing Qu authored at least 44 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Decoupled Data Consistency with Diffusion Purification for Image Restoration.
CoRR, 2024

Analysis of Deep Image Prior and Exploiting Self-Guidance for Image Reconstruction.
CoRR, 2024

2023
Improving Efficiency of Diffusion Models via Multi-Stage Framework and Tailored Multi-Decoder Architectures.
CoRR, 2023

Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning Dynamics.
CoRR, 2023

Understanding Deep Representation Learning via Layerwise Feature Compression and Discrimination.
CoRR, 2023

Generalized Neural Collapse for a Large Number of Classes.
CoRR, 2023

Investigating the Catastrophic Forgetting in Multimodal Large Language Models.
CoRR, 2023

The Law of Parsimony in Gradient Descent for Learning Deep Linear Networks.
CoRR, 2023

Robust Self-Guided Deep Image Prior.
Proceedings of the IEEE International Conference on Acoustics, 2023

Robust Deep Image Recovery from Sparsely Corrupted and Sub-Sampled Measurements.
Proceedings of the 9th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2023

2022
Principled and Efficient Transfer Learning of Deep Models via Neural Collapse.
CoRR, 2022

Are All Losses Created Equal: A Neural Collapse Perspective.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features.
Proceedings of the International Conference on Machine Learning, 2022

Robust Training under Label Noise by Over-parameterization.
Proceedings of the International Conference on Machine Learning, 2022

2021
Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods.
SIAM J. Optim., 2021

A Geometric Analysis of Neural Collapse with Unconstrained Features.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Convolutional Normalization: Improving Deep Convolutional Network Robustness and Training.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Convolutional Phase Retrieval via Gradient Descent.
IEEE Trans. Inf. Theory, 2020

Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent.
SIAM J. Imaging Sci., 2020

From Symmetry to Geometry: Tractable Nonconvex Problems.
CoRR, 2020

Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications.
CoRR, 2020

Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Geometric Analysis of Nonconvex Optimization Landscapes for Overcomplete Learning.
Proceedings of the 8th International Conference on Learning Representations, 2020

Short and Sparse Deconvolution - A Geometric Approach.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
Analysis of the Optimization Landscapes for Overcomplete Representation Learning.
CoRR, 2019

Nonsmooth Optimization over Stiefel Manifold: Riemannian Subgradient Methods.
CoRR, 2019

A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Exact and Efficient Multi-Channel Sparse Blind Deconvolution - A Nonconvex Approach.
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018
A Geometric Analysis of Phase Retrieval.
Found. Comput. Math., 2018

2017
Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method.
IEEE Trans. Inf. Theory, 2017

Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture.
IEEE Trans. Inf. Theory, 2017

Convolutional Phase Retrieval.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions.
IEEE Trans. Inf. Theory, 2016

2015
Subspace Vertex Pursuit: A Fast and Robust Near-Separable Nonnegative Matrix Factorization Method for Hyperspectral Unmixing.
IEEE J. Sel. Top. Signal Process., 2015

When Are Nonconvex Problems Not Scary?
CoRR, 2015

Complete Dictionary Recovery over the Sphere.
CoRR, 2015

Complete Dictionary Recovery Using Nonconvex Optimization.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Abundance Estimation for Bilinear Mixture Models via Joint Sparse and Low-Rank Representation.
IEEE Trans. Geosci. Remote. Sens., 2014

Structured Priors for Sparse-Representation-Based Hyperspectral Image Classification.
IEEE Geosci. Remote. Sens. Lett., 2014

Subspace vertex pursuit for separable non-negative matrix factorization in hyperspectral unmixing.
Proceedings of the IEEE International Conference on Acoustics, 2014

2013
Low rank representation for bilinear abundance estimation problem.
Proceedings of the 5th Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing, 2013

Hyperspectral abundance estimation for the generalized bilinear model with joint sparsity constraint.
Proceedings of the IEEE International Conference on Acoustics, 2013


  Loading...