TY - GEN
T1 - TTMC
T2 - 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, KDD 2026
AU - Han, Yuyang
AU - Li, Ziyu
AU - Su, Diwei
AU - Zhang, Shihao
AU - Li, Qing
AU - Long, Zhiying
AU - Wu, Xia
N1 - Publisher Copyright:
© 2026 Owner/Author.
PY - 2026/8/8
Y1 - 2026/8/8
N2 - Existing Online Continual Learning (OCL) methods, particularly those based on Parameter-Efficient Fine-Tuning (PEFT), predominantly operate under a Static Inference Assumption, which means freezing model parameters immediately after training. This paradigm ignores the inevitable covariate shift in non-stationary test streams, resulting in suboptimal decision boundaries that fail to adapt to the immediate testing context. Furthermore, despite the computational efficiency of current analytic learning approaches, their reliance on Gaussian Random Projection introduces severe geometric distortion and feature aliasing in finite dimensions. Drawing inspiration from the Learning to Memorize at Test Time mechanism and the Pattern Separation process in the hippocampus, we propose Test-Time Memory Calibration (TTMC), a novel gradient-free analytic framework. Unlike traditional approaches that treat memory as a static statistic, TTMC views it as a dynamic associative pool. Specifically, we introduce a transductive calibration mechanism that seamlessly fuses the second-order statistics of the unlabelled test stream into the accumulated long-term memory via a closed-form solution, allowing for real-time alignment with the test distribution. To ensure the geometric stability of this dynamic test-time calibration, we theoretically prove the necessity of substituting random projections with Isometric Orthogonal Projections, which guarantee energy conservation and minimize feature interference. Our empirical evaluation demonstrates that TTMC consistently establishes a new state-of-the-art across diverse benchmarks. Notably, these performance gains are realized with zero backward passes and negligible computational overhead, underscoring the superior efficiency and structural robustness of our dynamic analytic framework. Code is available at https://github.com/hanyuyang99/TTMC.git.
AB - Existing Online Continual Learning (OCL) methods, particularly those based on Parameter-Efficient Fine-Tuning (PEFT), predominantly operate under a Static Inference Assumption, which means freezing model parameters immediately after training. This paradigm ignores the inevitable covariate shift in non-stationary test streams, resulting in suboptimal decision boundaries that fail to adapt to the immediate testing context. Furthermore, despite the computational efficiency of current analytic learning approaches, their reliance on Gaussian Random Projection introduces severe geometric distortion and feature aliasing in finite dimensions. Drawing inspiration from the Learning to Memorize at Test Time mechanism and the Pattern Separation process in the hippocampus, we propose Test-Time Memory Calibration (TTMC), a novel gradient-free analytic framework. Unlike traditional approaches that treat memory as a static statistic, TTMC views it as a dynamic associative pool. Specifically, we introduce a transductive calibration mechanism that seamlessly fuses the second-order statistics of the unlabelled test stream into the accumulated long-term memory via a closed-form solution, allowing for real-time alignment with the test distribution. To ensure the geometric stability of this dynamic test-time calibration, we theoretically prove the necessity of substituting random projections with Isometric Orthogonal Projections, which guarantee energy conservation and minimize feature interference. Our empirical evaluation demonstrates that TTMC consistently establishes a new state-of-the-art across diverse benchmarks. Notably, these performance gains are realized with zero backward passes and negligible computational overhead, underscoring the superior efficiency and structural robustness of our dynamic analytic framework. Code is available at https://github.com/hanyuyang99/TTMC.git.
KW - brain-inspired
KW - class-incremental learning
KW - online continual learning
KW - rehearsal-free
UR - https://www.scopus.com/pages/publications/105051113623
U2 - 10.1145/3770855.3818072
DO - 10.1145/3770855.3818072
M3 - Conference contribution
AN - SCOPUS:105051113623
T3 - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
SP - 1554
EP - 1565
BT - KDD 2026 - Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2
PB - Association for Computing Machinery
Y2 - 9 August 2026 through 13 August 2026
ER -