arXiv Machine Learning
Jul 23
On Optimization Complexity of Second-Order Certified Unlearning
arXiv:2607. 20192v1 Announce Type: new Abstract: We study machine unlearning: the removal of memorized training data from a trained model.
On Optimization Complexity of Second-Order Certified Unlearning
We study machine unlearning: the removal of memorized training data from a trained model. Specifically, we investigate the algorithmic complexity of certified unlearning from an optimization perspective.
Related stories
arXiv AI
Jul 7
Machine Unlearning via Information Theoretic Regularization
arXiv:2502. 05684v5 Announce Type: replace-cross Abstract: How can we effectively remove or ``unlearn'' undesirable information, such as specific features or the influence of individual data points, from a learning outcome while minimizing utility loss and ensuring rigorous guarantees?
arXiv Machine Learning
Jun 8
The Utility and Complexity of in- and out-of-Distribution Machine Unlearning
arXiv:2412. 09119v3 Announce Type: replace Abstract: Machine unlearning, the process of selectively removing data from trained models, is increasingly crucial for addressing privacy concerns and knowledge gaps post-deployment.
arXiv AI
Jun 2
How Hard Can It Be? Hardness-Aware Multi-Objective Unlearning
arXiv:2606. 02119v1 Announce Type: cross Abstract: Machine unlearning aims to remove the influence of specific forget training data due to privacy, copyright or bias concerns while maintaining the model performance on the remaining retain data.
arXiv AI
1d ago
Learning to Unlearn: Machine Unlearning via Learning the Unlearning Behaviors
arXiv:2608. 16700v1 Announce Type: cross Abstract: Various machine unlearning techniques have been developed in response to privacy legislation requirements, enabling individuals to exercise their legal right to have their data $D_f$ removed from a machine learning model.
arXiv Machine Learning
Jun 2
Near-Optimal Pure Machine Unlearning for Smooth Strongly Convex Losses
arXiv:2606. 01527v1 Announce Type: new Abstract: Machine unlearning is motivated by legal and user-facing requirements to remove the influence of individuals' data from trained models, such as the right to be forgotten.
arXiv Machine Learning
Jun 5
Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
arXiv:2503. 04712v3 Announce Type: replace-cross Abstract: We study the optimization of non-convex functions that are not necessarily smooth (gradient and/or Hessian are Lipschitz) using first order methods.
arXiv Machine Learning
Jun 9
The Sample Complexity of Parameter-Free Stochastic Convex Optimization
arXiv:2506. 11336v2 Announce Type: replace Abstract: We study the sample complexity of stochastic convex optimization when problem parameters such as the distance to optimality and the Lipschitz constant are unknown.
arXiv Machine Learning
Jul 8
Auditing of Unlearning Algorithms
arXiv:2607. 05898v1 Announce Type: new Abstract: Evaluating whether unlearning algorithms truly remove training data influence remains an open challenge.
arXiv Machine Learning
Jun 16
Auditing Machine Unlearning: A Systematic Research on Whether Models Truly Forget
arXiv:2606. 16110v1 Announce Type: new Abstract: Machine unlearning has been extensively studied in response to growing privacy concerns and regulatory requirements.
Hugging Face Trending Papers
Jun 15
Auditing Machine Unlearning: A Systematic Research on Whether Models Truly Forget
Machine unlearning has been extensively studied in response to growing privacy concerns and regulatory requirements. However, auditing whether unlearning algorithms have truly erased the influence of specific data remains an open challenge.
arXiv Machine Learning
Jun 26
Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity
arXiv:2606. 27298v1 Announce Type: cross Abstract: We study the fundamental problem of learning a high-dimensional Gaussian truncated to an unknown halfspace.