Analysis of NaN Divergence in Training Monocular Depth Estimation Model

Bum Jun Kim, Hyeonah Jang, Sang Woo Kim
11/7/2023
cs.CV

No confident code implementation found for this paper.

Abstract

The latest advances in deep learning have facilitated the development of highly accurate monocular depth estimation models. However, when training a monocular depth estimation network, practitioners and researchers have observed not a number (NaN) loss, which disrupts gradient descent optimization. Although several practitioners have reported the stochastic and mysterious occurrence of NaN loss that bothers training, its root cause is not discussed in the literature. This study conducted an in-depth analysis of NaN loss during training a monocular depth estimation network and identified three types of vulnerabilities that cause NaN loss: 1) the use of square root loss, which leads to an unstable gradient; 2) the log-sigmoid function, which exhibits numerical stability issues; and 3) certain variance implementations, which yield incorrect computations. Furthermore, for each vulnerability, the occurrence of NaN loss was demonstrated and practical guidelines to prevent NaN loss were presented. Experiments showed that both optimization stability and performance on monocular depth estimation could be improved by following our guidelines.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kim2023analysis,
  title  = {Analysis of NaN Divergence in Training Monocular Depth Estimation Model},
  author = {Bum Jun Kim and Hyeonah Jang and Sang Woo Kim},
  year   = {2023},
  eprint = {2311.03938},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.03938v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.03938.svg)](https://codeofpaper.com/paper/2311.03938)

Discussion