mlsanityData to 7 Oct 2026

A Proximal Block Coordinate Descent Algorithm for Deep Neural Network Training

arXiv 1803.09082 ↗First posted 24 Mar 2018stat.ML cs.LG math.OCcited by 15

Not on the map. Why?

Abstract (arXiv)

Training deep neural networks (DNNs) efficiently is a challenge due to the associated highly nonconvex optimization. The backpropagation (backprop) algorithm has long been the most widely used algorithm for gradient computation of parameters of DNNs and is used along with gradient descent-type algorithms for this optimization task. Recent work have shown the efficiency of block coordinate descent (BCD) type methods empirically for training DNNs. In view of this, we propose a novel algorithm based on the BCD method for training DNNs and provide its global convergence results built upon the powerful framework of the Kurdyka-Lojasiewicz (KL) property. Numerical experiments on standard datasets demonstrate its competitive efficiency against standard optimizers with backprop.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Mar 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 5; 2023: 1; 2024: 2; 2025: 3.

15 papers.

Sort: