default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCheng Mao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Cheng Mao, Shenduo Zhang:
Impossibility of Latent Inner Product Recovery via Rate Distortion. Allerton 2024: 1-8- [i17]Cheng Mao, Alexander S. Wein, Shenduo Zhang:
Information-Theoretic Thresholds for Planted Dense Cycles. CoRR abs/2402.00305 (2024) - [i16]Cheng Mao, Shenduo Zhang:
Impossibility of latent inner product recovery via rate distortion. CoRR abs/2407.11932 (2024) - 2023
- [j3]Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu:
Spectral Graph Matching and Regularized Quadratic Relaxations I Algorithm and Gaussian Analysis. Found. Comput. Math. 23(5): 1511-1565 (2023) - [j2]Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu:
Spectral Graph Matching and Regularized Quadratic Relaxations II. Found. Comput. Math. 23(5): 1567-1617 (2023) - [j1]Chenxi Qiu
, Peng Wang, Xiangshun Kong, Feng Yan, Cheng Mao, Tao Yue, Xuemei Hu:
On-Chip Compressive Sensing with a Single-Photon Avalanche Diode Array. Sensors 23(9): 4417 (2023) - [c10]Cheng Mao, Alexander S. Wein, Shenduo Zhang:
Detection-Recovery Gap for Planted Dense Cycles. COLT 2023: 2440-2481 - [c9]Abhishek Dhawan, Cheng Mao, Ashwin Pananjady:
Sharp analysis of EM for learning mixtures of pairwise differences. COLT 2023: 4384-4428 - [c8]Cheng Mao, Yihong Wu, Jiaming Xu, Sophie H. Yu:
Random Graph Matching at Otter's Threshold via Counting Chandeliers. STOC 2023: 1345-1356 - [i15]Cheng Mao, Alexander S. Wein, Shenduo Zhang:
Detection-Recovery Gap for Planted Dense Cycles. CoRR abs/2302.06737 (2023) - [i14]Abhishek Dhawan, Cheng Mao, Ashwin Pananjady:
Sharp analysis of EM for learning mixtures of pairwise differences. CoRR abs/2302.10066 (2023) - [i13]Abhishek Dhawan, Cheng Mao, Alexander S. Wein:
Detection of Dense Subhypergraphs by Low-Degree Polynomials. CoRR abs/2304.08135 (2023) - 2022
- [i12]Cheng Mao, Yihong Wu, Jiaming Xu, Sophie H. Yu:
Random graph matching at Otter's threshold via counting chandeliers. CoRR abs/2209.12313 (2022) - 2021
- [c7]Cheng Mao, Mark Rudelson, Konstantin E. Tikhomirov:
Random Graph Matching with Improved Noise Robustness. COLT 2021: 3296-3329 - [i11]Cheng Mao, Mark Rudelson, Konstantin E. Tikhomirov:
Random Graph Matching with Improved Noise Robustness. CoRR abs/2101.11783 (2021) - [i10]Cheng Mao, Alexander S. Wein:
Optimal Spectral Recovery of a Planted Vector in a Subspace. CoRR abs/2105.15081 (2021) - [i9]Cheng Mao, Mark Rudelson, Konstantin E. Tikhomirov:
Exact Matching of Random Graphs with Constant Correlation. CoRR abs/2110.05000 (2021) - 2020
- [c6]Cheng Mao, Yufeng Zhang:
Research on Flexible Charging Strategy of Mobile Energy Storage Charging Vehicle. CACRE 2020: 37-42 - [c5]Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu:
Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory. ICML 2020: 2985-2995 - [i8]Cheng Mao, Yihong Wu:
Learning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments. CoRR abs/2009.06784 (2020)
2010 – 2019
- 2019
- [i7]Jan-Christian Hütter, Cheng Mao, Philippe Rigollet, Elina Robeva:
Estimation of Monge Matrices. CoRR abs/1904.03136 (2019) - [i6]Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu:
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model. CoRR abs/1907.08880 (2019) - [i5]Zhou Fan, Cheng Mao, Yihong Wu, Jiaming Xu:
Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality. CoRR abs/1907.08883 (2019) - 2018
- [c4]Cheng Mao, Jonathan Weed, Philippe Rigollet:
Minimax Rates and Efficient Algorithms for Noisy Sorting. ALT 2018: 821-847 - [c3]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time. COLT 2018: 2037-2042 - [c2]Xiangshun Kong, Xiaofeng Bu, Cheng Mao, Limin Zhang, Haowen Ma, Feng Yan:
SPAD Sensors with $256\times 2$ Linear Array for Time Delay Integration Demonstration. IEEE SENSORS 2018: 1-5 - [c1]Cheng Mao, Xiangshun Kong, Haowen Ma, Limin Zhang, Feng Yan, Xiaofeng Bu:
A $128\times 1$ Pixels, High Dynamic Range SPAD Imager in $0.18\ \mu\text{m}$ CMOS Technology. IEEE SENSORS 2018: 1-4 - [i4]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Breaking the 1/√n Barrier: Faster Rates for Permutation-based Models in Polynomial Time. CoRR abs/1802.09963 (2018) - [i3]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations. CoRR abs/1806.09544 (2018) - 2017
- [i2]Ashwin Pananjady, Cheng Mao, Vidya Muthukumar, Martin J. Wainwright, Thomas A. Courtade:
Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons. CoRR abs/1707.06217 (2017) - [i1]Cheng Mao, Jonathan Weed, Philippe Rigollet:
Minimax Rates and Efficient Algorithms for Noisy Sorting. CoRR abs/1710.10388 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 01:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
