Cheng Mao | DeepAI

DeepAI AI Chat

Featured Co-authors

Martin J. Wainwright
102 publications
Jiaming Xu
63 publications
Yihong Wu
60 publications
Philippe Rigollet
46 publications
Nicolas Flammarion
44 publications
Alexander S. Wein
33 publications
Ashwin Pananjady
23 publications
Vidya Muthukumar
23 publications
Zhou Fan
22 publications
Elina Robeva
15 publications
Jonathan Weed
13 publications

∙ 04/17/2023

Detection of Dense Subhypergraphs by Low-Degree Polynomials

Detection of a planted dense subgraph in a random graph is a fundamental...

0 Abhishek Dhawan, et al. ∙

∙ 02/20/2023

Sharp analysis of EM for learning mixtures of pairwise differences

We consider a symmetric mixture of linear regressions with random sample...

0 Abhishek Dhawan, et al. ∙

∙ 02/13/2023

Detection-Recovery Gap for Planted Dense Cycles

Planted dense cycles are a type of latent structure that appears in many...

0 Cheng Mao, et al. ∙

∙ 09/25/2022

Random graph matching at Otter's threshold via counting chandeliers

We propose an efficient algorithm for graph matching based on similarity...

0 Cheng Mao, et al. ∙

∙ 10/22/2021

Testing network correlation efficiently via counting trees

We propose a new procedure for testing whether two networks are edge-cor...

0 Cheng Mao, et al. ∙

∙ 10/11/2021

Exact Matching of Random Graphs with Constant Correlation

This paper deals with the problem of graph matching or network alignment...

0 Cheng Mao, et al. ∙

∙ 05/31/2021

Optimal Spectral Recovery of a Planted Vector in a Subspace

Recovering a planted vector v in an n-dimensional random subspace of ℝ^N...

0 Cheng Mao, et al. ∙

∙ 01/28/2021

Random Graph Matching with Improved Noise Robustness

Graph matching, also known as network alignment, refers to finding a bij...

0 Cheng Mao, et al. ∙

∙ 09/14/2020

Learning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments

In applications such as rank aggregation, mixture models for permutation...

0 Cheng Mao, et al. ∙

∙ 06/13/2020

Optimal Rates for Estimation of Two-Dimensional Totally Positive Distributions

We study minimax estimation of two-dimensional totally positive distribu...

0 Jan-Christian Hütter, et al. ∙

∙ 07/20/2019

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

We analyze a new spectral graph matching algorithm, GRAph Matching by Pa...

0 Zhou Fan, et al. ∙

∙ 07/20/2019

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model

Graph matching aims at finding the vertex correspondence between two unl...

0 Zhou Fan, et al. ∙

∙ 04/05/2019

Estimation of Monge Matrices

Monge matrices and their permuted versions known as pre-Monge matrices n...

0 Jan-Christian Hütter, et al. ∙

∙ 06/25/2018

Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations

Many applications, including rank aggregation, crowd-labeling, and graph...

0 Cheng Mao, et al. ∙

∙ 02/27/2018

Breaking the 1/√(n) Barrier: Faster Rates for Permutation-based Models in Polynomial Time

Many applications, including rank aggregation and crowd-labeling, can be...

0 Cheng Mao, et al. ∙

∙ 10/28/2017

Minimax Rates and Efficient Algorithms for Noisy Sorting

There has been a recent surge of interest in studying permutation-based ...

0 Cheng Mao, et al. ∙

∙ 07/19/2017

Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons

Pairwise comparison data arises in many domains, including tournament ra...

0 Ashwin Pananjady, et al. ∙

∙ 07/08/2016

Optimal Rates of Statistical Seriation

Given a matrix the seriation problem consists in permuting its rows in s...

0 Nicolas Flammarion, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world