Showing 2025Show all
3 papers · 1 filter
cs.LG2025
Leveraging Per-Instance Privacy for Machine Unlearning
Nazanin Mohammadi Sepahvand, Anvith Thudi, Berivan Isik +5
We present a principled, per-instance approach to quantifying the difficulty of unlearning via fine-tuning. We begin by sharpening an analysis of noisy gradient descent for unlearn…
cs.LG2025
Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs
Alexander Ryabchenko, Idan Attias, Daniel M. Roy
We study online learning with oblivious losses and delays under a novel ``capacity constraint'' that limits how many past rounds can be tracked simultaneously for delayed feedback.…
cs.LG2025
On Traceability in Stochastic Convex Optimization
Sasha Voitovych, Mahdi Haghifam, Idan Attias +3
In this paper, we investigate the necessity of traceability for accurate learning in stochastic convex optimization (SCO) under geometries. Informally, we say a learning a…