research
∙
05/22/2023
Semi-Supervised Causal Inference: Generalizable and Double Robust Inference for Average Treatment Effects under Selection Bias with Decaying Overlap
Average treatment effect (ATE) estimation is an essential problem in the...
share
research
∙
01/13/2022
A Geometric Approach to k-means
k-means clustering is a fundamental problem in various disciplines. This...
research
∙
11/12/2021
Dynamic treatment effects: high-dimensional inference under model misspecification
This paper considers the inference for heterogeneous treatment effects i...
research
∙
10/10/2021
High-dimensional Inference for Dynamic Treatment Effects
This paper proposes a confidence interval construction for heterogeneous...
research
∙
06/14/2021
Unique sparse decomposition of low rank matrices
The problem of finding the unique low dimensional decomposition of a giv...
research
∙
04/14/2021
Double Robust Semi-Supervised Inference for the Mean: Selection Bias under MAR Labeling with Decaying Overlap
Semi-supervised (SS) inference has received much attention in recent yea...
research
∙
08/31/2020
Low-rank matrix recovery with non-quadratic loss: projected gradient method and regularity projection oracle
Existing results for low-rank matrix recovery largely focus on quadratic...
research
∙
07/14/2020
From Symmetry to Geometry: Tractable Nonconvex Problems
As science and engineering have become increasingly data-driven, the rol...
research
∙
02/16/2020
Structures of Spurious Local Minima in k-means
k-means clustering is a fundamental problem in unsupervised learning. Th...
research
∙
12/15/2019
Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning
This paper develops new methods to recover the missing entries of a high...
research
∙
12/05/2019
Analysis of the Optimization Landscapes for Overcomplete Representation Learning
We study nonconvex optimization landscapes for learning overcomplete rep...
research
∙
08/28/2019
Short-and-Sparse Deconvolution -- A Geometric Approach
Short-and-sparse deconvolution (SaSD) is the problem of extracting local...
research
∙
06/16/2019
Global Convergence of Least Squares EM for Demixing Two Log-Concave Densities
This work studies the location estimation problem for a mixture of two r...
research
∙
02/02/2019
High-dimensional semi-supervised learning: in search for optimal inference of the mean
We provide a high-dimensional semi-supervised inference framework focuse...
research
∙
01/07/2019
On the Global Geometry of Sphere-Constrained Sparse Blind Deconvolution
Blind deconvolution is the problem of recovering a convolutional kernel ...
research
∙
01/02/2019
Geometry and Symmetry in Short-and-Sparse Deconvolution
We study the Short-and-Sparse (SaS) deconvolution problem of recovering ...
research
∙
06/01/2018
Structured Local Optima in Sparse Blind Deconvolution
Blind deconvolution is a ubiquitous problem of recovering two unknown si...
research
∙
12/03/2017
Convolutional Phase Retrieval via Gradient Descent
We study the convolutional phase retrieval problem, which considers reco...
research
∙
03/29/2014
Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods
Recovering matrices from compressive and grossly corrupted observations ...
research
∙
07/04/2013
Toward Guaranteed Illumination Models for Non-Convex Objects
Illumination variation remains a central challenge in object detection a...
research
∙
11/05/2012
Efficient Point-to-Subspace Query in â„“^1: Theory and Applications in Computer Vision
Motivated by vision tasks such as robust face and object recognition, we...
research
∙
08/02/2012
