research
∙
06/15/2023
Stable Tomography for Structured Quantum States
The reconstruction of quantum states from experimental measurements, oft...
share
research
∙
03/13/2023
OTOV2: Automatic, Generic, User-Friendly
The existing model compression methods via structured pruning typically ...
research
∙
01/25/2023
A Provable Splitting Approach for Symmetric Nonnegative Matrix Factorization
The symmetric Nonnegative Matrix Factorization (NMF), a special but impo...
research
∙
12/23/2022
Principled and Efficient Transfer Learning of Deep Models via Neural Collapse
With the ever-growing model size and the limited availability of labeled...
research
∙
10/24/2022
Revisiting Sparse Convolutional Model for Visual Recognition
Despite strong empirical performance for image classification, deep neur...
research
∙
10/04/2022
Are All Losses Created Equal: A Neural Collapse Perspective
While cross entropy (CE) is the most commonly used loss to train deep ne...
research
∙
09/21/2022
A Validation Approach to Over-parameterized Matrix and Image Recovery
In this paper, we study the problem of recovering a low-rank matrix from...
research
∙
09/19/2022
Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold
When training overparameterized deep networks for classification tasks, ...
research
∙
09/09/2022
Sparsity-guided Network Design for Frame Interpolation
DNN-based frame interpolation, which generates intermediate frames from ...
research
∙
07/09/2022
Error Analysis of Tensor-Train Cross Approximation
Tensor train decomposition is widely used in machine learning and quantu...
research
∙
03/02/2022
On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Features
When training deep neural networks for classification tasks, an intrigui...
research
∙
02/28/2022
Robust Training under Label Noise by Over-parameterization
Recently, over-parameterized deep networks, with increasingly more netwo...
research
∙
09/23/2021
Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery
We study the robust recovery of a low-rank matrix from sparsely and gros...
research
∙
07/15/2021
Only Train Once: A One-Shot Neural Network Training And Pruning Framework
Structured pruning is a commonly used technique in deploying deep neural...
research
∙
05/06/2021
A Geometric Analysis of Neural Collapse with Unconstrained Features
We provide the first global optimization landscape analysis of Neural Co...
research
∙
03/18/2021
CDFI: Compression-Driven Network Design for Frame Interpolation
DNN-based frame interpolation–that generates the intermediate frames giv...
research
∙
03/01/2021
Convolutional Normalization: Improving Deep Convolutional Network Robustness and Training
Normalization techniques have become a basic component in modern convolu...
research
∙
06/16/2020
Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterization
Recent advances have shown that implicit bias of gradient descent on ove...
research
∙
06/11/2020
Recovery and Generalization in Over-Realized Dictionary Learning
In over two decades of research, the field of dictionary learning has ga...
research
∙
04/07/2020
Orthant Based Proximal Stochastic Gradient Method for ℓ_1-Regularized Optimization
Sparsity-inducing regularization problems are ubiquitous in machine lear...
research
∙
01/20/2020
Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications
The problem of finding the sparsest vector (direction) in a low dimensio...
research
∙
12/05/2019
Analysis of the Optimization Landscapes for Overcomplete Representation Learning
We study nonconvex optimization landscapes for learning overcomplete rep...
research
∙
12/03/2019
Viewpoint-Aware Loss with Angular Regularization for Person Re-Identification
Although great progress in supervised person re-identification (Re-ID) h...
research
∙
11/12/2019
Nonsmooth Optimization over Stiefel Manifold: Riemannian Subgradient Methods
Nonsmooth Riemannian optimization is a still under explored subfield of ...
research
∙
08/28/2019
A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution
We study the multi-channel sparse blind deconvolution (MCS-BD) problem, ...
research
∙
07/26/2019
Incremental Methods for Weakly Convex Optimization
We consider incremental algorithms for solving weakly convex optimizatio...
research
∙
04/22/2019
Provable Bregman-divergence based Methods for Nonconvex and Non-Lipschitz Problems
The (global) Lipschitz smoothness condition is crucial in establishing t...
research
∙
12/24/2018
Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms
Recent methods for learning a linear subspace from data corrupted by out...
research
∙
11/14/2018
Dropping Symmetry for Fast Symmetric Nonnegative Matrix Factorization
Symmetric nonnegative matrix factorization (NMF), a special but importan...
research
∙
11/07/2018
Global Optimality in Distributed Low-rank Matrix Factorization
We study the convergence of a variant of distributed gradient descent (D...
research
∙
09/24/2018
Nonconvex Robust Low-rank Matrix Recovery
In this paper we study the problem of recovering a low-rank matrix from ...
research
∙
05/13/2018
The Global Optimization Geometry of Shallow Linear Neural Networks
We examine the squared error loss landscape of shallow linear neural net...
research
∙
02/12/2018
Convergence Analysis of Alternating Nonconvex Projections
We consider the convergence properties for alternating projection algori...
research
∙
12/13/2017
ROAST: Rapid Orthogonal Approximate Slepian Transform
In this paper, we provide a Rapid Orthogonal Approximate Slepian Transfo...
research
∙
04/05/2017
