Ensemble Kalman inversion: a derivative-free technique for machine learning tasks. (20th August 2019)

• Record Type: Journal Article
• Authors: Kovachki, Nikola B; Stuart, Andrew M
• Is Part Of: Inverse problems. Volume 35:Number 9(2019)
• Publication Date: 2019-08-20
• Subjects: machine learning -- deep learning -- derivative-free optimization -- ensemble Kalman inversion -- ensemble Kalman filtering; Inverse problems (Differential equations) -- Periodicals; 515.357
• DOI: 10.1088/1361-6420/ab1c3a
• Languages: English
• ISSNs: 0266-5611

Abstract

Abstract: The standard probabilistic perspective on machine learning gives rise to empirical risk-minimization tasks that are frequently solved by stochastic gradient descent (SGD) and variants thereof. We present a formulation of these tasks as classical inverse or filtering problems and, furthermore, we propose an efficient, gradient-free algorithm for finding a solution to these problems using ensemble Kalman inversion (EKI). The method is inherently parallelizable and is applicable to problems with non-differentiable loss functions, for which back-propagation is not possible. Applications of our approach include offline and online supervised learning with deep neural networks, as well as graph-based semi-supervised learning. The essence of the EKI procedure is an ensemble based approximate gradient descent in which derivatives are replaced by differences from within the ensemble. We suggest several modifications to the basic method, derived from empirically successful heuristics developed in the context of SGD. Numerical results demonstrate wide applicability and robustness of the proposed algorithm.