Verse: Virtual-gradient aware streaming lifelong learning with anytime inference
Open accessAbstract
Lifelong learning or continual learning is the problem of training an AI agent continuously while also preventing it from forgetting its previously acquired knowledge. Streaming lifelong learning is a challenging setting of lifelong learning with the goal of continuous learning in a dynamic non-stationary environment without forgetting. We introduce a novel approach to lifelong learning, which is streaming (observes each training example only once), requires a single pass over the data, can learn in a class-incremental manner, and can be evaluated on-the-fly (anytime inference). To accomplish these, we propose a novel virtual gradients based approach for continual representation learning which adapts to each new example while also generalizing well on past data to prevent catastrophic forgetting. Our approach also leverages an exponential-moving-average-based semantic memory to further enhance performance. Experiments on diverse datasets with temporally correlated observations demonstrate our method’s efficacy and superior performance over existing methods.
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.
Integrity signals
Registry
Cites
Statistics
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.
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?
AI Agents often suffer from single-pass inference limitations.
“AI Agents often suffer from single-pass inference limitations [222].”
From AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges (2026) · cites this paper as [222]
The Introduction says some online continual-learning methods cannot perform anytime inference without fine-tuning. But it describes a single pass as a requirement for learning from new samples, not as an inference limitation; the claim conflates those two points. (LLM, conf=0.86)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474 · see citing works
Memory Aware Synapses: Learning What (not) to Forget
Aljundi, R., Babiloni, F., Elhoseiny, M., Rohrbach, M., & Tuytelaars, T. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01219-9_9 · Cited by 1,590 · see citing works
Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigence
Chaudhry, A., Dokania, P. K., Ajanthan, T., & Torr, P. H. S. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01252-6_33 · Cited by 1,091 · see citing works
IL2M: Class Incremental Learning With Dual Memory
Belouadah, E., & Popescu, A. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00067 · Cited by 302 · see citing works
Topology-Preserving Class-Incremental Learning
Tao, X., Chang, X., Hong, X., Wei, X., & Gong, Y. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58529-7_16 · Cited by 162 · see citing works
Flagged first, then by citations
Research works printed but not linked: 56
- S. Thrun, "Lifelong learning algorithms," in Learning to learn. Springer, 1998, pp. 181-209.
- J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ramalho, A. Grabska-Barwinska, et al., "Overcoming catastrophic forgetting in neural networks," Pro- ceedings of the national academy of sciences, vol. 114, no. 13, pp. 3521-3526, 2017.
- Z. Li and D. Hoiem, "Learning without forgetting," IEEE transactions on pattern analysis and machine intelligence, vol. 40, no. 12, pp. 2935-2947, 2017.
- Y. Wu, Y. Chen, L. Wang, Y. Ye, Z. Liu, Y. Guo, and Y. Fu, "Large scale incremental learning," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019, pp. 374-382.
- C. Wu, L. Herranz, X. Liu, J. van de Weijer, B. Raducanu, et al., "Memory replay gans: Learning to generate new categories without forgetting," in Advances In Neural Information Processing Systems, 2018, pp. 5962-5972.
- R. Kemker and C. Kanan, "Fearnet: Brain-inspired model for incre- mental learning," arXiv preprint arXiv:1711.10563, 2017. · arXiv
- A. Prabhu, P. H. Torr, and P. K. Dokania, "Gdumb: A simple ap- proach that questions our progress in continual learning," in European Conference on Computer Vision. Springer, 2020, pp. 524-540.
- T. L. Hayes, N. D. Cahill, and C. Kanan, "Memory efficient experience replay for streaming learning," in 2019 International Conference on Robotics and Automation (ICRA). IEEE, 2019, pp. 9769-9776.
- T. L. Hayes, K. Kafle, R. Shrestha, M. Acharya, and C. Kanan, "Remind your neural network to prevent catastrophic forgetting," arXiv preprint arXiv:1910.02509, 2019. · arXiv
- S. Banerjee, V. K. Verma, and V. P. Namboodiri, "Streaming lifelong learning with any-time inference," arXiv preprint arXiv:2301.11892, 2023. · arXiv
- F. Zenke, B. Poole, and S. Ganguli, "Continual learning through synap- tic intelligence," in Proceedings of the 34th International Conference on Machine Learning-Volume 70. JMLR. org, 2017, pp. 3987-3995.
- C. V. Nguyen, Y. Li, T. D. Bui, and R. E. Turner, "Variational continual learning," arXiv preprint arXiv:1710.10628, 2017. · arXiv
- D. Lopez-Paz and M. Ranzato, "Gradient episodic memory for contin- ual learning," in Advances in Neural Information Processing Systems, 2017, pp. 6467-6476.
- A. Chaudhry, M. Ranzato, M. Rohrbach, and M. Elhoseiny, "Efficient lifelong learning with a-gem," arXiv preprint arXiv:1812.00420, 2018. · arXiv
- A. Chaudhry, M. Rohrbach, M. Elhoseiny, T. Ajanthan, P. K. Dokania, P. H. Torr, and M. Ranzato, "On tiny episodic memories in continual learning," arXiv preprint arXiv:1902.10486, 2019. · arXiv
- P. Buzzega, M. Boschini, A. Porrello, D. Abati, and S. Calderara, "Dark experience for general continual learning: a strong, simple baseline," arXiv preprint arXiv:2004.07211, 2020. · arXiv
- E. Arani, F. Sarfraz, and B. Zonooz, "Learning fast, learning slow: A general continual learning method based on complementary learning system," arXiv preprint arXiv:2201.12604, 2022. · arXiv
- A. Ruiz and J. Verbeek, "Anytime inference with distilled hierarchical neural ensembles," in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 11, 2021, pp. 9463-9471.
- G. Huang, D. Chen, T. Li, F. Wu, L. Van Der Maaten, and K. Q. Weinberger, "Multi-scale dense networks for resource efficient image classification," arXiv preprint arXiv:1703.09844, 2017. · arXiv
- H. Li, H. Zhang, X. Qi, R. Yang, and G. Huang, "Improved techniques for training adaptive deep networks," in Proceedings of the IEEE/CVF international conference on computer vision, 2019, pp. 1891-1900.
- L. Yang, Y. Han, X. Chen, S. Song, J. Dai, and G. Huang, "Resolution adaptive networks for efficient inference," in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2020, pp. 2369-2378.
- C. Zhang, M. Ren, and R. Urtasun, "Graph hypernetworks for neural architecture search," arXiv preprint arXiv:1810.05749, 2018. · arXiv
- H. Koh, D. Kim, J.-W. Ha, and J. Choi, "Online continual learning on class incremental blurry task configuration with anytime inference," arXiv preprint arXiv:2110.10031, 2021. · arXiv
- V. Lomonaco and D. Maltoni, "Core50: a new dataset and benchmark for continuous object recognition," in Conference on Robot Learning. PMLR, 2017, pp. 17-26.
- A. Tarvainen and H. Valpola, "Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results," Advances in neural information processing systems, vol. 30, 2017.
- Q. Cai, Y. Pan, C.-W. Ngo, X. Tian, L. Duan, and T. Yao, "Explor- ing object relation in mean teacher for cross-domain detection," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019, pp. 11 457-11 466.
- J. Deng, W. Li, Y. Chen, and L. Duan, "Unbiased mean teacher for cross-domain object detection," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2021, pp. 4091-4101.
- Z. Chen, L. Zhu, L. Wan, S. Wang, W. Feng, and P.-A. Heng, "A multi-task mean teacher for semi-supervised shadow detection," in Proceedings of the IEEE/CVF Conference on computer vision and pattern recognition, 2020, pp. 5611-5620.
- R. F. Thompson and D. J. Krupa, "Organization of memory traces in the mammalian brain," Annual review of neuroscience, vol. 17, no. 1, pp. 519-549, 1994.
- D. J. Linden, "Long-term synaptic depression in the mammalian brain," Neuron, vol. 12, no. 3, pp. 457-472, 1994.
- A. Holtmaat and K. Svoboda, "Experience-dependent structural synap- tic plasticity in the mammalian brain," Nature Reviews Neuroscience, vol. 10, no. 9, pp. 647-658, 2009.
- G. Hinton, O. Vinyals, and J. Dean, "Distilling the knowledge in a neural network," arXiv preprint arXiv:1503.02531, 2015. · arXiv
- L. Zhang, J. Song, A. Gao, J. Chen, C. Bao, and K. Ma, "Be your own teacher: Improve the performance of convolutional neural networks via self distillation," in Proceedings of the IEEE/CVF international conference on computer vision, 2019, pp. 3713-3722.
- R. Aljundi, P. Chakravarty, and T. Tuytelaars, "Expert gate: Lifelong learning with a network of experts," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2017, pp. 3366-3375.
- H. Shin, J. K. Lee, J. Kim, and J. Kim, "Continual learning with deep generative replay," in Advances in Neural Information Processing Systems, 2017, pp. 2990-2999.
- R. Aljundi, M. Rohrbach, and T. Tuytelaars, "Selfless sequential learning," arXiv preprint arXiv:1806.05421, 2018. · arXiv
- A. Rios and L. Itti, "Closed-loop memory gan for continual learning," arXiv preprint arXiv:1811.01146, 2018. · arXiv
- S. Hou, X. Pan, C. C. Loy, Z. Wang, and D. Lin, "Learning a unified classifier incrementally via rebalancing," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019, pp. 831-839.
- J. Yoon, E. Yang, J. Lee, and S. J. Hwang, "Lifelong learning with dynamically expandable networks," arXiv preprint arXiv:1708.01547, 2017. · arXiv
- V. K. Verma, K. J. Liang, N. Mehta, P. Rai, and L. Carin, "Efficient feature transformations for discriminative and generative continual learning," in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2021, pp. 13 865-13 875.
- R. Aljundi, M. Lin, B. Goujaud, and Y. Bengio, "Gradient based sample selection for online continual learning," in Advances in Neural Information Processing Systems, 2019, pp. 11 816-11 825.
- R. Aljundi, L. Caccia, E. Belilovsky, M. Caccia, M. Lin, L. Charlin, and T. Tuytelaars, "Online continual learning with maximally inter- fered retrieval," arXiv preprint arXiv:1908.04742, 2019. · arXiv
- S.-A. Rebuffi, A. Kolesnikov, G. Sperl, and C. H. Lampert, "icarl: Incremental classifier and representation learning," in Proceedings of the IEEE conference on Computer Vision and Pattern Recognition, 2017, pp. 2001-2010.
- J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, "Imagenet: A large-scale hierarchical image database," in 2009 IEEE conference on computer vision and pattern recognition. Ieee, 2009, pp. 248-255.
- O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein, et al., "Imagenet large scale visual recognition challenge," International journal of computer vision, vol. 115, no. 3, pp. 211-252, 2015.
- I. J. Goodfellow, M. Mirza, D. Xiao, A. Courville, and Y. Bengio, "An empirical investigation of catastrophic forgetting in gradient-based neural networks," arXiv preprint arXiv:1312.6211, 2013. · arXiv
- M. McCloskey and N. J. Cohen, "Catastrophic interference in connec- tionist networks: The sequential learning problem," in Psychology of learning and motivation. Elsevier, 1989, vol. 24, pp. 109-165.
- J. S. Vitter, "Random sampling with a reservoir," ACM Transactions on Mathematical Software (TOMS), vol. 11, no. 1, pp. 37-57, 1985.
- Z. Allen-Zhu and Y. Li, "Towards understanding ensemble, knowl- edge distillation and self-distillation in deep learning," arXiv preprint arXiv:2012.09816, 2020. · arXiv
- H. Mobahi, M. Farajtabar, and P. Bartlett, "Self-distillation amplifies regularization in hilbert space," Advances in Neural Information Pro- cessing Systems, vol. 33, pp. 3351-3361, 2020.
- L. Zhang, C. Bao, and K. Ma, "Self-distillation: Towards efficient and compact neural networks," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 44, no. 8, pp. 4388-4403, 2021.
- S. Fanello, C. Ciliberto, M. Santoro, L. Natale, G. Metta, L. Rosasco, and F. Odone, "icub world: Friendly robots help building good vision data-sets," in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2013, pp. 700-705.
- G. Pasquale, C. Ciliberto, F. Odone, L. Rosasco, and L. Natale, "Teaching icub to recognize objects using deep convolutional neural networks," in Machine Learning for Interactive Systems. PMLR, 2015, pp. 21-25.
- A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, et al., "Pytorch: An imperative style, high-performance deep learning library," in Advances in neural information processing systems, 2019, pp. 8026-8037.
- G. Gupta, K. Yadav, and L. Paull, "Look-ahead meta learning for con- tinual learning," Advances in Neural Information Processing Systems, vol. 33, pp. 11 588-11 598, 2020.
- C. Finn, P. Abbeel, and S. Levine, "Model-agnostic meta-learning for fast adaptation of deep networks," in International conference on machine learning. PMLR, 2017, pp. 1126-1135.
Cited by
Sorted by citations
AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges
Sapkota, R., Roumeliotis, K. I., & Karkee, M. (2026) · Information Fusion · doi:10.1016/j.inffus.2025.103599 · Cited by 244 · see citing works
AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges
Sapkota, R., Roumeliotis, K. I., & Karkee, M. (2025) · SuperIntelligence - Robotics - Safety & Alignment · doi:10.70777/si.v2i3.15161 · Cited by 186 · see citing works
- Authors
- Banerjee, S., Verma, V. K., Mukherjee, A., Gupta, D., Namboodiri, V. P., & Rai, P.
- Affiliations
- Indian Institute of Technology Kanpur (IN)
- Amazon (United States) (US)
- University of Bath (GB)
- Venue
- 2024 IEEE International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2024-05-13
- Pages
- 493-500
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W4401417120
- Cited by
- 3
- References
- 5
- Citations by year
- 2025: 3
- FWCI
- 0.87
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Proceedings - IEEE International Conference on Robotics and Automation/Proceedings (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by-sa)
- Pure (University of Bath) (submittedVersion, cc-by-nd)
- arXiv (Cornell University)
- 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 › Artificial Intelligence › Reinforcement Learning in Robotics
- Keywords
- continual learning, catastrophic forgetting, class-incremental learning, non-stationary environments, exponential moving average, semantic memory, representation learning
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