Approximate Fisher Information Matrix to Characterise the Training of Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
In this paper, we introduce a novel methodology for characterising the performance of deep learning networks (ResNets and DenseNet) with respect to training convergence and generalisation as a function of mini-batch size and learning rate for image classification. This methodology is based on novel measurements derived from the eigenvalues of the approximate Fisher information matrix, which can be efficiently computed even for high capacity deep models. Our proposed measurements can help practitioners to monitor and control the training process (by actively tuning the mini-batch size and learning rate) to allow for good training convergence and generalisation. Furthermore, the proposed measurements also allow us to show that it is possible to optimise the training process with a new dynamic sampling training approach that continuously and automatically change the mini-batch size and learning rate during the training process. Finally, we show that the proposed dynamic sampling training approach has a faster training time and a competitive classification accuracy compared to the current state of the art.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 2; 2024: 4; 2025: 3; 2026: 1.
12 papers.
- 2023Weighted Ensemble Models Are Strong Continual Learnerscited by 42
- 2021Post-mortem on a deep learning contest: a Simpson's paradox and the complementary roles of scale metrics versus shape metricscited by 19
- 2025NoT: Federated Unlearning via Weight Negationcited by 15
- 2021Effective dimension of machine learning modelscited by 14
- 2024Evolutionary Optimization for Designing Variational Quantum Circuits with High Model Capacitycited by 9
- 2024MAGICS: Adversarial RL with Minimax Actors Guided by Implicit Critic Stackelberg for Convergent Neural Synthesis of Robot Safetycited by 7
- 2023Efficient Activation Function Optimization through Surrogate Modelingcited by 5
- 2024Task2Box: Box Embeddings for Modeling Asymmetric Task Relationshipscited by 3
- 2024Information Guided Regularization for Fine-tuning Language Modelscited by 1
- 2025T2I-ConBench: Text-to-Image Benchmark for Continual Post-trainingcited by 1
- 2025Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapescited by 0
- 2026TASER: Task-Aware Spectral Energy Refine for Backdoor Suppression in UAV Swarms Decentralized Federated Learningcited by 0
- 2026TASER: Task-Aware Spectral Energy Refine for Backdoor Suppression in UAV Swarms Decentralized Federated Learning10 Mar 2026
- 2025Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes21 Nov 2025
- 2025T2I-ConBench: Text-to-Image Benchmark for Continual Post-training22 May 2025
- 2025NoT: Federated Unlearning via Weight Negation7 Mar 2025
- 2024Evolutionary Optimization for Designing Variational Quantum Circuits with High Model Capacity17 Dec 2024
- 2024MAGICS: Adversarial RL with Minimax Actors Guided by Implicit Critic Stackelberg for Convergent Neural Synthesis of Robot Safety20 Sep 2024
- 2024Information Guided Regularization for Fine-tuning Language Models20 Jun 2024
- 2024Task2Box: Box Embeddings for Modeling Asymmetric Task Relationships25 Mar 2024
- 2023Weighted Ensemble Models Are Strong Continual Learners14 Dec 2023
- 2023Efficient Activation Function Optimization through Surrogate Modeling13 Jan 2023
- 2021Effective dimension of machine learning models9 Dec 2021
- 2021Post-mortem on a deep learning contest: a Simpson's paradox and the complementary roles of scale metrics versus shape metrics1 Jun 2021