mlsanityData to 14 Oct 2026

Online Deep Learning from Doubly-Streaming Data

arXiv 2204.11793 ↗First posted 25 Apr 2022cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

This paper investigates a new online learning problem with doubly-streaming data, where the data streams are described by feature spaces that constantly evolve, with new features emerging and old features fading away. The challenges of this problem are two folds: 1) Data samples ceaselessly flowing in may carry shifted patterns over time, requiring learners to update hence adapt on-the-fly. 2) Newly emerging features are described by very few samples, resulting in weak learners that tend to make error predictions. A plausible idea to overcome the challenges is to establish relationship between the pre-and-post evolving feature spaces, so that an online learner can leverage the knowledge learned from the old features to better the learning performance on the new features. Unfortunately, this idea does not scale up to high-dimensional media streams with complex feature interplay, which suffers an tradeoff between onlineness (biasing shallow learners) and expressiveness(requiring deep learners). Motivated by this, we propose a novel OLD^3S paradigm, where a shared latent subspace is discovered to summarize information from the old and new feature spaces, building intermediate feature mapping relationship. A key trait of OLD^3S is to treat the model capacity as a learnable semantics, yields optimal model depth and parameters jointly, in accordance with the complexity and non-linearity of the input data streams in an online fashion. Both theoretical analyses and empirical studies substantiate the viability and effectiveness of our proposal.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 33 of its 101 references that are in the map. First posted on arXiv 25 Apr 2022.

Builds on

33 of 101 references.

References · 33

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2013Auto-Encoding Variational Bayescited by 4,053
  5. 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 2,018
  6. 2016Variational Inference: A Review for Statisticianscited by 1,472
  7. 2019A Comprehensive Survey on Transfer Learningcited by 1,160
  8. 2016An overview of gradient descent optimization algorithmscited by 1,033
  9. 2016Deep Networks with Stochastic Depthcited by 979
  10. 2016Deep Variational Information Bottleneckcited by 930
  11. 2015Deep Learning and the Information Bottleneck Principlecited by 802
  12. 2020Learning under Concept Drift: A Reviewcited by 477
21 more
  1. 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 250
  2. 2016FractalNet: Ultra-Deep Neural Networks without Residualscited by 216
  3. 2020The Next Decade in AI: Four Steps Towards Robust Artificial Intelligencecited by 195
  4. 2017Generalization in Deep Learningcited by 146
  5. 2019Online Meta-Learningcited by 137
  6. 2017Online Deep Learning: Learning Deep Neural Networks on the Flycited by 86
  7. 2017Deep Forestcited by 46
  8. 2020Lifelong Learning of Graph Neural Networks for Open-World Node Classificationcited by 22
  9. 2020Online mirror descent and dual averaging: keeping pace in the dynamic casecited by 21
  10. 2021Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approachcited by 20
  11. 2013A Generalized Online Mirror Descent with Applications to Classification and Regressioncited by 19
  12. 2016Relevant sparse codes with variational information bottleneckcited by 17
  13. 2017Learning with Feature Evolvable Streamscited by 15
  14. 2016One-Pass Learning with Incremental and Decremental Featurescited by 13
  15. 2019The History of Digital Spamcited by 11
  16. 2016Adaptive and Scalable Android Malware Detection through Online Learningcited by 8
  17. 2019Prediction with Unpredictable Feature Evolutioncited by 8
  18. 2020Storage Fit Learning with Feature Evolvable Streamscited by 5
  19. 2021GraSSNet: Graph Soft Sensing Neural Networkscited by 5
  20. 2017Learning in High-Dimensional Multimedia Data: The State of the Artcited by 4
  21. 2016HONES: A Fast and Tuning-free Homotopy Method For Online Newton Stepcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.