Cheng Mao

According to our database1, Cheng Mao authored at least 24 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Information-Theoretic Thresholds for Planted Dense Cycles.
CoRR, 2024

2023
Spectral Graph Matching and Regularized Quadratic Relaxations II.
Found. Comput. Math., October, 2023

Spectral Graph Matching and Regularized Quadratic Relaxations I Algorithm and Gaussian Analysis.
Found. Comput. Math., October, 2023

On-Chip Compressive Sensing with a Single-Photon Avalanche Diode Array.
Sensors, 2023

Detection of Dense Subhypergraphs by Low-Degree Polynomials.
CoRR, 2023

Random Graph Matching at Otter's Threshold via Counting Chandeliers.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Detection-Recovery Gap for Planted Dense Cycles.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Sharp analysis of EM for learning mixtures of pairwise differences.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2021
Exact Matching of Random Graphs with Constant Correlation.
CoRR, 2021

Optimal Spectral Recovery of a Planted Vector in a Subspace.
CoRR, 2021

Random Graph Matching with Improved Noise Robustness.
Proceedings of the Conference on Learning Theory, 2021

2020
Learning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments.
CoRR, 2020

Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory.
Proceedings of the 37th International Conference on Machine Learning, 2020

Research on Flexible Charging Strategy of Mobile Energy Storage Charging Vehicle.
Proceedings of the 5th International Conference on Automation, 2020

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

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model.
CoRR, 2019

Estimation of Monge Matrices.
CoRR, 2019

2018
Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations.
CoRR, 2018

Breaking the 1/√n Barrier: Faster Rates for Permutation-based Models in Polynomial Time.
CoRR, 2018

A $128\times 1$ Pixels, High Dynamic Range SPAD Imager in $0.18\ \mu\text{m}$ CMOS Technology.
Proceedings of the 2018 IEEE SENSORS, New Delhi, India, October 28-31, 2018, 2018

SPAD Sensors with $256\times 2$ Linear Array for Time Delay Integration Demonstration.
Proceedings of the 2018 IEEE SENSORS, New Delhi, India, October 28-31, 2018, 2018

Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time.
Proceedings of the Conference On Learning Theory, 2018

Minimax Rates and Efficient Algorithms for Noisy Sorting.
Proceedings of the Algorithmic Learning Theory, 2018

2017
Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons.
CoRR, 2017


  Loading...