paper-with-me

홈 › Papers

Parameter Continuation Methods for the Optimization of Deep Neural Networks

2019-12-16 · 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA) 2019 12 · Harsh Nilesh Pathank, Randy Clinton Paffenroth

There are many extant methods for approximating the solutions of non-convex optimization problems arising in deep neural networks, including stochastic gradient descent, RMSProp, AdaGrad, and ADAM. In this paper, we propose a novel training strategy for deep neural networks based on ideas from numerical parameter continuation methods. Parameter continuation methods have a long history in many application domains such as bifurcation analysis and the study of systems of differential equations. However, as far as we are aware, such powerful methods have seen relatively limited use in the optimization of deep neural networks. Specifically, herein we derive a homotopy formulation of standard activation functions. Such a derivation allows one to decompose the optimization of deep neural networks into a sequence of optimization problems, each of which is armed with a good initial guess based upon the solution of the previous problem. The whole process is initiated by using a closed-form solution for the first of these problems provided by the homotopy formulation. Intuitively, there is a deep connection between our homotopy techniques and many ideas used in transfer and curriculum learning. However, our proposed methods leverage decades of theoretical and computational work in parameter continuation methods and can be viewed as an initial bridge between those techniques and deep neural networks. In particular, we propose a method that we call Natural Parameter Adaption Continuation with Secant approximation (NPACS). This method provides an effective optimization technique that uses standard algorithms such as ADAM in a novel way to achieve faster and more stable convergence. We demonstrate the effectiveness of our method on standard benchmark problems, and we compute local minima more quickly and with lower train and test loss values than current state-of-the-art techniques in a majority of cases.

📄 PDF Abstract BibTeX

Code (1)

harsh306/NPACS tf

Methods 이 논문이 사용한 방법론

AdaGrad AdaGrad is a stochastic optimization method that adapts the learning rate to the parameters. It performs smaller updates for parameters associated with frequently occurring…
RMSProp RMSProp is an unpublished adaptive learning rate optimizer proposed by Geoff Hinton. The motivation…
Adam 설명 없음

Similar Papers 제목 키워드 기반

Principled Curriculum Learning using Parameter Continuation Methods

2025-07-29 · Harsh Nilesh Pathak, Randy Paffenroth arxiv

In this work, we propose a parameter continuation method for the optimization of neural networks. There is a close connection between parameter continuation, homotopies, and curriculum learning. The methods we propose he…

Continuation methods as a tool for parameter inference in electrophysiology modeling

2025-01-13 · Matt J Owen, Gary R Mirams

Parameterizing mathematical models of biological systems often requires fitting to stable periodic data. In cardiac electrophysiology this typically requires converging to a stable action potential through long simulatio…

Policy Gradient Algorithms Implicitly Optimize by Continuation

2023-05-11 · Adrien Bolland, Gilles Louppe, Damien Ernst

Direct policy optimization in reinforcement learning is usually solved with policy-gradient algorithms, which optimize policy parameters via stochastic gradient ascent. This paper provides a new theoretical interpretatio…

Learned Optimizers for Analytic Continuation

2021-07-28 · Dongchen Huang, Yi-feng Yang

Traditional maximum entropy and sparsity-based algorithms for analytic continuation often suffer from the ill-posed kernel matrix or demand tremendous computation time for parameter tuning. Here we propose a neural netwo…

Mollifying Networks

2016-08-17 · Caglar Gulcehre, Marcin Moczulski, Francesco Visin, Yoshua Bengio

The optimization of deep neural networks can be more challenging than traditional convex optimization problems due to the highly non-convex nature of the loss function, e.g. it can involve pathological landscapes such as…