atlas

Research map / Optimization / Nonconvex and smooth optimization

Convergent Block Coordinate Descent for Training Tikhonov Regularized Deep Neural Networks

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 41 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
Train the dense network with BCD instead of a Caffe SGD-based solverMNIST network with three hidden layers · MNISTtest-set classification errorHelped
Train a sparse network with BCD-S instead of a Caffe SGD-based solverMNIST network with three hidden layers · MNISTtest-set classification errorHelped
Use sparse-learning constraints instead of dense learning (ablation)BCD · MNISTclassification accuracy: 1.34% lowerHurt
Use sparse-learning constraints instead of dense learning (ablation)BCD · MNISTnonzero weights: 97.15% -> 2.42%Helped
Use BCD instead of the ADMM-based methodSupervised hashing network · MNIST supervised hashingtraining time: about 9 hours -> within 1 hourHelped
Use BCD instead of the ADMM-based methodSupervised hashing network · MNIST supervised hashingprecision, recall, and mAPHelped
Use BCD instead of the ADMM-based methodSupervised hashing network · CIFAR-10 supervised hashingtraining timeHelped

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