Skip to main content

Geometry of nonlinear least squares with applications to sloppy models and optimization

Cornell Affiliated Author(s)

Author

M.K. Transtrum
B.B. Machta
J.P. Sethna

Abstract

Parameter estimation by nonlinear least-squares minimization is a common problem that has an elegant geometric interpretation: the possible parameter values of a model induce a manifold within the space of data predictions. The minimization problem is then to find the point on the manifold closest to the experimental data. We show that the model manifolds of a large class of models, known as sloppy models, have many universal features; they are characterized by a geometric series of widths, extrinsic curvatures, and parameter-effect curvatures, which we describe as a hyper-ribbon. A number of common difficulties in optimizing least-squares problems are due to this common geometric structure. First, algorithms tend to run into the boundaries of the model manifold, causing parameters to diverge or become unphysical before they have been optimized. We introduce the model graph as an extension of the model manifold to remedy this problem. We argue that appropriate priors can remove the boundaries and further improve the convergence rates. We show that typical fits will have many evaporated parameters unless the data are very accurately known. Second, "bare" model parameters are usually ill-suited to describing model behavior; cost contours in parameter space tend to form hierarchies of plateaus and long narrow canyons. Geometrically, we understand this inconvenient parametrization as an extremely skewed coordinate basis and show that it induces a large parameter-effect curvature on the manifold. By constructing alternative coordinates based on geodesic motion, we show that these long narrow canyons are transformed in many cases into a single quadratic, isotropic basin. We interpret the modified Gauss-Newton and Levenberg-Marquardt fitting algorithms as an Euler approximation to geodesic motion in these natural coordinates on the model manifold and the model graph, respectively. By adding a geodesic acceleration adjustment to these algorithms, we alleviate the difficulties from parameter-effect curvature, improving both efficiency and success rates at finding good fits. © 2011 American Physical Society.

Date Published

Journal

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volume

83

Issue

3

URL

https://www.scopus.com/inward/record.uri?eid=2-s2.0-79953156419&doi=10.1103%2fPhysRevE.83.036701&partnerID=40&md5=c6f802b0db5e45ccb8ebec26a6681084

DOI

10.1103/PhysRevE.83.036701

Group (Lab)

James Sethna Group

Funding Source

0705167

Download citation