2 citations · 3 across the 10 of their papers we have counts for
12 papers
Machine Unlearning as Private Retroactive Algorithms
Haim Kaplan, Refael Kohen, Yishay Mansour +2
Machine unlearning typically aims to emulate retraining from scratch: upon a deletion request, the unlearning algorithm should produce an outcome that would have been obtained had…
Is Randomness Necessary for Adaptive Data Analysis?
Edith Cohen, Haim Kaplan, Yishay Mansour +2
The Adaptive Data Analysis (ADA) problem formalizes the challenge of preventing false discovery and overfitting when a dataset is repeatedly reused. Formally, our input is a datase…
Load Balancing under Adaptive Bin Deletions
Haim Kaplan, Shay Sapir, Uri Stemmer
We analyze a balls-and-bins game against an adaptive adversary that sequentially deletes bins. Starting with balls distributed across bins, the adversary deletes a bin in e…
Cost-Aware Learning
Clara Mohri, Amir Globerson, Haim Kaplan +2
We consider the problem of Cost-Aware Learning, where sampling different components of a finite-sum objective incurs different costs. The objective is to reach a target error while…
Fast Inference via Hierarchical Speculative Decoding
Clara Mohri, Haim Kaplan, Tal Schuster +2
Transformer language models generate text autoregressively, making inference latency proportional to the number of tokens generated. Speculative decoding reduces this latency witho…
Optimal Learning from Label Proportions with General Loss Functions
Lorne Applebaum, Travis Dick, Claudio Gentile +2
Motivated by problems in online advertising, we address the task of Learning from Label Proportions (LLP). We introduce a novel and versatile low-variance debiasing methodology to…
Bayesian Perspective on Memorization and Reconstruction
Haim Kaplan, Yishay Mansour, Kobbi Nissim +1
We introduce a new Bayesian perspective on the concept of data reconstruction, and leverage this viewpoint to propose a new security definition that, in certain settings, provably…
Nearly Optimal Sample Complexity for Learning with Label Proportions
Robert Busa-Fekete, Travis Dick, Claudio Gentile +3
We investigate Learning from Label Proportions (LLP), a partial information setting where examples in a training set are grouped into bags, and only aggregate label values in each…
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…