2020/02/11 by Mohammad Saeed Abrishami, Amir Erfan Eshratifar, Abrishami, Mohammad Saeed +9
Computer Science · Mathematics · #Advanced Neural Network Applications #Algorithm #Artificial intelligence #Artificial neural network #Computation #Computer Vision and Pattern Recognition (cs.CV) #Computer science #Convolutional neural network #Deep learning #Deep neural networks #Embedding #FOS: Computer and information sciences #Field (mathematics) #Generalization #Machine Learning (cs.LG) #Machine Learning and ELM #Machine learning #Mathematics #Neural Networks and Applications #Raw data #Space (punctuation) #Transfer of learning #cs.CV #cs.LG
paper · pdf · doi:10.48550/arxiv.2002.04776
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2020/02/11 · arxiv created 2020/02/12 · arxiv updated 2020/02/13 · openalex created_date 2022/07/26 · openalex updated_date 2026/08/05
Recent advances in the field of artificial intelligence have been made\npossible by deep neural networks. In applications where data are scarce,\ntransfer learning and data augmentation techniques are commonly used to improve\nthe generalization of deep learning models. However, fine-tuning a transfer\nmodel with data augmentation in the raw input space has a high computational\ncost to run the full network for every augmented input. This is particularly\ncritical when large models are implemented on embedded devices with limited\ncomputational and energy resources. In this work, we propose a method that\nreplaces the augmentation in the raw input space with an approximate one that\nacts purely in the embedding space. Our experimental results show that the\nproposed method drastically reduces the computation, while the accuracy of\nmodels is negligibly compromised.\n