Home | About | Journals | Submit | Contact Us | Français |

**|**Comput Intell Neurosci**|**v.2016; 2016**|**PMC4916328

Formats

Article sections

- Abstract
- 1. Introduction
- 2. Metaheuristic Algorithms
- 3. Convolution Neural Network
- 4. Design of Proposed Methods
- 5. Simulation and Results
- 6. Conclusion
- References

Authors

Related links

Comput Intell Neurosci. 2016; 2016: 1537325.

Published online 2016 June 8. doi: 10.1155/2016/1537325

PMCID: PMC4916328

*L. M. Rasdi Rere: Email: di.ca.iu@dammahom.edoal

Academic Editor: Martin Hagan

Received 2016 January 29; Revised 2016 April 15; Accepted 2016 May 10.

Copyright © 2016 L. M. Rasdi Rere et al.

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

A typical modern optimization technique is usually either heuristic or metaheuristic. This technique has managed to solve some optimization problems in the research area of science, engineering, and industry. However, implementation strategy of metaheuristic for accuracy improvement on convolution neural networks (CNN), a famous deep learning method, is still rarely investigated. Deep learning relates to a type of machine learning technique, where its aim is to move closer to the goal of artificial intelligence of creating a machine that could successfully perform any intellectual tasks that can be carried out by a human. In this paper, we propose the implementation strategy of three popular metaheuristic approaches, that is, simulated annealing, differential evolution, and harmony search, to optimize CNN. The performances of these metaheuristic methods in optimizing CNN on classifying MNIST and CIFAR dataset were evaluated and compared. Furthermore, the proposed methods are also compared with the original CNN. Although the proposed methods show an increase in the computation time, their accuracy has also been improved (up to 7.14 percent).

Deep learning (DL) is mainly motivated by the research of artificial intelligent, in which the general goal is to imitate the ability of human brain to observe, analyze, learn, and make a decision, especially for complex problem [1]. This technique is in the intersection amongst the research area of signal processing, neural network, graphical modeling, optimization, and pattern recognition. The current reputation of DL is implicitly due to drastically improve the abilities of chip processing, significantly decrease the cost of computing hardware, and advanced research in machine learning and signal processing [2].

In general, the model of DL technique can be classified into discriminative, generative, and hybrid models [2]. Discriminative models, for instance, are CNN, deep neural network, and recurrent neural network. Some examples of generative models are deep belief networks (DBN), restricted Boltzmann machine, regularized autoencoders, and deep Boltzmann machines. On the other hand, hybrid model refers to the deep architecture using the combination of a discriminative and generative model. An example of this model is DBN to pretrain deep CNN, which can improve the performance of deep CNN over random initialization. Among all of the hybrid DL techniques, metaheuristic optimization for training a CNN is the focus of this paper.

Although the sound character of DL has to solve a variety of learning tasks, training is difficult [3–5]. Some examples of successful methods for training DL are stochastic gradient descent, conjugate gradient, Hessian-free optimization, and Krylov subspace descent.

Stochastic gradient descent is easy to implement and also fast in the process for a case with many training samples. However, this method needs several manual tuning scheme to make its parameters optimal, and also its process is principally sequential; as a result, it was difficult to parallelize them with graphics processing unit (GPU). Conjugate gradient, on the other hand, is easier to check for convergence as well as more stable to train. Nevertheless, CG is slow, so that it needs multiple CPUs and availability of a vast number of RAMs [6].

Hessian-free optimization has been applied to train deep autoencoders [7], proficient in handling underfitting problem, and more efficient than pretraining + fine tuning proposed by Hinton and Salakhutdinov [8]. On the other side, Krylov subspace descent is more robust and simpler than Hessian-free optimization as well as looks like it is better for the classification performance and optimization speed. However, Krylov subspace descent needs more memory than Hessian-free optimization [9].

In fact, techniques of modern optimization are heuristic or metaheuristic. These optimization techniques have been applied to solve any optimization problems in the research area of science, engineering, and even industry [10]. However, research on metaheuristic to optimize DL method is rarely conducted. One work is the combination of genetic algorithm (GA) and CNN, proposed by You and Pu [11]. Their model selects the CNN characteristic by the process of recombination and mutation on GA, in which the model of CNN exists as individual in the algorithm of GA. Besides, in recombination process, only the layers weights and threshold value of C1 (convolution in the first layer) and C3 (convolution in the third layer) are changed in CNN model. Another work is fine-tuning CNN using harmony search (HS) by Rosa et al. [12].

In this paper, we compared the performance of three metaheuristic algorithms, that is, simulated annealing (SA), differential evolution (DE), and HS, for optimizing CNN. The strategy employed is looking for the best value of the fitness function on the last layer using metaheuristic algorithm; then the results will be used again to calculate the weights and biases in the previous layer. In the case of testing the performance of the proposed methods, we use MNIST (Mixed National Institute of Standards and Technology) dataset. This dataset comprises images of digital handwritten digits, containing 60,000 training data items and 10,000 testing data items. All of the images have been centered and standardized with the size of 28 × 28 pixels. Each pixel of the image is represented by 0 for black and 255 for white, and in between are different shades of gray [13].

This paper is organized as follows: Section 1 is an introduction, Section 2 explains the used metaheuristic algorithms, Section 3 describes the convolution neural networks, Section 4 gives a description of the proposed methods, Section 5 presents the result of simulation, and Section 6 is the conclusion.

Metaheuristic is well known as an efficient method for hard optimization problems, that is, the problems that cannot be solved optimally using deterministic approach within a reasonable time limit. Metaheuristic methods work for three main purposes: for fast solving of problem, for solving large problems, and for making a more robust algorithm. These methods are also simple to design as well as flexible and easy to implement [14].

In general, metaheuristic algorithms use the combination of rules and randomization to duplicate the phenomena of nature. The biological system imitations of metaheuristic algorithm, for instance, are evolution strategy, GA, and DE. Phenomena of ethology for examples are particle swarm optimization (PSO), bee colony optimization (BCO), bacterial foraging optimization algorithms (BFOA), and ant colony optimization (ACO). Phenomena of physics are SA, microcanonical annealing, and threshold accepting method [15]. Another form of metaheuristic is inspired by music phenomena, such as HS algorithm [16].

Classification of metaheuristic algorithm can also be divided into single-solution-based and population-based metaheuristic algorithm. Some of the examples for single-solution-based metaheuristic are the noising method, tabu search, SA, TA, and guided local search. In the case of metaheuristic based on population, it can be classified into swarm intelligent and evolutionary computation. The general term of swarm intelligent is inspired by the collective behavior of social insect colonies or animal societies. Examples of these algorithms are GP, GA, ES, and DE. On the other side, the algorithm for evolutionary computation takes inspiration from the principles of Darwinian for developing adaptation into their environment. Some examples of these algorithms are PSO, BCO, ACO, and BFOA [15]. Among all these metaheuristic algorithms, SA, DE, and HS are used in this paper.

SA is a technique of random search for the problem of global optimization. It mimics the process of annealing in material processing [10]. This technique was firstly proposed in 1983 by Kirkpatrick et al. [17].

The principle idea of SA is using random search, which not only allows changes that improve the fitness function but also maintains some changes that are not ideal. As an example, in minimum optimization problem, any better changes that decrease the fitness function value *f*(*x*) will be accepted, but some changes that increase *f*(*x*) will also be accepted with a transition probability (*p*) as follows:

$$\begin{array}{c}p=\mathrm{exp}\left(\phantom{\rule[-7.18999pt]{0ex}{13.09999pt}}\frac{-\mathrm{\Delta}E}{kT}\phantom{\rule[-7.18999pt]{0ex}{13.09999pt}}\right),\end{array}$$

(1)

where Δ*E* is the energy level changes, *k* is Boltzmann's constant, and *T* is temperature for controlling the process of annealing. This equation is based on the Boltzmann distribution in physics [10]. The following is standard procedure of SA for optimization problems:

- (1)
*Generate the solution vector*: the initial solution vector is randomly selected, and then the fitness function is calculated. - (2)
*Initialize the temperature*: if the temperature value is too high, it will take a long time to reach convergence, whereas a too small value can cause the system to miss the global optimum. - (3)
*Select a new solution*: a new solution is randomly selected from the neighborhood of the current solution. - (4)
*Evaluate a new solution*: a new solution is accepted as a new current solution depending on its fitness function. - (5)
*Decrease the temperature*: during the search process, the temperature is periodically decreased. - (6)
*Stop or repeat*: the computation is stopped when the termination criterion is satisfied. Otherwise, steps (2) and (6) are repeated.

Differential evolution was firstly proposed by Price and Storn in 1995 to solve the Chebyshev polynomial problem [15]. This algorithm is created based on individuals difference, exploiting random search in the space of solution, and finally operates the procedure of mutation, crossover, and selection to obtain the suitable individual in system [18].

There are some types in DE, including the classical form DE/rand/1/bin; it indicates that in the process of mutation the target vector is randomly selected, and only a single different vector is applied. The acronym of bin shows that crossover process is organized by a rule of binomial decision. The procedure of DE algorithm is shown by the following steps:

- (1)
*Determining parameter setting*: population size is the number of individuals. Mutation factor (F) controls the magnification of the two individual differences to avoid search stagnation. Crossover rate (CR) decides how many consecutive genes of the mutated vector are copied to the offspring. - (2)
*Initialization of population*: the population is produced by randomly generating the vectors in the suitable search range. - (3)
*Evaluation of individual*: each individual is evaluated by calculating their objective function. - (4)
*Mutation operation*: mutation adds identical variable to one or more vector parameters. In this operation, three auxiliary parents (*x*_{M}^{p1},*x*_{M}^{p2},*x*_{M}^{p3}) are selected randomly, in which they will participate in mutation operation to create a mutated individual*x*_{M}^{mut}as follows:$$\begin{array}{c}{x}_{M}^{\mathrm{m}\mathrm{u}\mathrm{t}}={x}_{M}^{p\mathrm{1}}+\mathrm{F}\left(\phantom{\rule[-3.09702pt]{0ex}{9.68996pt}}{x}_{M}^{p\mathrm{2}}-{x}_{M}^{p\mathrm{3}}\phantom{\rule[-3.09702pt]{0ex}{9.68996pt}}\right),\end{array}$$(2) - where
*p*1,*p*2,*p*3 {1,2,…,*N*} and*N*=*p*1 ≠*p*2 ≠*p*3. - (5)
*Combination operation*: recombination (crossover) is applied after mutation operation. - (6)
*Selection operation*: this operation determines whether the offspring in the next generation should become a member of the population or not. - (7)
*Stopping criterion*: the current generation is substituted by the new generation until the criterion of termination is satisfied.

Harmony search algorithm is proposed by Geem et al. in 2001 [19]. This algorithm is inspired by the musical process of searching for a perfect state of harmony. Like harmony in music, solution vector of optimization and improvisation from the musician are analogous to structures of local and global search in optimization techniques.

In improvisation of the music, the players sound any pitch in the possible range together that can create one vector of harmony. In the case of pitches creating a real harmony, this experience is stored in the memory of each player and they have the opportunity to create better harmony next time [16]. There are three possible alternatives when one pitch is improvised by a musician: any one pitch is played from her/his memory, a nearby pitch is played from her/his memory, and an entirely random pitch is played with the range of possible sound. If these options are used for optimization, they have three equivalent components: the use of harmony memory, pitch adjusting, and randomization. In HS algorithm, these rules are correlated with two relevant parameters, that is, harmony consideration rate (HMCR) and pitch adjusting rate (PAR). The procedure of HS algorithm can be summarized into five steps as follows [16]:

*Initialize the problem and parameters*: in this algorithm, the problem can be maximum or minimum optimization, and the relevant parameters are HMCR, PAR, size of harmony memory, and termination criterion.*Initialize harmony memory*: the harmony memory (HM) is usually initialized as a matrix that is created randomly as a vector of solution and arranged based on the objective function.*Improve a new harmony*: a vector of new harmony is produced from HM based on HMCR, PAR, and randomization. Selection of new value is based on HMCR parameter by range 0 through 1. The vector of new harmony is observed to decide whether it should be pitch-adjusted using PAR parameter. The process of pitch adjusting is executed only after a value is selected from HM.*Update harmony memory*: the new harmony substitutes the worst harmony in terms of the value of the fitness function, in which the fitness function of new harmony is better than worst harmony.*Repeat (3) and (4) until satisfying the termination criterion*: in the case of meeting the termination criterion, the computation is ended. Alternatively, process (3) and (4) are reiterated. In the end, the vector of the best HM is nominated and is reflected as the best solution for the problem.

CNN is a variant of the standard multilayer perceptron (MLP). A substantial advantage of this method, especially for pattern recognition compared with conventional approaches, is due to its capability in reducing the dimension of data, extracting the feature sequentially, and classifying one structure of network [20]. The basic architecture model of CNN was inspired in 1962, from visual cortex proposed by Hubel and Wiesel.

In 1980, Fukushimas Neocognitron created the first computation of this model, and then in 1989, following the idea of Fukushima, LeCun et al. found the state-of-the-art performance on a number of tasks for pattern recognition using error gradient method [21].

The classical CNN by LeCun et al. is an extension of traditional MLP based on three ideas: local receptive fields, weights sharing, and spatial/temporal subsampling. These ideas can be organized into two types of layers, which are convolution layers and subsampling layers. As is showed in Figure 1, the processing layers contain three convolution layers C1, C3, and C5, combined in between with two subsampling layers S2 and S4 and output layer F6. These convolution and subsampling layers are structured into planes called features maps.

In convolution layer, each neuron is linked locally to a small input region (local receptive field) in the preceding layer. All neurons with similar feature maps obtain data from different input regions until the whole of plane input is skimmed, but the same of weights is shared (weights sharing).

In subsampling layer, the feature maps are spatially downsampled, in which the size of the map is reduced by a factor 2. As an example, the feature map in layer C3 of size 10 × 10 is subsampled to a conforming feature map of size 5 × 5 in the subsequent layer S4. The last layer is F6 that is the process of classification [21].

Principally, a convolution layer is correlated with some feature maps, the size of the kernel, and connections to the previous layer. Each feature map is the results of a sum of convolution from the maps of the previous layer, by their corresponding kernel and a linear filter. Adding a bias term and applying it to a nonlinear function, the *k*th feature map *M*
_{ij}
^{k} with the weights *W*
^{k} and bias *b*
_{k} is obtained using the tanh function as follows:

$$\begin{array}{c}{M}_{ij}^{k}=\mathrm{tanh}\left(\phantom{\rule[-6.6pt]{0ex}{9.75598pt}}{\left(\phantom{\rule[-0.23pt]{0ex}{9.75598pt}}{W}^{k}\times x\phantom{\rule[-0.23pt]{0ex}{9.75598pt}}\right)}_{ij}+{b}_{k}\phantom{\rule[-6.6pt]{0ex}{9.75598pt}}\right).\end{array}$$

(3)

The purpose of a subsampling layer is to reach spatial invariance by reducing the resolution of feature maps, in which each pooled feature map relates to one feature map of the preceding layer. The subsampling function, where *a*
_{i}
^{n×n} is the inputs, *β* is a trainable scalar, and *b* is trainable bias, is given by the following equation:

$$\begin{array}{c}{a}_{j}=\mathrm{tanh}\left(\phantom{\rule[-11.728pt]{0ex}{9.31497pt}}\beta {\displaystyle \sum}_{N\times N}{a}_{i}^{n\times n}+b\phantom{\rule[-11.728pt]{0ex}{9.31497pt}}\right).\end{array}$$

(4)

After several convolutions and subsampling, the last structure is classification layer. This layer works as an input for a series of fully connected layers that will execute the classification task. It has one output neuron every class label, and in the case of MNIST dataset, this layer contains ten neurons corresponding to their classes.

The architecture of this proposed method refers to a simple CNN structure (LeNet-5), not a complex structure like AlexNet [22]. We use two variations of design structure. First is i-6c-2s-12c-2s, where the number of C1 is 6 and that of C3 is 12. Second is i-8c-2s-16c-2s, where the number of C1 is 8 and that of C3 is 18. The kernel size of all convolution layers is 5 × 5, and the scale of subsampling is 2. This architecture is designed for recognizing handwritten digits from MNIST dataset.

In this proposed method, SA, DE, and HS algorithm are used to train CNN (CNNSA, CNNDE, and CNNHS) to find the condition of best accuracy and also to minimize estimated error and indicator of network complexity. This objective can be realized by computing the lost function of vector solution or the standard error on the training set. The following is the lost function used in this paper:

$$\begin{array}{c}y=\frac{\mathrm{1}}{\mathrm{2}}{\left(\phantom{\rule[-7.18999pt]{0ex}{16.76897pt}}\frac{{\sum}_{i=N}^{N}{\left(o-u\right)}^{\mathrm{2}}}{N}\phantom{\rule[-7.18999pt]{0ex}{16.76897pt}}\right)}^{\mathrm{0.5}},\end{array}$$

(5)

where *o* is the expected output, *u* is the real output, and *N* is some training samples. In the case of termination criterion, two situations are used in this method. The first is when the maximum iteration has been reached and the second is when the loss function is less than a certain constant. Both conditions mean that the most optimal state has been achieved.

Principally, algorithm on CNN computes the values of weight and bias, in which on the last layer they are used to calculate the lost function. These values of weight and bias in the last layer are used as solution vector, denoted as *x*, to be optimized in SA algorithm, by adding Δ*x* randomly.

Δ*x* is the essential aspect of this proposed method. Selection in the proper of this value will significantly increase the accuracy. For example, in CNNSA to one epoch, if Δ*x* = 0.0008× rand, then the accuracy is 88.12, in which this value is 5.73 greater than the original CNN (82.39). However, if Δ*x* = 0.0001× rand, its accuracy is 85.79 and its value is only 3.40 greater than the original CNN.

Furthermore, this solution vector is updated based on SA algorithm. When the termination criterion is satisfied, all of weights and biases are updated for all layers in the system. Algorithm 1 is the CNNSA algorithm of the proposed method.

At the first time, this method computes all the values of weight and bias. The values of weight and bias on the last layer (*x*) are used to calculate the lost function, and then by adding Δ*x* randomly, these new values are used to initialize the individuals in the population.

Similar to CNNSA method, selection in the proper of Δ*x* will significantly increase the value of accuracy. In the case of one epoch in CNNDE as an example, if Δ*x* = 0.0008× rand, then the accuracy is 86.30, in which this value is 3.91 greater than the original CNN (82.39). However, if Δ*x* = 0.00001× rand, its accuracy is 85.51.

Furthermore, these individuals in the population are updated based on the DE algorithm. When the termination criterion is satisfied, all of weights and biases are updated for all layers in the system. Algorithm 2 is the CNNDE algorithm of the proposed method.

At the first time like CNNSA and CNNDE, this method computes all the values of weight and bias. The values of weight and bias on the last layer (*x*) are used to calculate the lost function, and then by adding Δ*x* randomly, these new values are used to initialize the harmony memory.

In this method, Δ*x* is also an important aspect, while selection of the proper of Δ*x* will significantly increase the value of accuracy. For example of one epoch in CNNHS (i-8c-2s-16c-2s), if Δ*x* = 0.0008× rand, then the accuracy is 87.23, in which this value is 7.14 greater than the original CNN (80.09). However, if Δ*x* = 0.00001× rand, its accuracy is 80.23; the value is only 0.14 greater than CNN.

Furthermore, this harmony memory is updated based on the HS algorithm. When the termination criterion is satisfied, all of weights and biases are updated for all layers in the system. Algorithm 3 is the CNNHS algorithm of the proposed method.

In this paper, the primary goal is to improve the accuracy of original CNN by using SA, DE, and HS algorithm. This can be performed by minimizing the classification task error tested on the MNIST dataset. Some of the example images for MNIST dataset are shown in Figure 2.

In CNNSA experiment, the size of neighborhood was set = 10 and maximum of iteration (maxit) = 10. In CNNDE, the population size = 10 and maxit = 10. In CNNHS, the harmony memory size = 10 and maxit = 10. Since it is difficult to make sure of the control of parameter, in all of the experiment the values of *c* = 0.5 for SA, F = 0.8 and CR = 0.3 for DE, and HMCR = 0.8 and PAR = 0.3 for HS. We also set the parameter of CNN, that is, the learning rate (*α* = 1) and the batch size (100).

As for the epoch parameter, the number of epochs is 1 to 10 for every experiment. All of the experiment was implemented in MATLAB-R2011a, on a personal computer with processor Intel Core i7-4500u, 8GB RAM running memory, Windows 10, with five separate runtimes. The original program of this simulation is DeepLearn Toolbox from Palm [23].

All of the experiment results of the proposed methods are compared with the experiment result from the original CNN. These results for the design of i-6c-2s-12c-2s are summarized in Table 1 for accuracy, Table 2 for the computational time, and Figure 3 for error and its standard deviation as well as Figure 4 for computational time and its standard deviation. The results for the design of i-8c-2s-16c-2s are summarized in Table 3 for accuracy, Table 4 for the computational time, and Figure 5 for error and its standard deviation as well as Figure 6 for computational time and its standard deviation.

The experiments of original CNN are conducted at only one time for each epoch because the value of its accuracy will not change if the experiment is repeated with the same condition. In general, the tests conducted showed that the higher the epoch value, the better the accuracy. For example, in one epoch, compared to CNN (82.39), the accuracy increased to 5.73 for CNNSA (88.12), 3.91 for CNNDE (86.30), and 4.84 for CNNHS (87.23). While in 5 epochs, compared to CNN (93.11), the increase of accuracy is 3.18 for CNNSA (96.29), 2.04 for CNNDE (94.15), and 1.78 for CNNHS (94.89). In the case of 100 epochs, as shown in Figure 7, the increase in accuracy compared to CNN (98.65) is only 0.16 for CNNSA (98.81), 0.13 for CNNDE (98.78), and 0.09 for CNNHS (98.74).

The experiment results show that CNNSA presents the best accuracy for all epochs. Accuracy improvement of CNNSA, compared to the original CNN, varies for each epoch, with a range of values between 1.74 (9 epochs) and 5.73 (1 epoch). The computation time for the proposed method, compared to the original CNN, is in the range of 1.01 times (CNNSA, two epochs: 246/244) up to 1.70 times (CNNHS, nine epochs: 1246/856).

In addition, we also test our proposed method with CIFAR10 (Canadian Institute for Advanced Research) dataset. This dataset consists of 60,000 color images, in which the size of every image is 32 × 32. There are five batches for training, composed of 50,000 images, and one batch of test images consists of 10,000 images. The CIFAR10 dataset is divided into ten classes, where each class has 6,000 images. Some example images of this dataset are showed in Figure 8.

The experiment of CIFAR10 dataset was conducted in MATLAB-R2014a. We use the number of epochs 1 to 15 for this experiment. The original program is MatConvNet from [24]. In this paper, the program was modified with SA algorithm. The results can be seen in Figure 9 for objective, Figure 10 for top-1 error, and Figure 11 for a top-5 error, Table 5 for Comparison of CNN and CNNSA for train as well as Table 6 for Comparison of CNN and CNNSA for validation. In general, these results show that CNNSA works better than original CNN for CIFAR10 dataset.

This paper shows that SA, DE, and HS algorithms improve the accuracy of the CNN. Although there is an increase in computation time, error of the proposed method is smaller than the original CNN for all variations of the epoch.

It is possible to validate the performance of this proposed method on other benchmark datasets such as ORL, INRIA, Hollywood II, and ImageNet. This strategy can also be developed for other metaheuristic algorithms such as ACO, PSO, and BCO to optimize CNN.

For the future study, metaheuristic algorithms applied to the other DL methods need to be explored, such as the recurrent neural network, deep belief network, and AlexNet (a newer variant of CNN).

This work is supported by Higher Education Center of Excellence Research Grant funded by Indonesian Ministry of Research, Technology and Higher Education (Contract no. 1068/UN2.R12/HKP.05.00/2016).

The authors declare that they have no competing interests.

1. Najafabadi M. M., Villanustre F., Khoshgoftaar T. M., Seliya N., Wald R., Muharemagic E. Deep learning applications and challenges in big data analytics. *Journal of Big Data*. 2015;2(1):1–21. doi: 10.1186/s40537-014-0007-7. [Cross Ref]

2. Deng L., Yu D. *Deep Learning: Methods and Application*. Redmond, Wash, USA: Foundation and Trends in Signal Processing; 2013.

3. Sweeney J. L. *Deep learning using genetic algorithms [M.S. thesis]* Rochester, NY, USA: Department of Computer Science, Rochester Institute of Technology; 2012.

4. Glauner P. O. *Comparison of training methods for deep neural networks [M.S. thesis]* 2015.

5. Rere L. M. R., Fanany M. I., Arymurthy A. M. Simulated annealing algorithm for deep learning. *Procedia Computer Science*. 2015;72:137–144. doi: 10.1016/j.procs.2015.12.114. [Cross Ref]

6. Le Q. V., Ngiam J., Coates A., Lahiri A., Prochnow B., Ng A. Y. On optimization methods for deep learning. Proceedings of the 28th International Conference on Machine Learning (ICML '11); July 2011; Bellevue, Wash, USA. pp. 265–272.

7. Martens J. Deep learning via hessian-free optimization. Proceedings of the 27th International Conference on Machine Learning; 2010; Haifa, Israel.

8. Hinton G. E., Salakhutdinov R. R. Reducing the dimensionality of data with neural networks. *Science*. 2006;313(5786):504–507. doi: 10.1126/science.1127647. [PubMed] [Cross Ref]

9. Vinyal O., Poyey D. Krylov subspace descent for deep learning. Proceedings of the 15th International Conference on Artificial Intelligent and Statistics (AISTATS); 2012; La Palma, Spain.

10. Yang X.-S. *Engineering Optimization: An Introduction with Metaheuristic Application*. Hoboken, NJ, USA: John Wiley & Sons; 2010.

11. You Z., Pu Y. The genetic convolutional neural network model based on random sample. *International Journal of u- and e-Service, Science and Technology*. 2015;8(11):317–326. doi: 10.14257/ijunesst.2015.8.11.31. [Cross Ref]

12. Rosa G., Papa J., Marana A., Scheire W., Cox D. Fine-tuning convolutional neural networks using harmony search. In: Pardo A., Kittler J., editors. *Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications*. Vol. 9423. 2015. pp. 683–690. (Lecture Notes in Computer Science). [Cross Ref]

13. LiSA-Lab. *Deep Learning Tutorial Release 0.1*. Montreal, Canada: University of Montreal; 2014.

14. Talbi E.-G. *Metaheuristics: From Design to Implementation*. Hoboken, NJ, USA: John Wiley & Sons; 2009.

15. Boussa{\"{\i}}d I., Lepagnot J., Siarry P. A survey on optimization metaheuristics. *Information Sciences*. 2013;237:82–117. doi: 10.1016/j.ins.2013.02.041. [Cross Ref]

16. Lee K. S., Geem Z. W. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. *Computer Methods in Applied Mechanics and Engineering*. 2005;194(36–38):3902–3933. doi: 10.1016/j.cma.2004.09.007. [Cross Ref]

17. Kirkpatrick S., Gelatt C. D., Jr., Vecchi M. P. Optimization by simulated annealing. *Science*. 1983;220(4598):671–680. doi: 10.1126/science.220.4598.671. [PubMed] [Cross Ref]

18. Noman N., Bollegala D., Iba H. An adaptive differential evolution algorithm. Proceedings of the IEEE Congress of Evolutionary Computation (CEC '11); June 2011; pp. 2229–2236. [Cross Ref]

19. Geem Z. W., Kim J. H., Loganathan G. V. A new heuristic optimization algorithm: harmony search. *Simulation*. 2001;76(2):60–68. doi: 10.1177/003754970107600201. [Cross Ref]

20. Bengio Y. Learning deep architectures for AI. *Foundation and Trends in Machine Learning*. 2009;2(1):1–127. doi: 10.1561/2200000006. [Cross Ref]

21. LeCun Y., Kavukcuoglu K., Farabet C. Convolutional networks and applications in vision. Proceedings of the IEEE International Symposium on Circuits and Systems; June 2010; Paris, France. pp. 253–256. [Cross Ref]

22. Krizhevsky A., Sutskever I., Hinton G. E. ImageNet classification with deep convolutional neural networks. Proceedings of the 26th Annual Conference on Neural Information Processing Systems (NIPS '12); December 2012; Lake Tahoe, Nev, USA. pp. 1097–1105.

23. Palm R. *Prediction as a candidate for learning deep hierarchical models of data [M.S. thesis]* Technical University of Denmark; 2012.

24. Vedaldi A., Lenc K. MatConvNet: convolutional neural networks for matlab. Proceedings of the 23rd ACM International Conference on Multimedia; October 2015; Brisbane, Australia. pp. 689–692. [Cross Ref]

Articles from Computational Intelligence and Neuroscience are provided here courtesy of **Hindawi**

PubMed Central Canada is a service of the Canadian Institutes of Health Research (CIHR) working in partnership with the National Research Council's national science library in cooperation with the National Center for Biotechnology Information at the U.S. National Library of Medicine(NCBI/NLM). It includes content provided to the PubMed Central International archive by participating publishers. |