atlas

Research map / Optimization / Nonconvex and smooth optimization

Global Convergence of Block Coordinate Descent in Deep Learning

ICML 2019 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 32 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use proximal updates for non-strongly convex subproblemsTwo-splitting and three-splitting BCD for DNN training · DNN trainingaverage squared subgradient norm: O(1/K)Helped
Use activations Lipschitz continuous on bounded sets and handle the BCD updates accordinglyTwo-splitting and three-splitting BCD for DNN training · DNN trainingaverage squared subgradient norm: O(1/K)Helped
Use a prox-linear output-state update with a smooth loss having Lipschitz continuous gradientTwo-splitting and three-splitting BCD · DNN training with smooth lossaverage squared subgradient norm: O(1/K)Helped
Adapt three-splitting BCD to residual-layer constraintsResNet three-splitting BCD · ResNet trainingaverage squared subgradient norm: O(1/K)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy