Disjunctive normal networks

详细信息    查看全文

• 作者：Mehdi Sajjadi ; ^{mehdi@sci.utah.edu" class="auth_mail" title="E-mail the corresponding author} ; Mojtaba Seyedhosseini ^{mseyed@sci.utah.edu" class="auth_mail" title="E-mail the corresponding author} ; Tolga Tasdizen ^{tolga@sci.utah.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Supervised learning ; Neural networks ; Classification
• 刊名：Neurocomputing
• 出版年：2016
• 出版时间：19 December 2016
• 年：2016
• 卷：218
• 期：Complete
• 页码：276-285
• 全文大小：1785 K

文摘

Artificial neural networks are powerful pattern classifiers. They form the basis of the highly successful and popular Convolutional Networks which offer the state-of-the-art performance on several computer visions tasks. However, in many general and non-vision tasks, neural networks are surpassed by methods such as support vector machines and random forests that are also easier to use and faster to train. One reason is that the backpropagation algorithm, which is used to train artificial neural networks, usually starts from a random weight initialization which complicates the optimization process leading to long training times and increases the risk of stopping in a poor local minima. Several initialization schemes and pre-training methods have been proposed to improve the efficiency and performance of training a neural network. However, this problem arises from the architecture of neural networks. We use the disjunctive normal form and approximate the boolean conjunction operations with products to construct a novel network architecture. The proposed model can be trained by minimizing an error function and it allows an effective and intuitive initialization which avoids poor local minima. We show that the proposed structure provides efficient coverage of the decision space which leads to state-of-the art classification accuracy and fast training times.