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

115229344458 · Jun 202019922001200920172026
48 results for continual adaptation

CoDAG combines domain adaptation and generalization for unsupervised continual domain shift learning.

problem Acquiring knowledge in unsupervised continual domain shift learning.
method Complementary Domain Adaptation and Generalization (CoDAG) framework.
result CoDAG outperforms state-of-the-art models in all datasets and evaluation metrics.

This paper describes a reference architecture for self-maintaining systems that can learn continually, as data arrives. In environments where data evolves, we need architectures that manage Machine Learning (ML) models in production, adapt to shifting data distributions, cope with outliers, retrain when necessary, and …

2019-03-12abs ↗pdf ↗

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.

OSAMD adapts online to changing distributions with limited labels.

problem Models struggle with continual distribution shifts and expensive labeling in changing environments.
method Online Active Continual Adaptation with OSAMD, an online teacher-student structure and margin-based criterion.
result OSAMD achieves favorable dynamic regret bounds under changing environments with limited labels.

ADER addresses continual learning in session-based recommendation by periodically replaying exemplars with adaptive distillation.

problem Catastrophic forgetting in continual learning of session-based recommenders.
method Periodically replaying previous training samples (exemplars) with an adaptive distillation loss.
result ADER consistently outperforms other continual learning techniques and even all historical data at every update cycle.

Proposes a continuous, differentiable model from local adaptive models.

problem Inadequate continuity and differentiability in over-parameterized models.
method A global continuous and differentiable model constructed from weighted averages of locally learned models.
result Achieves faster statistical convergence and improved performance in various settings.

This paper tackles continuous domain adaptation with a new approach.

problem Learning in non-stationary environments, especially domain drift.
method Variational domain-agnostic feature replay, composed of inference, generative, and solver modules.
result Demonstrates the effectiveness of the proposed approach for practical usage.

ReCAP adapts to dynamic financial markets by segmenting and combining policy vectors.

problem Inefficient traditional PM approaches in non-stationary financial markets.
method Integrates continual learning into PM, segmenting regimes and adapting policies.
result Consistently outperforms baselines in real-world financial datasets.

VCoTTA uses variational Bayesian methods to adapt models under continuous domain shifts.

problem Error accumulation in continual test-time adaptation.
method VCoTTA employs variational Bayesian techniques to update a Bayesian Neural Network (BNN) during testing, combining priors from source and teacher models.
result VCoTTA effectively mitigates error accumulation in CTTA, as shown by experimental results on three datasets.

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.

An adaptive clustering algorithm learns from evolving data without manual tuning.

problem Clustering in dynamic data environments where distributions change over time.
method ART-based topological clustering with self-adjusting vigilance parameter.
result The algorithm outperforms state-of-the-art methods in clustering performance and continual learning.

New algorithm improves online learning with reduced discretization.

problem Improving adaptive online learning with refined discretization.
method Continuous time approach to online learning, followed by a new discretization argument.
result Optimal regret bound with O(VT)O(\sqrt{V_T}) dependence on gradient variance.

Dropout has been proven to be an effective algorithm for training robust deep networks because of its ability to prevent overfitting by avoiding the co-adaptation of feature detectors. Current explanations of dropout include bagging, naive Bayes, regularization, and sex in evolution. According to the activation pattern…

2019-11-28abs ↗pdf ↗

LALR adapts learning rate for faster convergence in regression and neural nets.

problem Finding optimal learning rates for faster convergence in regression and neural networks.
method Lipschitz continuity theory applied to Mean Absolute Error and Quantile loss functions.
result Adaptive learning rate policy enables up to 20x faster convergence.

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.

SMART combines decision trees and MARS for better regression modeling.

problem High variance in decision trees for continuous relationships, poor performance in MARS for discontinuities.
method SMART uses a decision tree to identify subsets with distinct continuous relationships, then applies MARS to fit these relationships independently.
result SMART improves regression performance over state-of-the-art methods in capturing discontinuities and continuous relationships.

Ada-BKB optimizes black-box functions on continuous domains with adaptive discretization.

problem Optimizing functions with continuous domains using Gaussian process optimization.
method Adaptive discretization of the function domain to avoid non-convex optimization costs.
result Ada-BKB algorithm runs in O(T2dexteff2)O(T^2 d_ ext{eff}^2), significantly faster than existing methods.

Paper presents a method for efficient robot adaptation using fine-tuning.

problem Continuous adaptation of robot learning systems in real-world scenarios.
method Fine-tuning previously learned policies using off-policy reinforcement learning.
result Fine-tuning leads to substantial performance gains and adaptation to new conditions.

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.

A new buffer system improves continual learning in RL agents by adapting to changing environments.

problem Improving RL agents' ability to learn from changing environments over time.
method Multi-timescale replay buffer combined with invariant risk minimization.
result The method shows improvement over baselines in continual learning settings.

CoLoRA models predict PDE solutions quickly and accurately with minimal data.

problem Efficiently modeling PDE solutions with limited data.
method Continuous low-rank adaptation of neural networks trained on offline data.
result Predictions are orders of magnitude faster and more accurate than classical methods.

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 ↗

Bayesian Federated Learning improves model reliability in dynamic environments.

problem Uncertainty quantification and robust adaptation in distributed learning.
method Proposes a continual BFL framework using SGLD for sequential updates and continual learning challenges.
result Continual Bayesian updates preserve knowledge and adapt to evolving data.

Learning and adapting to new distributions or learning new tasks sequentially without forgetting the previously learned knowledge is a challenging phenomenon in continual learning models. Most of the conventional deep learning models are not capable of learning new tasks sequentially in one model without forgetting the…

2019-05-20abs ↗pdf ↗

Local EGOP learns functions varying along a few directions.

problem Efficient estimation of functions varying along a few directions in high-dimensional space.
method Local EGOP learning, a recursive algorithm using EGOP quadratic form as metric and inverse-covariance.
result Local EGOP learning achieves intrinsic dimensional learning rates under noisy manifold hypothesis.

Approaches to continual learning aim to successfully learn a set of related tasks that arrive in an online manner. Recently, several frameworks have been developed which enable deep learning to be deployed in this learning scenario. A key modelling decision is to what extent the architecture should be shared across tas…

2019-11-21abs ↗pdf ↗

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.

Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.

problem Adversarial online nonparametric regression with general convex losses.
method Parameter-free learning algorithm leveraging chaining trees to compete against H{ö}lder functions, dynamically tracking and adapting to local smoothness variations.
result First computationally efficient algorithm with locally adaptive optimal rates for online regression in an adversarial setting.

Novel Bayesian meta-reinforcement learning framework improves traffic signal control robustness.

problem Lack of robustness and stability in adaptation for traffic signal control.
method Value-based Bayesian meta-reinforcement learning framework BM-DQN with fast-adaptation variation and DQN fast-update advantage.
result Framework adapts more quickly and robustly to new scenarios than previous methods.

Algorithm learns diffusion processes with high-dimensional state spaces.

problem Stochastic control of unbounded diffusion processes with high-dimensional state spaces.
method Adaptive partitioning and learning algorithm that refines discretization based on estimation bias and statistical confidence.
result Established regret bounds that depend on problem parameters, extending to unbounded diffusion processes.