Pith. sign in

REVIEW 2 cited by

Never look back - A modified EnKF method and its application to the training of neural networks without back propagation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.08034 v2 pith:3TEA7LDU submitted 2018-05-21 math.NA cs.LGcs.NAcs.NE

classification math.NAcs.LGcs.NAcs.NE
keywords methodenkfnetworksneuraltrainingbackoptimizationpropagation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work, we present a new derivative-free optimization method and investigate its use for training neural networks. Our method is motivated by the Ensemble Kalman Filter (EnKF), which has been used successfully for solving optimization problems that involve large-scale, highly nonlinear dynamical systems. A key benefit of the EnKF method is that it requires only the evaluation of the forward propagation but not its derivatives. Hence, in the context of neural networks, it alleviates the need for back propagation and reduces the memory consumption dramatically. However, the method is not a pure "black-box" global optimization heuristic as it efficiently utilizes the structure of typical learning problems. Promising first results of the EnKF for training deep neural networks have been presented recently by Kovachki and Stuart. We propose an important modification of the EnKF that enables us to prove convergence of our method to the minimizer of a strongly convex function. Our method also bears similarity with implicit filtering and we demonstrate its potential for minimizing highly oscillatory functions using a simple example. Further, we provide numerical examples that demonstrate the potential of our method for training deep neural networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Ensemble Kalman Inversion as an Inertial Interacting Particle System

    math.NA 2026-06 unverdicted novelty 6.0 of 10

    Introduces an inertial interacting particle reformulation of EKI with repulsion, analyzes linear stability and equilibria for linear inverse problems, and shows exponential decay in a suitable parameter regime.

  2. Training neural networks without backpropagation using particles

    cs.NE 2024-12 conditional novelty 4.0 of 10

    Training each neuron of a multilayer perceptron with its own particle-swarm search, instead of using backpropagation, reaches accuracy comparable to gradient-based training on two real datasets and several synthetic ones.

Pith tools