The unreasonable effectiveness of randomized representations in online continual graph learning

DOI10.1007/S10994-026-07128-5MaRDI QIDQ7409484zbMATH OpenFDO

Authors Giovanni Donghi, Daniele Zambon, Luca Pasa, Cesare Alippi, Nicolò Navarin

Publication date 2026

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10994-026-07128-5

zbMATH Keywords

continual learninggraph neural networkonline learningrandomized feature extraction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A comparative analysis of support vector machines and extreme learning machines
• scientific article; zbMATH DE number 2080487 (Why is no real title available?)
• Overcoming catastrophic forgetting in neural networks
• Trends in extreme learning machines: a review

This page was built for publication: The unreasonable effectiveness of randomized representations in online continual graph learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409484)