( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs.

, , и . CoRR, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Michael Brennan

Helga-Isolde Brennan

Matthew Mellon

Matthew David

Matthew Grum

 

Другие публикации лиц с тем же именем

Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs., , и . CoRR, (2022)Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries., и . CoRR, (2019)The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs., , и . FOCS, стр. 1256-1280. IEEE Computer Society, (2019)Threshold for detecting high dimensional geometry in anisotropic random geometric graphs., , и . Random Struct. Algorithms, 64 (1): 125-137 (января 2024)De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions., , и . CoRR, (2021)Phase Transitions for Detecting Latent Geometry in Random Graphs., , и . CoRR, (2019)Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness., и . COLT, том 99 из Proceedings of Machine Learning Research, стр. 469-470. PMLR, (2019)The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs., , и . CoRR, (2019)Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent., , , , и . COLT, том 134 из Proceedings of Machine Learning Research, стр. 774. PMLR, (2021)Reducibility and Statistical-Computational Gaps from Secret Leakage., и . COLT, том 125 из Proceedings of Machine Learning Research, стр. 648-847. PMLR, (2020)