mlsanityData to 7 Oct 2026

Beyond One Epoch: Uncertainty-Weighted Sensitivity Regularization for Recommendation Models

arXiv 2609.34083 ↗First posted 28 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Recommendation models with sparse embeddings and a shared consumer often exhibit the one-epoch phenomenon: a second epoch lowers training loss while sharply degrading generalization. We present a view based on the violation of the prequential principle. On the first epoch, an example's label has not affected the embedding rows used to score it. On later epochs, those rows contain a displacement induced by the labels earlier update. This creates an incentive for the shared consumer to exploit this displacement in subsequent epochs, which fails to generalize. We call this self-influence asymmetry. Using an exact scalar model and local influence analysis, we connect this mismatch to the uncertainty in the embeddings and the consumers incentive to exploit it in subsequent epochs. We verify this hypothesis using an embedding-consumer-update interventions in deep recommendation models and propose uncertainty-weighted sensitivity regularization (UWSR) which counteracts this mismatch by augmenting the loss function to penalize the consumer for relying on uncertain embeddings. Unlike existing remedies, UWSR preserves the learned embeddings and across three benchmarks, four-epoch UWSR reduces test cross-entropy by 1.38%-6.78% and improves AUC by 0.0058-0.0231 relative to one-epoch training.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 27 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

12 of 27 references.

References · 12

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  3. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  4. 2015Image-based Recommendations on Styles and Substitutescited by 702
  5. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  6. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
  7. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
  8. 2024Wukong: Towards a Scaling Law for Large-Scale Recommendationcited by 72
  9. 2022Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Modelscited by 33
  10. 2025Fishers for Free? Approximating the Fisher Information Matrix by Recycling the Squared Gradient Accumulatorcited by 13
  11. 2024Multi-Epoch learning with Data Augmentation for Deep Click-Through Rate Predictioncited by 2
  12. 2025Adaptive Regularization for Large-Scale Sparse Feature Embedding Modelscited by 2

Built on by

Not cited yet.