MIST fixes unreliable splits in streaming decision trees for class-incremental learning by replacing Hoeffding-style bounds with a K-independent McDiarmid radius on Gini, plus Bayesian parent-to-child inheritance and per-leaf quantile sketches.
Learning without forgetting.IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(12):2935–2947
3 Pith papers cite this work, alongside 3,056 external citations. Polarity classification is still indexing.
3
Pith papers citing it
3,056
external citations · external index
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
MeMo encodes new knowledge into a separate memory model that integrates with frozen LLMs, showing strong performance on QA benchmarks while avoiding catastrophic forgetting and working without access to model weights.
Fine-tuning a pop-pretrained Music Transformer on jazz recovers pop chord accuracy to baseline when mixing in about 2.5K pop samples alongside the jazz data.
citing papers explorer
No citing papers match the current filters.