Research map / Optimization / Nonconvex and smooth optimization
An Efficient Fisher Matrix Approximation Method for Large-Scale Neural Network Optimization
Minghan Yang, Dong Xu, Qiwen Cui, Zaiwen Wen, Pengxiang Xu
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Scalable Kronecker-Factored Fisher Approximation for Neural Network Parameter Sensitivity (ICML 2026 · similarity 0.89)
- Trade-Offs of Diagonal Fisher Information Matrix Estimators (NeurIPS 2024 · similarity 0.86)
- AdaFisher: Adaptive Second Order Optimization via Fisher Information (ICLR 2025 · similarity 0.85)
- Fishers for Free? Approximating the Fisher Information Matrix by Recycling the Squared Gradient Accumulator (ICML 2025 · similarity 0.85)
- A Layer-Wise Natural Gradient Optimizer for Training Deep Neural Networks (NeurIPS 2024 · similarity 0.85)
- An Improved Empirical Fisher Approximation for Natural Gradient Descent (NeurIPS 2024 · 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.
