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

4208411,2611,681 · Jun 202019922001200920172026
48 results for class incremental learning

Paper tackles few-shot class-incremental learning with a neural gas network.

problem Incrementally learn new classes from very few labelled samples without forgetting old classes.
method Proposes TOPIC framework using a neural gas network to preserve class topology and adapt to new samples.
result Significantly outperforms other methods on CIFAR100, miniImageNet, and CUB200 datasets.

A new generative classification strategy outperforms existing methods in class-incremental learning.

problem Incrementally training deep neural networks to recognize new classes is challenging.
method Proposes learning the joint distribution p(x,y) and performing classification using Bayes' rule, implemented with variational autoencoders and importance sampling.
result Performs very well on continual learning benchmarks, outperforming existing baselines.

PEC improves class-incremental learning by measuring prediction error.

problem Challenges in class-incremental learning, particularly forgetting and class imbalance.
method Prediction Error-based Classification (PEC) measures prediction error of a model trained on data from a class.
result PEC outperforms other methods in class-incremental learning across multiple benchmarks.

Meta-learning approach improves object detection on new classes.

problem Deterioration of object detection performance on old classes in incremental settings.
method Meta-learning to reshape model gradients for optimal task adaptation.
result Meta-learning approach outperforms state-of-the-art methods in incremental object detection.

Paper tackles class-incremental time series classification with dual-stream feature extraction.

problem Class-incremental continual learning for multivariate time series data.
method Dual-stream feature extraction pipeline combining deep temporal embedding features and statistical features.
result Competitive average accuracy across multiple datasets with low forgetting rates.

A major open problem on the road to artificial intelligence is the development of incrementally learning systems that learn about more and more concepts over time from a stream of data. In this work, we introduce a new training strategy, iCaRL, that allows learning in such a class-incremental way: only the training dat…

2016-11-23abs ↗pdf ↗

TKIL improves class-balanced performance in incremental learning.

problem Catastrophic forgetting in sequential learning tasks.
method Introduces Tangent Kernel for Incremental Learning (TKIL) based on Neural Tangent Kernel (NTK).
result TKIL achieves better overall accuracy and variance across classes.

OpenHAIV integrates OOD detection and incremental learning for open-world models.

problem Challenges in open-world recognition, especially in model knowledge updates and OOD detection.
method Unified pipeline combining OOD detection, new class discovery, and incremental fine-tuning.
result Models can autonomously acquire and update knowledge in open-world environments.

CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.

problem Handling unknown classes and model update in streaming data with new classes.
method CILF uses decoupled prototype based loss for intra-class and inter-class structure improvement, and a learnable curriculum clustering operator for adaptive embedding.
result CILF effectively detects multiple novel classes and mitigates embedding confusion, while updating the model without catastrophic forgetting.

Paper proposes a new method to select memory data for online class-incremental learning.

problem Selecting which buffered images to replay for online class-incremental learning.
method Adversarial Shapley value scoring method to preserve latent decision boundaries.
result Proposed ASER method provides competitive or improved performance compared to state-of-the-art methods.

In class-incremental learning, a model learns continuously from a sequential data stream in which new classes occur. Existing methods often rely on static architectures that are manually crafted. These methods can be prone to capacity saturation because a neural network's ability to generalize to new concepts is limite…

2019-09-14abs ↗pdf ↗

Paper tackles class-incremental learning by combining self-supervised learning to mitigate prior information loss.

problem Catastrophic forgetting and prior information loss in class-incremental learning.
method Combining self-supervised learning with class-incremental learning to mitigate prior information loss.
result Proposed method outperforms state-of-the-art methods.

As we enter into the big data age and an avalanche of images have become readily available, recognition systems face the need to move from close, lab settings where the number of classes and training data are fixed, to dynamic scenarios where the number of categories to be recognized grows continuously over time, as we…

2016-04-08abs ↗pdf ↗

Transformers learn to integrate information from past positions incrementally, specializing heads in distinct patterns.

problem How transformers learn to integrate information from multiple past positions with varying statistical significance.
method High-order Markov chain task, incremental learning, sparse attention patterns, simplified differential equations, stage-wise convergence, early stopping as regularizer.
result Transformers learn to specialize heads in distinct patterns, shifting from competitive to cooperative learning dynamics.

Gen1S learns novel classes with 1-shot data using residual space and generative models.

problem Learning new classes with limited data in a growing dataset.
method Mapping embeddings to a residual space, using generative models to learn multi-modal distribution, and applying it as a structural prior.
result Consistent improvement over state-of-the-art methods in recognizing novel classes.

It was recently shown that architectural, regularization and rehearsal strategies can be used to train deep models sequentially on a number of disjoint tasks without forgetting previously acquired knowledge. However, these strategies are still unsatisfactory if the tasks are not disjoint but constitute a single increme…

2018-06-22abs ↗pdf ↗

Improves few-shot learning for hierarchical data using hyperbolic space.

problem Few-shot class-incremental learning for hierarchical data.
method Contrastive learning in hyperbolic space, Poincaré ball model, hyperbolic contrastive loss, maximum entropy distribution.
result Effective improvement of coarse and fine class accuracies in few-shot conditions.

FedGTEA learns new tasks in federated learning with task embeddings and alignment.

problem Federated class-incremental learning with task-specific knowledge and model uncertainty.
method Cardinality-Agnostic Task Encoder (CATE) for Gaussian task embeddings, 2-Wasserstein distance for inter-task alignment.
result FedGTEA achieves superior classification performance and mitigates forgetting.

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.

We consider object recognition in the context of lifelong learning, where a robotic agent learns to discriminate between a growing number of object classes as it accumulates experience about the environment. We propose an incremental variant of the Regularized Least Squares for Classification (RLSC) algorithm, and expl…

2016-05-17abs ↗pdf ↗

Cross-validation (CV) is one of the main tools for performance estimation and parameter tuning in machine learning. The general recipe for computing CV estimate is to run a learning algorithm separately for each CV fold, a computationally expensive process. In this paper, we propose a new approach to reduce the computa…

2015-06-30abs ↗pdf ↗

Efficiently preserves old class knowledge in memory-limited settings.

problem Catastrophic forgetting in class-incremental learning.
method Memory-efficient exemplar preserving scheme and domain-compatible feature extractors.
result Low-fidelity exemplar samples can replace high-fidelity ones with less memory cost.

In recent years, more machine learning algorithms have been applied to odor classification. These odor classification algorithms usually assume that the training datasets are static. However, for some odor recognition tasks, new odor classes continually emerge. That is, the odor datasets are dynamically growing while b…

2018-01-08abs ↗pdf ↗

Paper tackles graph class-incremental learning with task profiling and prompting.

problem Challenges in separating classes from different tasks in graph CIL.
method Laplacian smoothing-based task profiling and graph prompting approach.
result 100% task ID prediction accuracy and significant performance improvement.

Machine learning classifiers are often trained to recognize a set of pre-defined classes. However, in many applications, it is often desirable to have the flexibility of learning additional concepts, with limited data and without re-training on the full training set. This paper addresses this problem, incremental few-s…

2018-10-16abs ↗pdf ↗

Develops a framework for continual learning in anomaly detection.

problem Deterioration of monitoring performance due to new defect categories.
method Pseudo replay-based class incremental learning with oversampling.
result Enhanced monitoring performance and flexibility in model architecture.

Sampling is a fundamental technique, and sampling without replacement is often desirable when duplicate samples are not beneficial. Within machine learning, sampling is useful for generating diverse outputs from a trained model. We present an elegant procedure for sampling without replacement from a broad class of rand…

2020-02-21abs ↗pdf ↗

Continual learning consists in incrementally training a model on a sequence of datasets and testing on the union of all datasets. In this paper, we examine continual learning for the problem of sound classification, in which we wish to refine already trained models to learn new sound classes. In practice one does not w…

2019-06-03abs ↗pdf ↗

Paper proposes CNE-net to tackle incremental learning in (T)ACSA tasks.

problem Catastrophic forgetting in multi-task incremental learning for (T)ACSA.
method Category Name Embedding network (CNE-net) with shared encoder and decoder.
result State-of-the-art performance on (T)ACSA benchmark datasets.

We analyze a fast incremental aggregated gradient method for optimizing nonconvex problems of the form minxifi(x)\min_x \sum_i f_i(x). Specifically, we analyze the SAGA algorithm within an Incremental First-order Oracle framework, and show that it converges to a stationary point provably faster than both gradient descent and s…

2016-03-19abs ↗pdf ↗