Measuring the Data Efficiency of Deep Learning Methods
원문 초록
In this paper, we propose a new experimental protocol and use it to benchmark the data efficiency --- performance as a function of training set size --- of two deep learning algorithms, convolutional neural networks (CNNs) and hierarchical information-preserving graph-based slow feature analysis (HiGSFA), for tasks in classification and transfer learning scenarios. The algorithms are trained on different-sized subsets of the MNIST and Omniglot data sets. HiGSFA outperforms standard CNN networks when the models are trained on 50 and 200 samples per class for MNIST classification. In other cases, the CNNs perform better. The results suggest that there are cases where greedy, locally optimal bottom-up learning is equally or more powerful than global gradient-based learning.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
FrImCla: A Framework for Image Classification Using Traditional and Transfer Learning Techniques
Multiview Contrastive Learning for Unsupervised Domain Adaptation in Brain–Computer Interfaces
Facial Beauty Analysis Using Distribution Prediction and CNN Ensembles
Transfer Learning for Classification of Alzheimer's Disease Based on Genome Wide Data
Chest X-Ray Images Classification with CNN
DocXClassifier: High Performance Explainable Deep Network for Document Image Classification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.