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.
Since deep neural networks are over-parameterized, they can memorize noisy examples. We address such a memorization issue in the presence of label noise. From the fact that deep neural networks cannot generalize to neighborhoods of memorized features, we hypothesize that noisy examples do not consistently incur small l…
In the presence of noisy or incorrect labels, neural networks have the undesirable tendency to memorize information about the noise. Standard regularization techniques such as dropout, weight decay or data augmentation sometimes help, but do not prevent this behavior. If one considers neural network weights as random v…
Recently deep neural networks have shown their capacity to memorize training data, even with noisy labels, which hurts generalization performance. To mitigate this issue, we provide a simple but effective baseline method that is robust to noisy labels, even with severe noise. Our objective involves a variance regulariz…
Overparameterized deep networks have the capacity to memorize training data with zero \emph{training error}. Even after memorization, the \emph{training loss} continues to approach zero, making the model overconfident and the test performance degraded. Since existing regularizers do not directly aim to avoid zero train…
We study finite sample expressivity, i.e., memorization power of ReLU networks. Recent results require N hidden nodes to memorize/interpolate arbitrary N data points. In contrast, by exploiting depth, we show that 3-layer ReLU networks with Ω(N) hidden nodes can perfectly memorize most datasets with N po…
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.
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.
Learning to solve sequential tasks with recurrent models requires the ability to memorize long sequences and to extract task-relevant features from them. In this paper, we study the memorization subtask from the point of view of the design and training of recurrent neural networks. We propose a new model, the Linear Me…
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…
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.
The roles played by learning and memorization represent an important topic in deep learning research. Recent work on this subject has shown that the optimization behavior of DNNs trained on shuffled labels is qualitatively different from DNNs trained with real labels. Here, we propose a novel permutation approach that …
We improve deep threshold networks' memorization capacity exponentially.
problem Memorizing datasets with randomized labels using deep neural networks.
method Using Gaussian random weights in the first layer and binary or integer weights in subsequent layers, we prove a new dependence on minimum distance.
result We show that O(δ1+n) neurons and O(δd+n) weights are sufficient.
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 …