paper-with-me

Papers

Unraveling the Hessian: A Key to Smooth Convergence in Loss Function Landscapes

2024-09-18 · Nikita Kiselev, Andrey Grabovoy

The loss landscape of neural networks is a critical aspect of their training, and understanding its properties is essential for improving their performance. In this paper, we investigate how the loss surface changes when the sample size increases, a previously unexplored issue. We theoretically analyze the convergence of the loss landscape in a fully connected neural network and derive upper bounds for the difference in loss function values when adding a new object to the sample. Our empirical study confirms these results on various datasets, demonstrating the convergence of the loss function surface for image classification tasks. Our findings provide insights into the local geometry of neural loss landscapes and have implications for the development of sample size determination techniques.

📄 PDF Abstract BibTeX arXiv:2409.11995

Code (1)

kisnikser/landscape-hessian 공식 구현 pytorch

Tasks

image-classificationImage Classification

Similar Papers 제목 키워드 기반

Wolkowicz-Styan Upper Bound on the Hessian Eigenspectrum for Cross-Entropy Loss in Nonlinear Smooth Neural Networks

2026-04-11 · Yuto Omae, Kazuki Sakai, Yohei Kakimoto, Makoto Sasaki 외 arxiv

Neural networks (NNs) are central to modern machine learning and achieve state-of-the-art results in many applications. However, the relationship between loss geometry and generalization is still not well understood. The…

Gradient-Normalized Smoothness for Optimization with Approximate Hessians

2025-06-16 · Andrei Semenov, Martin Jaggi, Nikita Doikov

In this work, we develop new optimization algorithms that use approximate second-order information combined with the gradient regularization technique to achieve fast global convergence rates for both convex and non-conv…

A Proximal Stochastic Quasi-Newton Algorithm

2016-01-31 · Luo Luo, Zihao Chen, Zhihua Zhang, Wu-Jun Li

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth comp…

Hessian Based Smoothing Splines for Manifold Learning

2023-02-10 · Juno Kim

We propose a multidimensional smoothing spline algorithm in the context of manifold learning. We generalize the bending energy penalty of thin-plate splines to a quadratic form on the Sobolev space of a flat manifold, ba…

Optimization and Generalization Guarantees for Weight Normalization

2024-09-13 · Pedro Cisneros-Velarde, Zhijie Chen, Sanmi Koyejo, Arindam Banerjee

Weight normalization (WeightNorm) is widely used in practice for the training of deep neural networks and modern deep learning libraries have built-in implementations of it. In this paper, we provide the first theoretica…