arXiv (All)
open access
MAEM: Mitigating Recency Bias via a Replay-Free, Capacity-Controlled Dynamic Mixture of Experts for Class-Incremental Graph Learning
Graph Neural Networks (GNNs) excel on graph-structured data but suffer catastrophic forgetting when classes arrive sequentially. In class-incremental graph learning, predictions are often dominated by recently learned classes, causing severe recency bias. Dynamic expansion can isolate knowledge acro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- CLARE: Scalable Class-Incremental Continual Learning via a Sparsity-Based Framework#1123430
- CLARE: Scalable Class-Incremental Continual Learning via a Sparsity-Based Framework#919413
- GraphMinNet: Learning dependencies in graphs with light complexity minimal architecture.#1347283
- Distilling Graph Geometry: Knowledge Gap from GNNs to MLPs#1234945
- Distilling Graph Geometry: Knowledge Gap from GNNs to MLPs#1227314
Record · ID 1355169
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive