CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A Hybrid Optimization Algorithm for Learning Deep Models

عنوان مقاله: A Hybrid Optimization Algorithm for Learning Deep Models
شناسه ملی مقاله: JR_JACR-9-4_004
منتشر شده در شماره 4 دوره 9 فصل در سال 1397
مشخصات نویسندگان مقاله:

Farnaz Hoseini - Department of Computer Engineering, Rasht Branch, Islamic Azad University, Rasht, Iran
Asadollah Shahbahrami - Department of Computer Engineering, Faculty of Engineering, University of Guilan, Rasht, Iran
Peyman Bayat - Department of Computer Engineering, Rasht Branch, Islamic Azad University, Rasht, Iran

خلاصه مقاله:
Deep learning is one of the subsets of machine learning that is widely used in Artificial Intelligence (AI) field such as natural language processing and machine vision. The learning algorithms require optimization in multiple aspects. Generally, model-based inferences need to solve an optimized problem. In deep learning, the most important problem that can be solved by optimization is neural network training, but training a neural network can involve thousands of computers for months. In the present study, basic optimization algorithms in deep learning were evaluated. First, a performance criterion was defined based on a training dataset, which makes an objective function along with an adjustment phrase. In the optimization process, a performance criterion provides the least value for objective function. Finally, in the present study, in order to evaluate the performance of different optimization algorithms, recent algorithms for training neural networks were compared for the segmentation of brain images. The results showed that the proposed hybrid optimization algorithm performed better than the other tested methods because of its hierarchical and deeper extraction.

کلمات کلیدی:
Deep Learning, Optimization Algorithms, Stochastic Gradient Descent, Momentum, Nestrove, Adam

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/966256/