Multiplicative update rules for accelerating deep learning training and increasing robustness

Abstract

Even nowadays, where Deep Learning (DL) has achieved state-of-the-art performance in a wide range of research domains, accelerating training and building robust DL models remains a challenging task. To this end, generations of researchers have pursued to develop robust methods for training DL architectures that can be less sensitive to weight distributions, model architectures and loss landscapes. However, such methods are limited to adaptive learning rate optimizers, initialization schemes, and clipping gradients without investigating the fundamental rule of parameters update. Although multiplicative updates have contributed significantly to the early development of machine learning and hold strong theoretical claims, to best of our knowledge, this is the first work that investigate them in context of DL training acceleration and robustness. In this work, we propose an optimization framework that fits to a wide range of optimization algorithms and enables one to apply alternative update rules. To this end, we propose a novel multiplicative update rule and we extend their capabilities by combining it with a traditional additive update term, under a novel hybrid update method. We claim that the proposed framework accelerates training, while leading to more robust models in contrast to traditionally used additive update rule and we experimentally demonstrate their effectiveness in a wide range of task and optimization methods. Such tasks ranging from convex and non-convex optimization to difficult image classification benchmarks applying a wide range of traditionally used optimization methods and Deep Neural Network (DNN) architectures.

References in corpus (14)

• Adam: A Method for Stochastic Optimization
• Very Deep Convolutional Networks for Large-Scale Image Recognition
• On the Convergence of Adam and Beyond
• On the Variance of the Adaptive Learning Rate and Beyond
• Large Batch Training of Convolutional Networks
• High-Performance Large-Scale Image Recognition Without Normalization
• Deep Learning of Part-based Representation of Data Using Sparse Autoencoders with Nonnegativity Constraints
• Qualitatively characterizing neural network optimization problems
• Micro-Batch Training with Batch-Channel Normalization and Weight Standardization
• Deep Learning of Nonnegativity-Constrained Autoencoders for Enhanced Understanding of Data
• AdaTerm: Adaptive T-Distribution Estimated Robust Moments for Noise-Robust Stochastic Gradient Optimization
• On the distance between two neural networks and the stability of learning
• Understanding Overparameterization in Generative Adversarial Networks
• Multiplicative Updates for Convolutional NMF Under $\beta$-Divergence

Cited by in corpus (1)

• A 262 TOPS Hyperdimensional Photonic AI Accelerator powered by a Si3N4 microcomb laser