Matthew Brennan
Harvard University
44 Papers
79 Citations
Matthew Brennan is an academic researcher from Harvard University. The author has contributed to research in topics: Sparse PCA & Geology. The author has an hindex of 12, co-authored 37 publications. Previous affiliations of Matthew Brennan include University of Southern California & Yale University.
Chat about Author
Papers
Cell–cell communication enhances the capacity of cell ensembles to sense shallow gradients during morphogenesis
David H. Ellison,David H. Ellison,Andrew Mugler,Andrew Mugler,Matthew Brennan,Matthew Brennan,Sung Hoon Lee,Robert J. Huebner,Eliah R. Shamir,Laura Woo,Joseph B. Kim,Patrick Amar,Ilya Nemenman,Andrew J. Ewald,Andre Levchenko +14 more
TL;DR: It is found that multicellular sensing enables detection of and response to shallow epidermal growth factor (EGF) gradients that are undetectable by single cells, and this provides a framework for understanding the advantages and limitations of sensory information processing by relays of chemically coupled cells.
150
How Information Theory Handles Cell Signaling and Uncertainty
TL;DR: Detailed studies of cellular biochemistry at the single-cell level now show that cells responding en masse may have quite varied behaviors when examined individually, raising the question of how precisely signaling pathways can control a cell's actions.
•Proceedings Article
Reducibility and computational lower bounds for problems with planted sparse structure
Matthew Brennan,Guy Bresler,Wasim Huleihel +2 more
- 03 Jul 2018
TL;DR: In this paper, a set of techniques for average-case reductions are introduced to maintain the level of signal in an instance of a problem, alter its planted structure, and map two initial high-dimensional distributions simultaneously to two target distributions approximately under total variation.
•Proceedings Article
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan,Guy Bresler +1 more
- 15 Jul 2020
TL;DR: This work gives the first evidence that an expanded set of hardness assumptions, such as for secret leakage planted clique, may be a key first step towards a more complete theory of reductions among statistical problems.
•Posted Content
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
TL;DR: This paper studies two of the most popular restricted computational models, the statistical query framework and low-degree polynomials, in the context of high-dimensional hypothesis testing, and finds that under mild conditions on the testing problem, the two classes of algorithms are essentially equivalent in power.
52