201 citations · 235 across the 24 of their papers we have counts for
34 papers
A polylogarithmic bound for list replicability
Ari Blondal, Hamed Hatami, Pooya Hatami +2
Zhang [Zha26] recently posted a manuscript announcing that the list-replicability number of every class of binary concepts on domain points is …
Exponential Correlation Bounds for Polynomials
Eshan Chattopadhyay, Pooya Hatami, Chin Ho Lee +3
We prove that the XOR of majorities on disjoint blocks of bits has correlation at most with every Boolean-valued degree- polynomial over an arbit…
Sign-Rank, Index, and List Replicability: Connections and Separations
Ari Blondal, Hamed Hatami, Pooya Hatami +2
In learning theory, the sign-rank of a binary concept class captures the smallest dimension in which it can be represented by points and halfspaces. Despite tremendous interest, lo…
Tight list replicability bounds via a novel sphere covering theorem
Ari Blondal, Hamed Hatami, Pooya Hatami +2
In recent years, list replicability has emerged as a framework for formalizing reproducibility in learning theory. A central question is how the required list size relates to the a…
Simplicial covering dimension of extremal concept classes
Ari Blondal, Hamed Hatami, Pooya Hatami +2
Dimension theory is a branch of topology concerned with defining and analyzing dimensions of geometric and topological spaces in purely topological terms. In this work, we adapt th…
Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces
Ari Blondal, Hamed Hatami, Pooya Hatami +2
We prove that the list replicability number of -dimensional -margin half-spaces satisfies \[ \frac{d}{2}+1 \le \mathrm{LR}(H^d_γ) \le d, \] which grows with dimension. This r…