42 citations · 147 across the 42 of their papers we have counts for
48 papers
A note on shifting distributions via Poisson races
Amir Yehudayoff
This expository note is about simulating a target distribution from observations of a proposal distribution . In the model suggested by Harsha, Jain, McAllester and Radhakri…
Local Borsuk-Ulam, Stability, and Replicability
Zachary Chase, Bogdan Chornomaz, Shay Moran +1
We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of…
The discrepancy of greater-than
Srikanth Srinivasan, Amir Yehudayoff
The discrepancy of the greater-than matrix is shown to be up to lower order terms.
Dual Systolic Graphs
Daniel Carmon, Amir Yehudayoff
We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to cons…
Replicability and stability in learning
Zachary Chase, Shay Moran, Amir Yehudayoff
Replicability is essential in science as it allows us to validate and verify research findings. Impagliazzo, Lei, Pitassi and Sorrell (`22) recently initiated the study of replicab…
A Unified Characterization of Private Learnability via Graph Theory
Noga Alon, Shay Moran, Hilla Schefler +1
We provide a unified framework for characterizing pure and approximate differentially private (DP) learnability. The framework uses the language of graph theory: for a concept clas…