arXiv Machine Learning By Matthew Regehr, Gautam Kamath, Andrew Lowy

Near-Optimal Pure Machine Unlearning for Smooth Strongly Convex Losses

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 1

Random Reshuffling Dominates Stochastic Gradient Descent

arXiv:2606. 32005v1 Announce Type: cross Abstract: Stochastic Gradient Descent ($\textsf{SGD}$) is one of the most classical optimization algorithms with favorable theoretical guarantees, yet the practical implementation of $\textsf{SGD}$ differs subtly from its well-known form and is often referred to as Shuffling Stochastic Gradient Descent ($\textsf{Shuffling SGD}$).

By Zijian Liu