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,932 papers · 148 categories

Trend · papers per month

1.3%2.6%4.0%5.3% · Nov 201919922001200920172026
48 results for pattern memorization

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.

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.

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.

Learning rate decay helps modern neural networks by suppressing memorization and improving complex pattern learning.

problem Understanding the effectiveness of learning rate decay in training modern neural networks.
method Proposes a new explanation for lrDecay effectiveness based on network behavior and pattern complexity.
result Learning rate decay improves complex pattern learning and suppresses memorization of noisy data.

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 ↗

A novel framework IMBoost improves outlier detection by leveraging the inlier memorization effect.

problem Challenges in unsupervised outlier detection, especially when inliers and outliers are not well-separated or form dense clusters.
method IMBoost framework that incorporates active learning to selectively acquire informative labels and explicitly reinforce the inlier memorization effect.
result IMBoost significantly outperforms state-of-the-art active outlier detection methods and requires less computational cost.

Paper tackles noisy label learning by exploiting memorization effect.

problem How to properly control sample selection for deep networks to benefit from memorization effect.
method Model as a function approximation problem, design domain-specific search space, propose Newton algorithm to solve bi-level optimization efficiently, provide theoretical analysis.
result Proposed method outperforms state-of-the-art approaches and is more efficient than existing AutoML algorithms.

The paper shows averaging gradients leads to memorization, proposing an alternative algorithm to focus on invariances.

problem The principle that 'good explanations are hard to vary' in deep learning is investigated.
method Formalizing consistency for loss surface minima, proposing an alternative algorithm based on logical AND.
result The alternative algorithm prevents memorization and focuses on invariances.

Label noise may affect the generalization of classifiers, and the effective learning of main patterns from samples with noisy labels is an important challenge. Recent studies have shown that deep neural networks tend to prioritize the learning of simple patterns over the memorization of noise patterns. This suggests a …

2018-11-20abs ↗pdf ↗

New metric mm-coherence measures gradient alignment during training, revealing surprising memorization patterns.

problem Measuring and understanding the alignment of per-example gradients during training.
method Introducing mm-coherence as a metric to study gradient alignment, showing its advantages over existing metrics.
result Training with random labels leads to high mm-coherence, indicating common patterns even when generalization is not possible.

Large initial learning rate helps neural nets generalize better.

problem Understanding why large initial learning rates lead to better neural net generalization.
method Developed a proof for a two-layer network and demonstrated with experiments on CIFAR-10.
result Proved that a two-layer network trained with a large initial learning rate and annealing generalizes better than one trained with a small learning rate.

Deep neural networks can generalize by reducing high-frequency noise over time, not always following a monotonic learning bias.

problem Understanding the learning dynamics and generalization of over-parameterized DNNs.
method Experimental analysis of deep double descent, focusing on the spectral bias of DNNs.
result The high-frequency components of DNNs diminish over training, leading to a second descent in test error.

ALTBI enhances outlier detection by maximizing the inlier-memorization effect.

problem Improving outlier detection models via optimization of inlier-memorization effect.
method ALTBI introduces two techniques: increasing mini-batch size and using adaptive threshold for truncated loss function.
result ALTBI achieves state-of-the-art performance in identifying outliers with lower computation costs.

A blindfolded LLM trading framework validates market signals without ticker memorization.

problem Ensuring LLMs trade based on genuine market understanding, not memorized data.
method Anonymize tickers and company names, verify signals through reasoning embeddings, and use PPO-DSR policy.
result Achieved Sharpe ratio of 1.40 +/- 0.22 across 20 seeds, robust in volatile markets.

Deep ReLU networks have surprisingly few activation patterns at initialization.

problem Limited expressivity of deep ReLU networks despite theoretical potential.
method Analyzed the number of activation patterns in ReLU networks at initialization and during training.
result The average number of activation patterns is bounded by the total number of neurons raised to the input dimension.

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.

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.

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}).

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.

Transformers mimic Bayesian reasoning in controlled settings, revealing geometric mechanisms.

problem Verifying if transformers perform Bayesian reasoning rigorously in natural data.
method Constructing Bayesian wind tunnels with known posteriors and proving memorization impossibility.
result Transformers achieve 10310^{-3}-10410^{-4} bit accuracy in Bayesian posteriors, while MLPs fail.

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.

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.

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.

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.

Learning requires memorizing labels, especially in long-tailed data.

problem Understanding why memorizing labels is necessary for accurate learning.
method Introduced a theoretical model for natural data distributions, showing memorization is necessary for optimal generalization error.
result Memorization of labels, even for outliers and noisy labels, is necessary for achieving close-to-optimal generalization error.

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.

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.

A new model improves recurrent neural networks' ability to memorize long sequences.

problem Improving recurrent neural networks' ability to memorize long sequences and extract task-relevant features.
method Proposes a Linear Memory Network with an encoding-based memorization component and a specialized training algorithm.
result Improves the final performance of recurrent neural networks when memorizing long sequences is necessary.

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.

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.

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.

The bias potential model explains how generative models can generalize or memorize samples.

problem Understanding and achieving generalization in generative models like GANs.
method Introducing the bias potential model to analyze the behavior of generative models.
result Dimension-independent generalization accuracy can be achieved with early stopping in the bias potential model.

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.

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.