Research map / Optimization / Optimizers
EIPO: Efficient Inter-Step Parallel Optimization
Jianrong Lu, Zhuoya Gu, Zhiyu Zhu, Hui LIU, Junhui Hou
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Recasts gradient-descent trajectories as the root of a nonlinear operator and uses parallel root-finding to update multiple optimizer steps simultaneously to cut wall-clock training time.
Problem
Wall-clock cost of training large neural networks is dominated by the long sequential chain of optimizer iterations.
Approach
Treats the GD (SGD/Adam) trajectory as the unique root of a nonlinear operator so that multiple GD steps can be solved for in parallel via root-finding, rather than computed one after another.
Experimental setup
Metrics: wall-clock time
Builds on: SGD Adam
Closest papers by meaning
- PASO: Step Parallel Stochastic Optimization (ICML 2026 · similarity 0.88)
- Lean and Mean Adaptive Optimization via Subset-Norm and Subspace-Momentum with Convergence Guarantees (ICML 2025 · similarity 0.86)
- Adam with model exponential moving average is effective for nonconvex optimization (NeurIPS 2024 · similarity 0.86)
- Perfect Parallelization in Mini-Batch SGD with Classical Momentum Acceleration (NeurIPS 2026 · similarity 0.86)
- Learning Provably Improves the Convergence of Gradient Descent (NeurIPS 2025 · similarity 0.85)
- A Stable Whitening Optimizer for Efficient Neural Network Training (NeurIPS 2025 · similarity 0.85)
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.
