1 citations · 1 across the 5 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2026
Exact Unlearning via Quantized Sufficient Statistics
Ami Tavory, Shripad Gade, Tal Sarig +2
Exact unlearning requires a deployed predictor to match one rebuilt without the information named by a deletion request. Existing general-purpose exact methods localize retraining…
cs.LG2026
Bandits via Additive Quantized Representations
Ami Tavory, Noam Touitou, Tal Sarig +2
Contextual bandits require balancing nonlinear reward modeling with online efficiency. Tree ensembles and neural methods capture nonlinearities but require periodic retraining and…
cs.LG2024
Online Weighted Paging with Unknown Weights
Orin Levy, Noam Touitou, Aviv Rosenberg
Online paging is a fundamental problem in the field of online algorithms, in which one maintains a cache of slots as requests for fetching pages arrive online. In the weighted…