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

Trend · papers per month

74149223297 · Jun 202019922001200920172026
48 results for Forgetting dynamics

Dynamic memory prevents forgetting in continuous learning of medical images.

problem Catastrophic forgetting in machine learning models over time due to domain shifts.
method Dynamic memory to store and replay diverse training data subsets.
result Dynamic memory mitigates forgetting without knowing when shifts occur.

Paper analyzes stability and forgetting in score-based generative models.

problem Understanding the stability and long-time behavior of generative models.
method Quantitative bounds on sampling error using stability and forgetting properties of the Markov chain.
result Provides practical consequences of stability and contraction mechanism in sampling.

New method uses dynamic programming for meta continual learning.

problem Challenges of generalization and catastrophic forgetting in sequential learning.
method Developed a theoretical framework using dynamic programming for meta continual learning.
result Theoretical and practical method achieves better accuracy than existing methods.

Procedure removes training data dependency from deep networks, improving generalization.

problem Removing dependency on training data in deep networks for better generalization.
method Deterministic and stochastic parts to ensure forgetting, leveraging activation and weight dynamics.
result New bound on information extraction from black-box networks, ensuring forgetting in activations.

Study shows optimal model performance at critical level of feature learning.

problem Catastrophic forgetting in neural networks, especially in non-stationary environments.
method Systematic study on model scale and feature learning, using dynamical mean field theory.
result Optimal performance achieved at a critical level of feature learning, dependent on task non-stationarity and model scale.

In this paper, we propose a new method to overcome catastrophic forgetting by adding generative regularization to Bayesian inference framework. Bayesian method provides a general framework for continual learning. We could further construct a generative regularization term for all given classification models by leveragi…

2019-12-03abs ↗pdf ↗

New method prevents forgetting in LLMs by dynamically identifying task-specific subspaces.

problem Catastrophic forgetting in continual learning of LLMs.
method Adaptive Singular Value Decomposition (SVD) for constrained full fine-tuning.
result Achieves state-of-the-art results in continual learning benchmarks.

ER-GNN uses experience replay to prevent GNNs from forgetting previous tasks.

problem Catastrophic forgetting in GNNs when learning multiple tasks sequentially.
method Experience Replay framework to store and replay knowledge from previous tasks.
result ER-GNN effectively mitigates catastrophic forgetting in GNNs.

Paper tackles continual reinforcement learning by forgetting, proposing a planning method with online world models.

problem Catastrophic forgetting in reinforcement learning when learning new tasks.
method Planning with an online world model using model predictive control.
result The proposed FTL Online Agent (OA) learns new tasks without forgetting old skills.

This research proposes a CL model for RNNs to handle sequential data without forgetting.

problem Learning in dynamic environments without forgetting previous knowledge for sequential data.
method A Recurrent Neural Network (RNN) model with Elastic Weight Consolidation (EWC) for CL.
result The proposed model outperforms EWC and RNNs on CL benchmarks for sequential data.

Researchers develop a neural network that learns like humans, overcoming forgetting and structure issues.

problem Catastrophic forgetting and structure limitations in neural networks.
method Memory playback strategy and dynamic structure extension using conditional variational autoencoder (CVAE).
result The method effectively prevents forgetting and allows for dynamic network growth.

Continual learning models allow to learn and adapt to new changes and tasks over time. However, in continual and sequential learning scenarios in which the models are trained using different data with various distributions, neural networks tend to forget the previously learned knowledge. This phenomenon is often referr…

2019-10-09abs ↗pdf ↗

Bayesian time series forecasting improves by dynamically adapting to recent information.

problem Lack of forgetting mechanism in signature kernel for time series forecasting.
method Introducing a novel forgetting mechanism for signature features using Random Fourier Decayed Signature Features (RFDSF) with Gaussian processes (GPs).
result Demonstrates superior performance compared to other GP-based alternatives and state-of-the-art probabilistic time series forecasting algorithms.

Adam optimizer leads to more forgetting in neural networks.

problem Understanding and quantifying catastrophic forgetting in neural networks.
method Comparative analysis of various optimization algorithms and metrics in different learning scenarios.
result Adam optimizer causes more forgetting compared to classical algorithms like SGD.

This paper investigates how forgetting affects neural network representations and stabilizes deeper layers.

problem Catastrophic forgetting in machine learning models trained on sequential tasks.
method Representational analysis techniques and empirical studies on CIFAR-10 and CIFAR-100 datasets.
result Deeper layers are disproportionately the source of forgetting, and methods to mitigate forgetting stabilize these layers.

Though neural networks have achieved much progress in various applications, it is still highly challenging for them to learn from a continuous stream of tasks without forgetting. Continual learning, a new learning paradigm, aims to solve this issue. In this work, we propose a new model for continual learning, called Ba…

2019-05-10abs ↗pdf ↗

Few-shot learning is a challenging problem where the goal is to achieve generalization from only few examples. Model-agnostic meta-learning (MAML) tackles the problem by formulating prior knowledge as a common initialization across tasks, which is then used to quickly adapt to unseen tasks. However, forcibly sharing an…

2019-06-13abs ↗pdf ↗

New framework SEU solves lifelong learning's catastrophic forgetting issue.

problem Catastrophic forgetting in lifelong learning.
method Introduces Neural Architecture Search into lifelong learning to dynamically adapt model structures for different tasks.
result Achieves higher accuracy with significantly smaller model size (25-33% of state-of-the-art methods).

The paper proposes selective forgetting for deep neural networks at a finer level than samples.

problem Selective forgetting of deep neural networks to handle outliers, poisoned data, or sensitive information.
method Formulated selective forgetting at a finer level than samples, introduced as an optimization problem on three criteria.
result Experimental results show the model can forget specific information for classification, improving accuracy in specific cases.

This paper tackles federated incremental learning with dynamic memory allocation for improved model performance in non-IID data.

problem Catastrophic forgetting in federated healthcare systems with non-IID data.
method Dynamic memory allocation strategy based on data replay mechanism.
result Significant performance improvements in medical image datasets compared to baseline models.

The paper analyzes how forgetting in LLMs is linked to simple task-upstream example associations.

problem Forgetting of upstream knowledge in fine-tuned LLMs.
method Empirical analysis of forgotten examples in NN upstream examples after MM new tasks, using low-rank matrix approximation.
result Forgetting can be predicted efficiently using matrix completion over empirical associations.

Study shows how task similarity affects forgetting in teacher-student setup.

problem Catastrophic forgetting in continual learning.
method Extended teacher-student setup to multiple teachers, analyzing similarity between tasks.
result Task similarity, whether at readouts or features, influences forgetting and transfer.

Bayesian online meta-learning framework tackles catastrophic forgetting in few-shot classification.

problem Catastrophic forgetting in few-shot classification problems.
method Bayesian online learning, meta-learning, Laplace approximation, variational inference.
result Framework effectively achieves goal of overcoming catastrophic forgetting in few-shot classification.

Study analyzes catastrophic forgetting in continual learning using teacher-student networks.

problem Catastrophic forgetting in continuously learning systems.
method Teacher-student learning framework, similarity of input distributions and target functions.
result Network can avoid catastrophic forgetting with small input distribution similarity and large target function similarity.

This work tackles catastrophic forgetting in neural networks by mimicking brain's metaplasticity.

problem Catastrophic forgetting in neural networks, where new tasks erase previously learned ones.
method Interpreting binarized neural networks as metaplastic systems, adjusting their training technique.
result Training technique reduces catastrophic forgetting without needing previously presented data.

Study examines how training regime affects neural networks' forgetting.

problem Catastrophic forgetting in neural networks when learning multiple tasks sequentially.
method Analyzes the impact of different training regimes (learning rate, batch size, regularization) on forgetting.
result Training regimes that widen tasks' local minima help prevent catastrophic forgetting.

Adaptive model learns from time series data with changing distributions.

problem Predicting time series data under distribution shift.
method Formulates distribution shift as weighted empirical risk minimization. Uses a gradient-based learning method for a forgetting mechanism.
result Proposes an efficient method for adaptive time series prediction.

Framework for safely updating machine learning models.

problem Continuous updates to machine learning models can lead to unintended consequences.
method Formalizes the problem as computing the largest locally invariant domain (LID), uses tractable primal-dual formulation.
result Matches or exceeds heuristic baselines for avoiding forgetting while providing formal safety guarantees.