
Lowrank matrix recovery with nonquadratic loss: projected gradient method and regularity projection oracle
Existing results for lowrank matrix recovery largely focus on quadratic...
read it

RiskSensitive Reinforcement Learning: NearOptimal RiskSample Tradeoff in Regret
We study risksensitive reinforcement learning in episodic Markov decisi...
read it

Random Features for Kernel Approximation: A Survey in Algorithms, Theory, and Beyond
Random features is one of the most soughtafter research topics in stati...
read it

Highdimensional, multiscale online changepoint detection
We introduce a new method for highdimensional, online changepoint detec...
read it

Learning ZeroSum SimultaneousMove Markov Games Using Function Approximation and Correlated Equilibrium
We develop provably efficient reinforcement learning algorithms for two...
read it

Structures of Spurious Local Minima in kmeans
kmeans clustering is a fundamental problem in unsupervised learning. Th...
read it

Random Fourier Features via Fast Surrogate Leverage Weighted Sampling
In this paper, we propose a fast surrogate leverage weighted sampling st...
read it

Factor GroupSparse Regularization for Efficient LowRank Matrix Recovery
This paper develops a new class of nonconvex regularizers for lowrank m...
read it

Global Convergence of Least Squares EM for Demixing Two LogConcave Densities
This work studies the location estimation problem for a mixture of two r...
read it

Clustering DegreeCorrected Stochastic Block Model with Outliers
For the degree corrected stochastic block model in the presence of arbit...
read it

Lowrank matrix recovery with composite optimization: good conditioning and rapid convergence
The task of recovering a lowrank matrix from its noisy linear measureme...
read it

Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly
We study the statistical performance of semidefinite programming (SDP) r...
read it

Convex Relaxation Methods for Community Detection
This paper surveys recent theoretical advances in convex optimization ap...
read it

Defending Against Saddle Point Attack in ByzantineRobust Distributed Learning
In this paper, we study robust largescale distributed learning in the p...
read it

Tensor Robust Principal Component Analysis with A New Tensor Nuclear Norm
In this paper, we consider the Tensor Robust Principal Component Analysi...
read it

The Leaveoneout Approach for Matrix Completion: Primal and Dual Analysis
In this paper, we introduce a powerful technique, LeaveOneOut, to the ...
read it

Hidden Integrality of SDP Relaxation for SubGaussian Mixture Models
We consider the problem of estimating the discrete clustering structures...
read it

ByzantineRobust Distributed Learning: Towards Optimal Statistical Rates
In largescale distributed learning, security issues have become increas...
read it

Harnessing Structures in Big Data via Guaranteed LowRank Matrix Estimation
Lowrank modeling plays a pivotal role in signal processing and machine ...
read it

Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted LowRank Tensors via Convex Optimization
This paper studies the Tensor Robust Principal Component (TRPCA) problem...
read it

Exponential error rates of SDP for block models: Beyond Grothendieck's inequality
In this paper we consider the cluster estimation problem under the Stoch...
read it

Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
We consider the problem of distributed statistical machine learning in a...
read it

Fast Algorithms for Robust PCA via Gradient Descent
We consider the problem of Robust PCA in the fully and partially observe...
read it

Convexified Modularity Maximization for Degreecorrected Stochastic Block Models
The stochastic block model (SBM) is a popular framework for studying com...
read it

Fast lowrank estimation by projected gradient descent: General statistical and algorithmic guarantees
Optimization problems with rank constraints arise in many applications, ...
read it

StatisticalComputational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
We consider two closely related problems: planted clustering and submatr...
read it

A Convex Formulation for Mixed Regression with Two Components: Minimax Optimal Rates
We consider the mixed regression problem with two components, under adve...
read it

IncoherenceOptimal Matrix Completion
This paper considers the matrix completion problem. We show that it is n...
read it

Completing Any Lowrank Matrix, Provably
Matrix completion, i.e., the exact and provable recovery of a lowrank m...
read it

Detecting Overlapping Temporal Community Structure in TimeEvolving Networks
We present a principled approach for detecting overlapping temporal comm...
read it

Breaking the Small Cluster Barrier of Graph Clustering
This paper investigates graph clustering in the planted cluster model in...
read it

Robust High Dimensional Sparse Regression and Matching Pursuit
We consider high dimensional sparse regression, and develop strategies a...
read it

Improved Graph Clustering
Graph clustering involves the task of dividing nodes into clusters, so t...
read it

Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unwe...
read it

Lowrank Matrix Recovery from Errors and Erasures
This paper considers the recovery of a lowrank matrix from an observed ...
read it

Matrix completion with column manipulation: Nearoptimal samplerobustnessrank tradeoffs
This paper considers the problem of matrix completion when some number o...
read it