Math 2.0

Resources / preprint

Why Forget-Only Unlearning Needs Memorization 83MMH8VF1X

URIm2://res/83MMH8VF1X
Kindpreprint
CreatorsLuka Radić, Vikrant Singhal, Amartya Sanyal
Date2026-10-07
Subjectsarxiv cs.LG, arxiv cs.IT, arxiv math.IT, arxiv stat.ML
Scopeborder

Expressions

e1: version, preprint

Date2026-10-07
IdsarXiv 2610.10519

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
2ESP080RNTstatementproposition 3.2arxiv
Row-wise factorized affine matrix completionstatementproposition 4.7arxiv
Teaching dimensiondefinitiondefinition 5arxiv
5GY10V5S42statementtheorem 4.3arxiv
\(\Gamma\)-utility on empty requestsdefinitiondefinition 2arxiv
Informal: hard-margin SVMstatementcorollary 1.1arxiv
8SQ6FWPKDEproblemproblem 2arxiv
Canonical threshold ERMstatementproposition 4.4arxiv
Coordinate PCAstatementproposition 4.5arxiv
Event transferstatementlemma B.1arxiv
BM2PT470NAstatementlemma 4.2arxiv
Recovery errordefinitiondefinition 4arxiv
Ridge regressionstatementproposition 4.6arxiv
H3WZE1X0NZstatementtheorem 3.1arxiv
HSG6WSFZFGstatementproposition 4.1arxiv
Empirical medianexampleexample 3arxiv
Shared-deletion exampledefinitiondefinition 3arxiv
Canonical thresholdsexampleexample 2arxiv
MJFCRWKSHBstatementtheorem 1.2arxiv
Gaussian empty-request mapexampleexample 1arxiv
PG1GZM6ZWTstatementlemma C.1arxiv
R09XK8DJTGproblemproblem 1arxiv
Hard-margin linear classificationexampleexample 4arxiv
R\'enyi unlearningdefinitiondefinition 1arxiv

Catalogue records