mlsanityData to 7 Oct 2026

Exploring the Geometry and Topology of Neural Network Loss Landscapes

arXiv 2102.00485 ↗First posted 31 Jan 2021cs.LG stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

Recent work has established clear links between the generalization performance of trained neural networks and the geometry of their loss landscape near the local minima to which they converge. This suggests that qualitative and quantitative examination of the loss landscape geometry could yield insights about neural network generalization performance during training. To this end, researchers have proposed visualizing the loss landscape through the use of simple dimensionality reduction techniques. However, such visualization methods have been limited by their linear nature and only capture features in one or two dimensions, thus restricting sampling of the loss landscape to lines or planes. Here, we expand and improve upon these in three ways. First, we present a novel "jump and retrain" procedure for sampling relevant portions of the loss landscape. We show that the resulting sampled data holds more meaningful information about the network's ability to generalize. Next, we show that non-linear dimensionality reduction of the jump and retrain trajectories via PHATE, a trajectory and manifold-preserving method, allows us to visualize differences between networks that are generalizing well vs poorly. Finally, we combine PHATE trajectories with a computational homology characterization to quantify trajectory differences.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 11 of its 23 references that are in the map. First posted on arXiv 31 Jan 2021.

Builds on

11 of 23 references.

References · 11

  1. 2016Wide Residual Networkscited by 3,057
  2. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  3. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  4. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  5. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  6. 2014Qualitatively characterizing neural network optimization problemscited by 186
  7. 2017Deep Learning with Topological Signaturescited by 113
  8. 2019Graph Filtration Learningcited by 68
  9. 2019Learning metrics for persistence-based summaries and applications for graph classificationcited by 57
  10. 2020Uncovering the Topology of Time-Varying fMRI Data using Cubical Persistencecited by 26
  11. 2016An empirical analysis of the optimization of deep network loss surfacescited by 21

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 3; 2024: 6; 2025: 0; 2026: 2.

14 papers.

Sort: