
Optimal Spectral Recovery of a Planted Vector in a Subspace
Recovering a planted vector v in an ndimensional random subspace of ℝ^N...
read it

Random Graph Matching with Improved Noise Robustness
Graph matching, also known as network alignment, refers to finding a bij...
read it

Learning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments
In applications such as rank aggregation, mixture models for permutation...
read it

Optimal Rates for Estimation of TwoDimensional Totally Positive Distributions
We study minimax estimation of twodimensional totally positive distribu...
read it

Spectral Graph Matching and Regularized Quadratic Relaxations II: ErdősRényi Graphs and Universality
We analyze a new spectral graph matching algorithm, GRAph Matching by Pa...
read it

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
Graph matching aims at finding the vertex correspondence between two unl...
read it

Estimation of Monge Matrices
Monge matrices and their permuted versions known as preMonge matrices n...
read it

Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations
Many applications, including rank aggregation, crowdlabeling, and graph...
read it

Breaking the 1/√(n) Barrier: Faster Rates for Permutationbased Models in Polynomial Time
Many applications, including rank aggregation and crowdlabeling, can be...
read it

Minimax Rates and Efficient Algorithms for Noisy Sorting
There has been a recent surge of interest in studying permutationbased ...
read it

Worstcase vs Averagecase Design for Estimation from Fixed Pairwise Comparisons
Pairwise comparison data arises in many domains, including tournament ra...
read it

Optimal Rates of Statistical Seriation
Given a matrix the seriation problem consists in permuting its rows in s...
read it
Cheng Mao
is this you? claim profile