mlsanityData to 7 Oct 2026

Self-Supervised Features Improve Open-World Learning

arXiv 2102.07848 ↗First posted 15 Feb 2021cs.CV cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

This paper identifies the flaws in existing open-world learning approaches and attempts to provide a complete picture in the form of True Open-World Learning. We accomplish this by proposing a comprehensive generalize-able open-world learning protocol capable of evaluating various components of open-world learning in an operational setting. We argue that in true open-world learning, the underlying feature representation should be learned in a self-supervised manner. Under this self-supervised feature representation, we introduce the problem of detecting unknowns as samples belonging to Out-of-Label space. We differentiate between Out-of-Label space detection and the conventional Out-of-Distribution detection depending upon whether the unknowns being detected belong to the native-world (same as feature representation) or a new-world, respectively. Our unifying open-world learning framework combines three individual research dimensions, which typically have been explored independently, i.e., Incremental Learning, Out-of-Distribution detection and Open-World Learning. Starting from a self-supervised feature space, an open-world learner has the ability to adapt and specialize its feature space to the classes in each incremental phase and hence perform better without incurring any significant overhead, as demonstrated by our experimental results. The incremental learning component of our pipeline provides the new state-of-the-art on established ImageNet-100 protocol. We also demonstrate the adaptability of our approach by showing how it can work as a plug-in with any of the self-supervised feature representation methods.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 49 of its 62 references that are in the map. First posted on arXiv 15 Feb 2021.

Builds on

49 of 62 references.

References · 49

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  3. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  4. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  5. 2016Learning without Forgettingcited by 2,465
  6. 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
  7. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  8. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,282
  9. 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,586
  10. 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,472
  11. 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,379
  12. 2017Enhancing The Reliability of Out-of-distribution Image Detection in Neural Networkscited by 1,325
37 more
  1. 2016Colorful Image Colorizationcited by 1,113
  2. 2019Self-Supervised Learning of Pretext-Invariant Representationscited by 806
  3. 2019Large Scale Incremental Learningcited by 727
  4. 2019Self-supervised Visual Feature Learning with Deep Neural Networks: A Surveycited by 656
  5. 2018End-to-End Incremental Learningcited by 596
  6. 2015Towards Open Set Deep Networkscited by 533
  7. 2019Self-labelling via simultaneous clustering and representation learningcited by 525
  8. 2017A systematic study of the class imbalance problem in convolutional neural networkscited by 510
  9. 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 454
  10. 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
  11. 2018Do Deep Generative Models Know What They Don't Know?cited by 443
  12. 2020SCAN: Learning to Classify Images without Labelscited by 351
  13. 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 281
  14. 2014Towards Open World Recognitioncited by 226
  15. 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 223
  16. 2020Mnemonics Training: Multi-Class Incremental Learning without Forgettingcited by 220
  17. 2016Split-Brain Autoencoders: Unsupervised Learning by Cross-Channel Predictioncited by 217
  18. 2019Scaling and Benchmarking Self-Supervised Visual Representation Learningcited by 201
  19. 2019REMIND Your Neural Network to Prevent Catastrophic Forgettingcited by 197
  20. 2017Colorization as a Proxy Task for Visual Understandingcited by 175
  21. 2018Reducing Network Agnostophobiacited by 165
  22. 2021Open-World Semi-Supervised Learningcited by 165
  23. 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 141
  24. 2017Representation Learning by Learning to Countcited by 120
  25. 2017DOC: Deep Open Classification of Text Documentscited by 109
  26. 2020Memory-Efficient Incremental Learning Through Feature Adaptationcited by 107
  27. 2020A Comprehensive Study of Class Incremental Learning Algorithms for Visual Taskscited by 107
  28. 2018Boosting Self-Supervised Learning via Knowledge Transfercited by 92
  29. 2019Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysiscited by 91
  30. 2020iTAML: An Incremental Task-Agnostic Meta-learning Approachcited by 90
  31. 2015The Extreme Value Machinecited by 78
  32. 2018Learning Deep Features for One-Class Classificationcited by 76
  33. 2020Incremental Learning In Online Scenariocited by 71
  34. 2020ScaIL: Classifier Weights Scaling for Class Incremental Learningcited by 47
  35. 2017Improvements to context based self-supervised learningcited by 32
  36. 2018DeeSIL: Deep-Shallow Incremental Learningcited by 30
  37. 2020Steering Self-Supervised Feature Learning Beyond Local Pixel Statisticscited by 19

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 1; 2024: 0; 2025: 2; 2026: 1.

8 papers.