Cited by 1,091Domain Adaptation and Few-Shot LearningData Stream Mining TechniquesAdvanced Neural Network Applications

The DOI matches its Crossref record; 29 of the 33 references it cites were found in a registry or an index.

Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigence

Open access

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-030-01252-6_33

Cites

29 of 29 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 33 references

Research works printed but not linked: 1

  1. Le Roux, N., Pierre-Antoine, M., Bengio, Y.: Topmoumoute online natural gradient algorithm. In: NIPS (2007)

Cited by

Sorted by citations

Items 801–900 of 1,000

Metadata

Authors
Chaudhry, A., Dokania, P. K., Ajanthan, T., & Torr, P. H. S.
Affiliations
University of Oxford (GB)
Corresponding author
Ajanthan, Thalaiyasingam
Venue
Lecture Notes in Computer Science
Published
2018
Pages
556-572
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2786446225
Cited by
1,091
References
33
Citations by year
2026: 78 · 2025: 182 · 2024: 217 · 2023: 189 · 2022: 135 · 2021: 154 · 2020: 84 · 2019: 45 · 2018: 7
FWCI
29.59
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Engineering and Physical Sciences Research Council (EP/N019474/1, EP/M013774/1)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Data Stream Mining Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
Keywords
incremental learning, catastrophic forgetting, intransigence, path integral, Kullback-Leibler divergence, knowledge preservation, classifier updating

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review