Hadley Black

Postdoctoral Researcher
University of California, San Diego
EnCORE Institute
 
 
My CV

Short Bio

I am a postdoc in the Computer Science department at UCSD, affiliated with the EnCORE Institute, where I am fortunate to be advised by Barna Saha. I completed my PhD in Computer Science at UCLA in 2023 under the sage guidance of Raghu Meka. Prior to that I received my MS in Computer Science from UCSC in 2018 where I was very lucky to work with C. Seshadhri. I completed a BA in Computer Science and BA in Mathematics from UCSC in 2016.

Research Interests

I am a theoretical computer scientist specializing in sublinear algorithms and learning theory.
 


Publications

    Clustering with Non-adaptive Subset Queries
    Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha
    Neural Information Processing Systems (NeurIPS) 2024.
    [arXiv]
    Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions
    Hadley Black
    International Conference on Randomization and Computation (RANDOM) 2024.
    [arXiv]     [short summary]
    Testing and Learning Convex Sets in the Ternary Hypercube
    Hadley Black, Eric Blais, and Nathaniel Harms
    Innovations in Theoretical Computer Science (ITCS) 2024.
    [arXiv]     [short summary]
    A d^{1/2+o(1)} Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids
    Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri
    Foundations of Computer Science (FOCS) 2023. Invited to SICOMP special issue.
    [arXiv]     [ECCC]     [short summary]
    Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an ~O(n\sqrt{d}) Monotonicity Tester
    Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri
    Symposium on Theory of Computing (STOC) 2023.
    [arXiv]     [ECCC]     [short summary]
    Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing
    Hadley Black, Iden Kalemaj, and Sofya Raskhodnikova
    Random Structures and Algorithms (RSA) 2024.
    Preliminary version in International Colloquium on Automata, Languages, and Programming (ICALP) 2023.
    [arXiv]     [ECCC]     [Journal]     [short summary]
    Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions
    Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri
    Symposium on Discrete Algorithms (SODA) 2020.
    [arXiv]     [ECCC]     [short summary]
    A o(d) polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]d
    Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri
    Symposium on Discrete Algorithms (SODA) 2018.
    [arXiv]     [ECCC]     [short summary]