6 papers
Capacity-Constrained Online Convex Optimization with Delayed Feedback
Alexander Ryabchenko, Idan Attias, Daniel M. Roy
Online learning with delayed feedback typically assumes that the learner can track all pending rounds until their feedback arrives. In practice, tracking resources are finite, and…
Detoxifying LLMs via Representation Erasure-Based Preference Optimization
Nazanin Mohammadi Sepahvand, Eleni Triantafillou, Hugo Larochelle +3
Large language models (LLMs) trained on webscale data can produce toxic outputs, raising concerns for safe deployment. Prior defenses, based on applications of DPO, NPO, and simila…
A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
Alexander Ryabchenko, Idan Attias, Daniel M. Roy
We develop a reduction-based framework for online learning with delayed feedback that recovers and improves upon existing results for both first-order and bandit convex optimizatio…
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.…
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…
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…