Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

2805598391,118 · Jun 202019922001200920172026
48 results for Data Memorization

New approach shows data memorization trade-offs in large models.

problem Data memorization in large language models and its privacy implications.
method Developed a new approach using strong data processing inequalities to prove lower bounds on memorization.
result Proved that Ω(d)Ω(d) bits of training data information must be memorized for O(1)O(1) examples, decaying with example growth.

LLMs can memorize economic data and recall exact values before their training cutoff.

problem Evaluating the trustworthiness of LLMs' economic forecasts during their training period.
method Demonstrated through counterfactual forecasting and analysis of LLMs' recall ability.
result LLMs have memorized economic and financial data, leading to recall-level accuracy before their knowledge cutoff.

Study shows how deep generative models can memorize data.

problem Understanding and preventing memorization in deep generative models.
method Adapted a memorization measure for unsupervised density estimation and demonstrated its effectiveness.
result Memorization in deep generative models differs from mode collapse and overfitting.

Generative diffusion models gradually memorize training data, losing independent dimensions.

problem Understanding how generative diffusion models memorize training data, especially on low-dimensional manifolds.
method Measuring latent dimensionality via the learned score field, proposing a geometric memorization theory.
result Generative diffusion models experience a smooth collapse of their capacity to vary across independent directions as data become scarce, leading to near point-wise replication of salient features.

Study shows FL reduces unintended memorization by clustering data and using strong user-level privacy.

problem Unintended memorization in federated learning.
method Examined the effect of clustering data and using strong user-level differential privacy in FL.
result Clustering data and strong user-level differential privacy reduce unintended memorization.

New method reduces memorization in diffusion models without sacrificing image quality.

problem Diffusion models often memorize training data, especially with small datasets.
method Train models using noisy data at large noise scales to reduce memorization.
result Significant reduction in memorization without compromising image quality.

The paper identifies patterns in language model weights used for memorizing paragraphs.

problem Locating the specific mechanisms and weights used by language models to memorize paragraphs.
method Examined gradients and attention patterns in language models to identify memorized paragraphs.
result Gradients of memorized paragraphs have a distinguishable spatial pattern, and localized attention heads are involved in paragraph memorization.

State-of-the-art results on image recognition tasks are achieved using over-parameterized learning algorithms that (nearly) perfectly fit the training set and are known to fit well even random labels. This tendency to memorize the labels of the training data is not explained by existing theoretical analyses. Memorizati…

2019-06-12abs ↗pdf ↗

Consistency distillation reduces memorization in diffusion models without harming sample quality.

problem Understanding how distillation affects memorization in diffusion models.
method Analysis of consistency distillation in diffusion models using a random feature neural network model.
result Consistency distillation reduces memorization in diffusion models without harming sample quality.

Given data with noisy labels, over-parameterized deep networks can gradually memorize the data, and fit everything in the end. Although equipped with corrections for noisy labels, many learning methods in this area still suffer overfitting due to undesired memorization. In this paper, to relieve this issue, we propose …

2018-09-28abs ↗pdf ↗

Diffusion models can memorize training data, limiting their creativity and privacy.

problem Memorization in diffusion models that reproduces training data instead of generating novel outputs.
method Dual-separation approach via statistical estimation and network approximation.
result Pruning-based method reduces memorization while maintaining generation quality.

The study uncovers the conditions under which diffusion models memorize or generalize.

problem Understanding the balance between memorization and generalization in diffusion models.
method Theoretical and mathematical framework to investigate memorization and generalization in diffusion models.
result Theoretical crossover point predicts a phase transition in diffusion models, validating the hypothesis.

Study interprets neural network generalization and memorization on corrupted data.

problem Understanding when a neural network has memorized corrupted data versus learned the underlying rule.
method Analyzes multi-layer perceptrons and Transformers on modular arithmetic tasks with corrupted labels.
result Regularization methods can force networks to ignore corrupted data, improving accuracy on uncorrupted data.

Deep models memorize training data in geophysical inversion, leading to biased posterior distributions.

problem Memorization of training data biases learned priors in geophysical inverse problems.
method Casting generative models' training as maximum likelihood, we show memorization results in a reweighted empirical distribution for diffusion models, leading to Gaussian mixture priors and posteriors.
result Memorization leads to posterior distributions that are likelihood-weighted lookup among stored training examples, affecting full waveform inversion outcomes.

Large learning rates prevent memorization in denoising score matching.

problem Memorization of training data in diffusion-based generative models.
method Investigating the role of large learning rates in the small-noise regime, proving that they prevent convergence to the empirical optimal score.
result Large learning rates prevent memorization by making it impossible for the learned score to be arbitrarily close to the empirical optimal score.

Deep networks preferentially learn shared features, avoiding memorization in early layers.

problem Understanding how deep neural networks generalize vs. memorize training data.
method Replica-based mean field geometric analysis of deep neural networks.
result Deep layers predominantly memorize, while early layers are minimally affected.

This paper explores memorization in adversarial training and proposes a mitigation algorithm.

problem Understanding and mitigating robust overfitting in adversarial training.
method Demonstrated the capacity of deep networks to memorize adversarial examples, analyzed convergence and generalization issues, and proposed a new mitigation algorithm.
result Identified robust overfitting as a significant drawback of adversarial training and proposed a mitigation algorithm.

We examine the role of memorization in deep learning, drawing connections to capacity, generalization, and adversarial robustness. While deep networks are capable of memorizing noise data, our results suggest that they tend to prioritize learning simple patterns first. In our experiments, we expose qualitative differen…

2017-06-16abs ↗pdf ↗

Introduces Relational Privacy (RP) to control relation memorization in question answering models.

problem Relation memorization in question answering models can lead to privacy issues.
method Formalizes Relational Privacy (RP) and Differential Relational Privacy (DrP), providing bounds on relation memorization.
result DrP allows effective learning of general properties of underlying concepts while preventing relation memorization.

This paper studies the relationship between the classification performed by deep neural networks (DNNs) and the decision of various classical classifiers, namely k-nearest neighbours (k-NN), support vector machines (SVM) and logistic regression (LR), at various layers of the network. This comparison provides us with ne…

2018-05-17abs ↗pdf ↗

Early stopping improves generalization in overparameterized diffusion models.

problem Understanding and optimizing generalization in overparameterized diffusion models.
method Revisiting diffusion models, showing generalization occurs before memorization, and developing a phase diagram.
result Generalization time scales with dataset size, supporting early-stopping criteria.

RAF model explains neural networks' dual rule learning and fact memorization.

problem Understanding how neural networks learn rules and memorize facts simultaneously.
method Introduces the Rules-and-Facts (RAF) model to bridge generalization and memorization.
result Characterizes conditions for simultaneous rule learning and fact memorization in neural networks.

Deep neural networks (DNNs) can easily fit a random labeling of the training data with zero training error. What is the difference between DNNs trained with random labels and the ones trained with true labels? Our paper answers this question with two contributions. First, we study the memorization properties of DNNs. O…

2019-11-21abs ↗pdf ↗

Diffusion models generalize well until a threshold is reached, preventing memorization.

problem Understanding why diffusion models don't memorize training data.
method Investigation of training dynamics and two timescales: τgenτ_\mathrm{gen} and τmemτ_\mathrm{mem}.
result The threshold τmemτ_\mathrm{mem} increases linearly with training set size nn, preventing memorization.

Optimal ReLU networks can memorize any separable set of points with a small number of parameters.

problem The optimal number of parameters required to memorize a set of points using ReLU networks.
method Construction of ReLU networks with specific bit complexity to memorize points satisfying a mild separability assumption.
result Optimal ReLU networks can memorize any separable set of points with a number of parameters that is ildeO(N) ilde{O}(\sqrt{N}).

Researchers validate ML scenario generators by checking dependencies and detecting memorization effects.

problem Validation of machine learning-based scenario generators differs from classical methods due to data-driven dependencies.
method Two novel validation aspects: checking dependencies and detecting memorization effects. Novel memorization ratio introduced.
result Validation methods successfully detect dependencies and memorization effects in ML-based scenario generators.

Over-parameterized models can memorize noisy labels and still generalize well, revealing a hidden structure.

problem Understanding how over-parameterized models can simultaneously memorize noisy labels and generalize well.
method Investigated through modular arithmetic tasks with label noise using two-layer neural networks.
result Over-parameterized models can achieve near-perfect test accuracy with 80% label noise by extracting an internal generalization structure.

New attack reveals memorization patterns in pre-trained LLMs.

problem Determining if a data point was part of a pre-trained LLM's training set.
method Adapts MIA statistical tests to LLM's perplexity dynamics of subsequences.
result Significantly outperforms prior approaches in membership inference attacks.

This paper examines how Higher-Order Langevin Dynamics reduces memorization in diffusion models.

problem Memorization of training samples in diffusion models, violating copyright and privacy.
method Introduces Higher-Order Langevin Dynamics (HOLD) to regularize diffusion model trajectories.
result The dynamics of the data variable in HOLD are governed by a low-pass-filtered version of the learned score function, with smoothness increasing with model order.

Study compares memorization of SimCLR to supervised and random labels training.

problem Understanding memorization in contrastive learning.
method Investigated SimCLR's memorization properties compared to supervised and random labels training.
result SimCLR's memorization is similar to random labels training in terms of training object complexity distribution.