paper-with-me

홈 › Papers

How Well Do Unsupervised Learning Algorithms Model Human Real-time and Life-long Learning?

2022-11-01 · NeurIPS 2022 11 · Chengxu Zhuang, Violet Xiang, Yoon Bai, Xiaoxuan Jia, Nicholas Turk-Browne, Kenneth Norman, James J. DiCarlo, Daniel LK Yamins

Humans learn from visual inputs at multiple timescales, both rapidly and flexibly acquiring visual knowledge over short periods, and robustly accumulating online learning progress over longer periods. Modeling these powerful learning capabilities is an important problem for computational visual cognitive science, and models that could replicate them would be of substantial utility in real-world computer vision settings. In this work, we establish benchmarks for both real-time and life-long continual visual learning. Our real-time learning benchmark measures a model's ability to match the rapid visual behavior changes of real humans over the course of minutes and hours, given a stream of visual inputs. Our life-long learning benchmark evaluates the performance of models in a purely online learning curriculum obtained directly from child visual experience over the course of years of development. We evaluate a spectrum of recent deep self-supervised visual learning algorithms on both benchmarks, finding that none of them perfectly match human performance, though some algorithms perform substantially better than others. Interestingly, algorithms embodying recent trends in self-supervised learning -- including BYOL, SwAV and MAE -- are substantially worse on our benchmarks than an earlier generation of self-supervised algorithms such as SimCLR and MoCo-v2. We present analysis indicating that the failure of these newer algorithms is primarily due to their inability to handle the kind of sparse low-diversity datastreams that naturally arise in the real world, and that actively leveraging memory through negative sampling -- a mechanism eschewed by these newer algorithms -- appears useful for facilitating learning in such low-diversity environments. We also illustrate a complementarity between the short and long timescales in the two benchmarks, showing how requiring a single learning algorithm to be locally context-sensitive enough to match real-time learning changes while stable enough to avoid catastrophic forgetting over the long term induces a trade-off that human-like algorithms may have to straddle. Taken together, our benchmarks establish a quantitative way to directly compare learning between neural networks models and human learners, show how choices in the mechanism by which such algorithms handle sample comparison and memory strongly impact their ability to match human learning abilities, and expose an open problem space for identifying more flexible and robust visual self-supervision algorithms.

📄 PDF Abstract BibTeX

Code (1)

neuroailab/VisualLearningBenchmarks pytorch

Tasks

DiversitySelf-Supervised Learning

Methods 이 논문이 사용한 방법론

Bitcoin Customer Service Number +1-833-534-1729 설명 없음
None 설명 없음
MAE 설명 없음
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Average Pooling 설명 없음
Batch Normalization 설명 없음
Kaiming Initialization 설명 없음
Bottleneck Residual Block A Bottleneck Residual Block is a variant of the residual block that utilises 1x1 convolutions to create a bottleneck. The…

Similar Papers 제목 키워드 기반

Unsupervised Feature Learning in Remote Sensing

2019-08-07 · Aaron Reite, Scott Kangas, Zackery Steck, Steven Goley 외

The need for labeled data is among the most common and well-known practical obstacles to deploying deep learning algorithms to solve real-world problems. The current generation of learning algorithms requires a large vol…

Three Concrete Challenges and Two Hopes for the Safety of Unsupervised Elicitation

2026-02-23 · Callum Canavan, Aditya Shrivastava, Allison Qi, Jonathan Michala 외 arxiv

To steer language models towards truthful outputs on tasks which are beyond human capability, previous work has suggested training models on easy tasks to steer them on harder ones (easy-to-hard generalization), or using…

Flame Stability Analysis of Flame Spray Pyrolysis by Artificial Intelligence

2020-10-22 · Jessica Pan, Joseph A. Libera, Noah H. Paulson, Marius Stan

Flame spray pyrolysis (FSP) is a process used to synthesize nanoparticles through the combustion of an atomized precursor solution; this process has applications in catalysts, battery materials, and pigments. Current lim…

BIG-bench Machine Learning

Unsupervised recognition and clustering of speech overlaps in spoken conversations

2014-09-11 · Workshop on Speech, Language and Audio in Multimedia (SLAM 2014) 2014 9 · Shammur Absar Chowdhury, Giuseppe Riccardi, Firoj Alam

We are interested in understanding speech overlaps and their function in human conversations. Previous studies on speech overlaps have relied on supervised methods, small corpora and controlled conversations. The charact…

ClusteringSpeech Interruption Detection

Speeding up the annotation process in semantic segmentation industrial applications

2026-06-18 · Marta Fernandez-Moreno, Margarita Guerrero, Rosalia Rementeria, Pablo Mesejo 외 arxiv

Current machine learning models commonly require large and well-annotated datasets. However, the annotation process often becomes a bottleneck, with increased complexity leading to higher chances of human errors. Within …

Semantic Segmentation