English

Efficient Convolutional Auto-Encoding via Random Convexification and Frequency-Domain Minimization

Machine Learning 2016-11-29 v1 Machine Learning Neural and Evolutionary Computing

Abstract

The omnipresence of deep learning architectures such as deep convolutional neural networks (CNN)s is fueled by the synergistic combination of ever-increasing labeled datasets and specialized hardware. Despite the indisputable success, the reliance on huge amounts of labeled data and specialized hardware can be a limiting factor when approaching new applications. To help alleviating these limitations, we propose an efficient learning strategy for layer-wise unsupervised training of deep CNNs on conventional hardware in acceptable time. Our proposed strategy consists of randomly convexifying the reconstruction contractive auto-encoding (RCAE) learning objective and solving the resulting large-scale convex minimization problem in the frequency domain via coordinate descent (CD). The main advantages of our proposed learning strategy are: (1) single tunable optimization parameter; (2) fast and guaranteed convergence; (3) possibilities for full parallelization. Numerical experiments show that our proposed learning strategy scales (in the worst case) linearly with image size, number of filters and filter size.

Keywords

Cite

@article{arxiv.1611.09232,
  title  = {Efficient Convolutional Auto-Encoding via Random Convexification and Frequency-Domain Minimization},
  author = {Meshia Cédric Oveneke and Mitchel Aliosha-Perez and Yong Zhao and Dongmei Jiang and Hichem Sahli},
  journal= {arXiv preprint arXiv:1611.09232},
  year   = {2016}
}

Comments

Accepted at NIPS 2016 Workshop on Efficient Methods for Deep Neural Networks (EMDNN)

R2 v1 2026-06-22T17:06:48.087Z