
A Geometric Analysis of Neural Collapse with Unconstrained Features
We provide the first global optimization landscape analysis of Neural Co...
read it

Convolutional Normalization: Improving Deep Convolutional Network Robustness and Training
Normalization techniques have become a basic component in modern convolu...
read it

From Symmetry to Geometry: Tractable Nonconvex Problems
As science and engineering have become increasingly datadriven, the rol...
read it

Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Overparameterization
Recent advances have shown that implicit bias of gradient descent on ove...
read it

Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications
The problem of finding the sparsest vector (direction) in a low dimensio...
read it

Analysis of the Optimization Landscapes for Overcomplete Representation Learning
We study nonconvex optimization landscapes for learning overcomplete rep...
read it

Nonsmooth Optimization over Stiefel Manifold: Riemannian Subgradient Methods
Nonsmooth Riemannian optimization is a still under explored subfield of ...
read it

ShortandSparse Deconvolution  A Geometric Approach
Shortandsparse deconvolution (SaSD) is the problem of extracting local...
read it

A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution
We study the multichannel sparse blind deconvolution (MCSBD) problem, ...
read it

Convolutional Phase Retrieval via Gradient Descent
We study the convolutional phase retrieval problem, which considers reco...
read it

A Geometric Analysis of Phase Retrieval
Can we recover a complex signal from its Fourier magnitudes? More genera...
read it

Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trustregion Method
We consider the problem of recovering a complete (i.e., square and inver...
read it

Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picture
We consider the problem of recovering a complete (i.e., square and inver...
read it

When Are Nonconvex Problems Not Scary?
In this note, we focus on smooth nonconvex optimization problems that ob...
read it

Complete Dictionary Recovery over the Sphere
We consider the problem of recovering a complete (i.e., square and inver...
read it

Finding a sparse vector in a subspace: Linear sparsity using alternating directions
Is it possible to find the sparsest vector (direction) in a generic subs...
read it

Structured Priors for SparseRepresentationBased Hyperspectral Image Classification
Pixelwise classification, where each pixel is assigned to a predefined ...
read it
Qing Qu
is this you? claim profile