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

192384576768 · Jun 202019922001200920172026
48 results for continuing tasks

Paper analyzes convergence of continual learning with adaptive methods.

problem Preventing catastrophic forgetting in sequential learning tasks.
method Adaptive method for nonconvex continual learning (NCCL) adjusts step sizes of previous and current tasks.
result Proposed adaptive method achieves same convergence rate as SGD when catastrophic forgetting is suppressed.

In order to mimic the human ability of continual acquisition and transfer of knowledge across various tasks, a learning system needs the capability for continual learning, effectively utilizing the previously acquired skills. As such, the key challenge is to transfer and generalize the knowledge learned from one task t…

2019-08-01abs ↗pdf ↗

CAM-GAN improves GANs for continual learning with efficient feature map transformations.

problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.

Most artificial intelligence models have limiting ability to solve new tasks faster, without forgetting previously acquired knowledge. The recently emerging paradigm of continual learning aims to solve this issue, in which the model learns various tasks in a sequential fashion. In this work, a novel approach for contin…

2018-05-31abs ↗pdf ↗

This paper develops variational continual learning (VCL), a simple but general framework for continual learning that fuses online variational inference (VI) and recent advances in Monte Carlo VI for neural networks. The framework can successfully train both deep discriminative models and deep generative models in compl…

2017-10-29abs ↗pdf ↗

Study shows memory needs grow with task sequence length in continual learning.

problem Challenges in retaining aptitude for multiple learning tasks sequentially.
method Complexity-theoretic study using communication complexity and multiplicative weights update.
result Memory needs grow linearly with task sequence length, suggesting intractability.

Continual Learning is a learning paradigm where learning systems are trained with sequential or streaming tasks. Two notable directions among the recent advances in continual learning with neural networks are (ii) variational Bayes based regularization by learning priors from previous tasks, and, (iiii) learning the s…

2019-12-08abs ↗pdf ↗

Improved rates for continual learning using SGD and last-iterate analysis.

problem Forgetting in overparameterized models after fitting multiple tasks.
method Developed novel SGD upper bounds for continual linear models and analyzed their performance.
result Established universal forgetting rates for continual learning.

A new framework for federated continual learning reduces interference and improves performance.

problem Learning from a sequence of tasks with limited data from each client.
method Federated Weighted Inter-client Transfer (FedWeIT) framework.
result FedWeIT significantly outperforms existing methods with reduced communication cost.

Sparse routing networks with co-training prevent catastrophic forgetting in continual learning.

problem Catastrophic forgetting in neural networks trained on a sequence of tasks.
method Sparse routing networks with co-training to minimize interference between dissimilar tasks.
result Sparse routing networks with co-training outperform densely connected networks on benchmarks.

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 ↗

Catastrophic forgetting is the notorious vulnerability of neural networks to the change of the data distribution while learning. This phenomenon has long been considered a major obstacle for allowing the use of learning agents in realistic continual learning settings. A large body of continual learning research assumes…

2018-03-27abs ↗pdf ↗

Proposes a framework for semi-supervised continual learning from sequentially arriving data.

problem Learning from data with changing task distribution over time, especially in domains with a mix of labeled and unlabeled data.
method Meta-Consolidation for Continual Semi-Supervised Learning (MCSSL) framework with a hypernetwork and semi-supervised auxiliary classifier.
result Significant improvements in continual semi-supervised learning setting.

Reliable and effective multi-task learning is a prerequisite for the development of robotic agents that can quickly learn to accomplish related, everyday tasks. However, in the reinforcement learning domain, multi-task learning has not exhibited the same level of success as in other domains, such as computer vision. In…

2018-02-03abs ↗pdf ↗

Study on neural networks' performance in sequential task learning.

problem Understanding the performance of neural networks in sequential task learning.
method Theoretical analysis of generalization performance in continual learning using statistical mechanical analysis of kernel ridge-less regression.
result Characteristic transitions from positive to negative transfer observed in neural networks.

New insights into continual learning for deep models, showing convergence issues but local linear solutions.

problem Challenges in continual learning for homogeneous deep models.
method Sequential projections onto task margin sets, leveraging nonconvex projection theory.
result Local linear convergence under certain conditions for homogeneous deep networks.

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.

Continual lifelong learning is essential to many applications. In this paper, we propose a simple but effective approach to continual deep learning. Our approach leverages the principles of deep model compression, critical weights selection, and progressive networks expansion. By enforcing their integration in an itera…

2019-10-15abs ↗pdf ↗

Continual learning aims to learn new tasks without forgetting previously learned ones. This is especially challenging when one cannot access data from previous tasks and when the model has a fixed capacity. Current regularization-based continual learning algorithms need an external representation and extra computation …

2019-06-06abs ↗pdf ↗

Neural network tackles continual learning with neuromodulation and local error signals.

problem Catastrophic forgetting in continuous learning.
method Biologically-inspired neural architecture with local learning and neuromodulation, combined with transfer metalearning.
result Superior performance in continual learning tasks compared to other approaches.

Artificial neural networks have exceeded human-level performance in accomplishing several individual tasks (e.g. voice recognition, object recognition, and video games). However, such success remains modest compared to human intelligence that can learn and perform an unlimited number of tasks. Humans' ability of learni…

2019-10-07abs ↗pdf ↗

New method generates continuous Pareto sets for multi-task learning.

problem Challenges in finding optimal solutions for correlated multi-task learning problems.
method Efficiently generates locally continuous Pareto sets and fronts in multi-objective optimization problems.
result Demonstrates continuous analysis of Pareto optimal solutions in machine learning problems.

Paper tackles continual learning with single-index models, proving regret bounds.

problem Continual learning with single-index models across multiple tasks.
method Proposes a randomized strategy to learn a common single-index and task-specific link functions.
result Proves regret bounds for the proposed strategy under various loss function assumptions.

We propose a method for tackling catastrophic forgetting in deep reinforcement learning that is \textit{agnostic} to the timescale of changes in the distribution of experiences, does not require knowledge of task boundaries, and can adapt in \textit{continuously} changing environments. In our \textit{policy consolidati…

2019-02-01abs ↗pdf ↗

Extends neural network approximations to guarantee continuity of real-world learning tasks.

problem Guaranteeing continuity of real-world learning tasks given by conditional expectations.
method Establishing conditions on learning tasks that guarantee their continuity under a factorization of the data-generating process.
result Conditions guaranteeing the continuity of practically any derived learning task.

This paper tackles online reinforcement learning for unseen tasks with unknown boundaries.

problem Real-world tasks violate assumptions of task distributions, independence, and clear task delineations.
method A mixture of Gaussian Processes models different dynamics, and a transition prior handles temporal dependencies.
result The approach reliably handles task distribution shifts and outperforms alternatives in non-stationary tasks.

Residual Continual Learning prevents forgetting in sequential tasks.

problem Preventing catastrophic forgetting in sequential learning of multiple tasks.
method ResCL reparameterizes network parameters by combining original and fine-tuned networks, keeping network size constant.
result ResCL achieves state-of-the-art performance in various continual learning scenarios.

New approach to continual learning prioritizes adaptation over retention.

problem Catastrophic forgetting in lifelong learning models.
method Formalized CL as an online optimization problem, introduced Transfer Efficiency, and derived a Critical Task Duration.
result Retention can hinder real-time adaptation in non-stationary environments.

Learning a set of tasks over time, also known as continual learning (CL), is one of the most challenging problems in artificial intelligence. While recent approaches achieve some degree of CL in deep neural networks, they either (1) grow the network parameters linearly with the number of tasks, (2) require storing trai…

2018-05-25abs ↗pdf ↗

AGS-CL selectively updates penalties based on node importance for continual learning.

problem Catastrophic forgetting in continual learning.
method Adaptive Group Sparsity (AGS) with proximal gradient descent.
result Significantly outperforms baselines on various continual learning benchmarks.

Continual learning is the ability to sequentially learn over time by accommodating knowledge while retaining previously learned experiences. Neural networks can learn multiple tasks when trained on them jointly, but cannot maintain performance on previously learned tasks when tasks are presented one at a time. This pro…

2018-10-24abs ↗pdf ↗