stat.MLOct 14, 2026

Posterior Frequencies and the Cost of Not Fitting: A Correction to a Memorization Lower Bound

Authors: Zhenisbek Assylbekov, Rustem Takhanov

Organizations: Department of Mathematical Sciences, Purdue University Fort Wayne · School of Computing and Artificial Intelligence, Nazarbayev University

Abstract

Feldman's memorization lower bound assigns a frequency coefficient based on how often a point appears in the training sample. We give an exact three-point counterexample to its conditional and averaged forms, using independent fair labels and a permutation-equivariant learner. A sequence of sampling priors makes the ratio of the proposed penalty to actual excess risk grow exponentially, ruling out a universal positive constant-factor repair. The priors vary with sample size, the offending profiles become rare, and both quantities vanish. Retaining the original model, we obtain an exact replacement using full-sample posterior probabilities. Under exchangeability, these depend on multiplicity and the complete frequency profile. We characterize the largest multiplicity-only coefficients valid for unrestricted learners. The original coefficient has the posterior-mean form of Good's exact frequency formula and is an occupancy-weighted average of the corrected coefficients.

Figures & tables

Appendix figures & tables3 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Memorization Is Not Extraction: Tight Differential-Privacy Bounds and Audit Blind Spots

    Aug 27, 2026Xujun Che, Depeng Xu, Shuhan YuanTraining Data ExtractionPrivacy Leakage in Language Models

  2. Train for Many, Update with One: Improving Multi-Sample Reasoning via Fenchel-Bregman Posterior Learning

    Oct 13, 2026Sungjun Lim, Adrian Robert Minut, Nico Carlsen Daheim +3LLM Reasoning