Hadley Black

Assistant Professor
CUNY Baruch College, NYC
Department of Mathematics
 
Office: VC 6-223 (temporary for Spring 2026)
My CV
 

Short Bio

I am an Assistant Professor in the mathematics department at CUNY Baruch College. Previously, I was a postdoc in the Computer Science department at UCSD, affiliated with the EnCORE Institute, where I was very 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. In an ancient time, I attended Santa Rosa Junior College before transferring to UCSC.

Research Interests

I am broadly interested in theoretical computer science with a special focus on sublinear algorithms and computational learning theory.
 

Teaching

Spring 2026: Fundamental Algorithms, Baruch College, CUNY
Spring 2026: Complexity & Computational Models, Baruch College, CUNY
 

Publications

    Learning Nearest-Neighbor Maps from Adaptive Queries
    Hadley Black, Geelon So
    Preprint, 2026.
    [arXiv]
    Actively Learning Halfspaces without Synthetic Data
    Hadley Black, Kasper Green Larsen, Arya Mazumdar, Barna Saha, Geelon So
    Conference on Learning Theory (COLT) 2026.
    [arXiv]
    Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries
    Hadley Black, Christopher Ye
    Symposium on Discrete Algorithms (SODA) 2026.
    [arXiv]
    Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
    Hadley Black, Arya Mazumdar, Barna Saha, Yinzhan Xu
    Conference on Learning Theory (COLT) 2025.
    [arXiv]     [20-min slides]
    Learning Partitions with Optimal Query and Round Complexities
    Hadley Black, Arya Mazumdar, Barna Saha
    Conference on Learning Theory (COLT) 2025.
    [arXiv]     [20-min slides]
    Clustering with Non-adaptive Subset Queries
    Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha
    Neural Information Processing Systems (NeurIPS) 2024.
    [arXiv]     [5-min slides]
    Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions
    Hadley Black
    International Conference on Randomization and Computation (RANDOM) 2024.
    [arXiv]     [20-min slides]
    Testing and Learning Convex Sets in the Ternary Hypercube
    Hadley Black, Eric Blais, and Nathaniel Harms
    Innovations in Theoretical Computer Science (ITCS) 2024.
    [arXiv]     [45-min slides]     [Nathan's art]
    A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids
    Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri
    SIAM Journal on Computing (SICOMP) 2025.
    Foundations of Computer Science (FOCS) 2023.
    Invited to SICOMP special issue.
    [arXiv]     [ECCC]     [Journal]     [20-min slides]
    Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an O∼(n√d) Monotonicity Tester
    Hadley Black, Deeparnab Chakrabarty, and C. Seshadhri
    Symposium on Theory of Computing (STOC) 2023.
    [arXiv]     [ECCC]     [20-min slides]
    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]
    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]
    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]