pith. sign in

Information complexity of stochastic convex optimization: Applications to generalization and memorization

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

citation-role summary

background 1 method 1

citation-polarity summary

fields

cs.CL 1 cs.LG 1

years

2026 2

verdicts

CONDITIONAL 2

representative citing papers

Is your algorithm unlearning or untraining?

cs.LG · 2026-04-09 · conditional · novelty 7.0

Machine unlearning conflates reversing the influence of specific training examples (untraining) with removing the full underlying distribution or behavior (unlearning).

citing papers explorer

Showing 2 of 2 citing papers.

  • Is your algorithm unlearning or untraining? cs.LG · 2026-04-09 · conditional · none · ref 2

    Machine unlearning conflates reversing the influence of specific training examples (untraining) with removing the full underlying distribution or behavior (unlearning).

  • Cram Less to Fit More: Training Data Pruning Improves Memorization of Facts cs.CL · 2026-04-09 · conditional · none · ref 3

    Loss-based pruning of training data to limit facts and flatten their frequency distribution enables a 110M-parameter GPT-2 model to memorize 1.3 times more entity facts than standard training, matching a 1.3B-parameter model on the full dataset.