Matthew S. Brennan

According to our database, Matthew S. Brennan authored at least 13 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Threshold for detecting high dimensional geometry in anisotropic random geometric graphs.

Matthew S. Brennan, Guy Bresler, Brice Huang

Random Struct. Algorithms, January, 2024

2021

Reducibility and Statistical-Computational Gaps from Secret Leakage.

Matthew S. Brennan

PhD thesis, 2021

De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions.

Matthew S. Brennan, Guy Bresler, Brice Huang

CoRR, 2021

The staircase property: How hierarchical structure can guide deep learning.

Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent.

Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm

Proceedings of the Conference on Learning Theory, 2021

2020

Reducibility and Statistical-Computational Gaps from Secret Leakage.

Matthew S. Brennan, Guy Bresler

Proceedings of the Conference on Learning Theory, 2020

2019

Phase Transitions for Detecting Latent Geometry in Random Graphs.

Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj

CoRR, 2019

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries.

Matthew S. Brennan, Guy Bresler

CoRR, 2019

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs.

Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Universality of Computational Lower Bounds for Submatrix Detection.

Matthew S. Brennan, Guy Bresler, Wasim Huleihel

Proceedings of the Conference on Learning Theory, 2019

Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness.

Matthew S. Brennan, Guy Bresler

Proceedings of the Conference on Learning Theory, 2019

2018

Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure.

Matthew S. Brennan, Guy Bresler, Wasim Huleihel

Proceedings of the Conference On Learning Theory, 2018

2017

Efficient Descriptor-Based Segmentation of Parotid Glands With Nonlocal Means.

Christian Wachinger, Matthew S. Brennan, Gregory C. Sharp, Polina Golland

IEEE Trans. Biomed. Eng., 2017