ISAAC Newton: Input-based Approximate Curvature for Newton's Method
Not on the map. Why?
Abstract (arXiv)
We present ISAAC (Input-baSed ApproximAte Curvature), a novel method that conditions the gradient using selected second-order information and has an asymptotically vanishing computational overhead, assuming a batch size smaller than the number of neurons. We show that it is possible to compute a good conditioner based on only the input to a respective layer without a substantial computational overhead. The proposed method allows effective training even in small-batch stochastic regimes, which makes it competitive to first-order as well as second-order methods.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 24 of its 42 references that are in the map. First posted on arXiv 1 May 2023.
Builds on
24 of 42 references.
References · 24
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 998
- 2018Neural Network Acceptability Judgmentscited by 952
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2014New insights and perspectives on the natural gradient methodcited by 435
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 213
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
- 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 139
12 more
- 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 138
- 2019BackPACK: Packing more into backpropcited by 77
- 2015Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergencecited by 72
- 2020Practical Quasi-Newton Methods for Training Deep Neural Networkscited by 67
- 2021M-FAC: Efficient Matrix-Free Approximations of Second-Order Informationcited by 54
- 2015Convergence rates of sub-sampled Newton methodscited by 32
- 2013Riemannian metrics for neural networks I: feedforward networkscited by 29
- 2016Sub-sampled Newton Methods with Non-uniform Samplingcited by 21
- 2019Modular Block-diagonal Curvature Approximations for Feedforward Architecturescited by 13
- 2016Sub-Sampled Newton Methods I: Globally Convergent Algorithmscited by 8
- 2015Faster SGD Using Sketched Conditioningcited by 3
- 2020Convex optimization based on global lower second-order modelscited by 3
Built on by
Citing papers per year: 2024: 4; 2025: 1; 2026: 1.
6 papers.
- 2024Kronecker-Factored Approximate Curvature for Physics-Informed Neural Networkscited by 21
- 2024An Improved Empirical Fisher Approximation for Natural Gradient Descentcited by 15
- 2025Position: Curvature Matrices Should Be Democratized via Linear Operatorscited by 9
- 2024Newton Losses: Using Curvature Information for Learning with Differentiable Algorithmscited by 2
- 2026Efficient Bilevel Optimization with KFAC-Based Hypergradientscited by 1
- 2024TrAct: Making First-layer Pre-Activations Trainablecited by 0
- 2026Efficient Bilevel Optimization with KFAC-Based Hypergradients31 Mar 2026
- 2025Position: Curvature Matrices Should Be Democratized via Linear Operators31 Jan 2025
- 2024TrAct: Making First-layer Pre-Activations Trainable31 Oct 2024
- 2024Newton Losses: Using Curvature Information for Learning with Differentiable Algorithms24 Oct 2024
- 2024An Improved Empirical Fisher Approximation for Natural Gradient Descent10 Jun 2024
- 2024Kronecker-Factored Approximate Curvature for Physics-Informed Neural Networks24 May 2024