Gauss-Newton Natural Gradient Descent for Shape Learning

James King, Arturs Berzins, Siddhartha Mishra, Marius Zeinhofer
1/24/2026
cs.LGmath.OC

No confident code implementation found for this paper.

Abstract

We explore the use of the Gauss-Newton method for optimization in shape learning, including implicit neural surfaces and geometry-informed neural networks. The method addresses key challenges in shape learning, such as the ill-conditioning of the underlying differential constraints and the mismatch between the optimization problem in parameter space and the function space where the problem is naturally posed. This leads to significantly faster and more stable convergence than standard first-order methods, while also requiring far fewer iterations. Experiments across benchmark shape optimization tasks demonstrate that the Gauss-Newton method consistently improves both training speed and final solution accuracy.

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{king2026gaussnewton,
  title  = {Gauss-Newton Natural Gradient Descent for Shape Learning},
  author = {James King and Arturs Berzins and Siddhartha Mishra and Marius Zeinhofer},
  year   = {2026},
  eprint = {2602.00099},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.00099v1}
}

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/2602.00099.svg)](https://codeofpaper.com/paper/2602.00099)

Discussion