activity
20172026
most citedRemember What You Want to Forget: Algorithms for Machine Unlearning

67 citations · 145 across the 35 of their papers we have counts for

collaborators
Showing 2024Show all

7 papers · 1 filter

cs.LG2024★ 1 cited

Unstable Unlearning: The Hidden Risk of Concept Resurgence in Diffusion Models

Vinith M. Suriyakumar, Rohan Alur, Ayush Sekhari +2

Text-to-image diffusion models rely on massive, web-scale datasets. Training them from scratch is computationally expensive, and as a result, developers often prefer to make increm…

cs.LG2024

Langevin Dynamics: A Unified Perspective on Optimization via Lyapunov Potentials

August Y. Chen, Ayush Sekhari, Karthik Sridharan

We study the problem of non-convex optimization using Stochastic Gradient Langevin Dynamics (SGLD). SGLD is a natural and popular variation of stochastic gradient descent where at…

cs.LG2024

Random Latent Exploration for Deep Reinforcement Learning

Srinath Mahankali, Zhang-Wei Hong, Ayush Sekhari +2

We introduce Random Latent Exploration (RLE), a simple yet effective exploration strategy in reinforcement learning (RL). On average, RLE outperforms noise-based methods, which per…

cs.LG2024

Machine Unlearning Fails to Remove Data Poisoning Attacks

Martin Pawelczyk, Jimmy Z. Di, Yiwei Lu +3

We revisit the efficacy of several practical methods for approximate machine unlearning developed for large-scale deep learning. In addition to complying with data deletion request…

cs.LG2024

Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics

Runzhe Wu, Ayush Sekhari, Akshay Krishnamurthy +1

We study computationally and statistically efficient Reinforcement Learning algorithms for the linear Bellman Complete setting. This setting uses linear function approximation to c…

cs.LG2024

Offline Reinforcement Learning: Role of State Aggregation and Trajectory Data

Zeyu Jia, Alexander Rakhlin, Ayush Sekhari +1

We revisit the problem of offline reinforcement learning with value function realizability but without Bellman completeness. Previous work by Xie and Jiang (2021) and Foster et al.…

cs.LG2024

Harnessing Density Ratios for Online Reinforcement Learning

Philip Amortila, Dylan J. Foster, Nan Jiang +2

The theories of offline and online reinforcement learning, despite having evolved in parallel, have begun to show signs of the possibility for a unification, with algorithms and an…