Instance-Conditional Timescales of Decay for Non-Stationary Learning
Not on the map. Why?
Abstract (arXiv)
Slow concept drift is a ubiquitous, yet under-studied problem in practical machine learning systems. In such settings, although recent data is more indicative of future data, naively prioritizing recent instances runs the risk of losing valuable information from the past. We propose an optimization-driven approach towards balancing instance importance over large training windows. First, we model instance relevance using a mixture of multiple timescales of decay, allowing us to capture rich temporal trends. Second, we learn an auxiliary scorer model that recovers the appropriate mixture of timescales as a function of the instance itself. Finally, we propose a nested optimization objective for learning the scorer, by which it maximizes forward transfer for the learned model. Experiments on a large real-world dataset of 39M photos over a 9 year period show upto 15% relative gains in accuracy compared to other robust learning baselines. We replicate our gains on two collections of real-world datasets for non-stationary learning, and extend our work to continual learning settings where, too, we beat SOTA methods by large margins.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 38 of its 59 references that are in the map. First posted on arXiv 12 Dec 2022.
Builds on
38 of 59 references.
References · 38
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
- 2019Invariant Risk Minimizationcited by 1,832
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2019Introduction to Online Convex Optimizationcited by 793
26 more
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2019Three scenarios for continual learningcited by 610
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 376
- 2019Optimizing Millions of Hyperparameters by Implicit Differentiationcited by 303
- 2019Adversarial Domain Adaptation with Domain Mixupcited by 250
- 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
- 2018Task-Free Continual Learningcited by 219
- 2017Incremental Learning of Object Detectors without Catastrophic Forgettingcited by 208
- 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
- 2021Efficient and Modular Implicit Differentiationcited by 199
- 2020Continual Prototype Evolution: Learning Online from Non-Stationary Data Streamscited by 143
- 2018Adaptive Online Learning in Dynamic Environmentscited by 130
- 2015Strongly Adaptive Online Learningcited by 102
- 2022The CLEAR Benchmark: Continual LEArning on Real-World Imagerycited by 92
- 2022Wild-Time: A Benchmark of in-the-Wild Distribution Shift over Timecited by 85
- 2020Imbalanced Continual Learning with Partitioning Reservoir Samplingcited by 71
- 2021Learning Fast Sample Re-weighting Without Reward Datacited by 69
- 2021Online Continual Learning with Natural Distribution Shifts: An Empirical Study with Visual Datacited by 67
- 2018Task Agnostic Continual Learning Using Online Variational Bayescited by 61
- 2020Adaptive Regret for Control of Time-Varying Dynamicscited by 38
- 2018The Many Faces of Exponential Weights in Online Learningcited by 33
- 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
- 2022Improving Task-free Continual Learning by Distributionally Robust Memory Evolutioncited by 29
- 2020Learning Soft Labels via Meta Learningcited by 27
- 2022Adaptive Mixing of Auxiliary Losses in Supervised Learningcited by 5
- 2018Dynamic Adaptation on Non-Stationary Visual Domainscited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1.
3 papers.