2 citations · 3 across the 10 of their papers we have counts for
4 papers · 1 filter
On Differentially Private Linear Algebra
Haim Kaplan, Yishay Mansour, Shay Moran +2
We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities ove…
When Can Transformers Count to n?
Gilad Yehudai, Haim Kaplan, Guy Dar +4
Large language models based on the transformer architecture can solve highly complex tasks, yet their fundamental limitations on simple algorithmic problems remain poorly understoo…
Data Reconstruction: When You See It and When You Don't
Edith Cohen, Haim Kaplan, Yishay Mansour +4
We revisit the fundamental question of formally defining what constitutes a reconstruction attack. While often clear from the context, our exploration reveals that a precise defini…
Learning-Augmented Algorithms with Explicit Predictors
Marek Elias, Haim Kaplan, Yishay Mansour +1
Recent advances in algorithmic design show how to utilize predictions obtained by machine learning models from past and present data. These approaches have demonstrated an enhancem…