{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PB3SJY33SQMW4EAVITEC3IRLEQ","short_pith_number":"pith:PB3SJY33","schema_version":"1.0","canonical_sha256":"787724e37b94196e101544c82da22b24032ad4856a135a0c7b1af0ffb5b0a8bd","source":{"kind":"arxiv","id":"1201.5885","version":1},"attestation_state":"computed","paper":{"title":"Improvements to the Levenberg-Marquardt algorithm for nonlinear least-squares minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"physics.data-an","authors_text":"James P. Sethna, Mark K. Transtrum","submitted_at":"2012-01-27T20:40:44Z","abstract_excerpt":"When minimizing a nonlinear least-squares function, the Levenberg-Marquardt algorithm can suffer from a slow convergence, particularly when it must navigate a narrow canyon en route to a best fit. On the other hand, when the least-squares function is very flat, the algorithm may easily become lost in parameter space. We introduce several improvements to the Levenberg-Marquardt algorithm in order to improve both its convergence speed and robustness to initial parameter guesses. We update the usual step to include a geodesic acceleration correction term, explore a systematic way of accepting uph"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1201.5885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2012-01-27T20:40:44Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"c24dcfcb39acfdbd755d904b2a5423a9222a0bd4e907d6c1d2bcd35981d2abd8","abstract_canon_sha256":"6a9aa34a034312f94eb2787026bcf2bdbb5736ca91463cfc949aeed9a3b8971e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:44.291359Z","signature_b64":"ieiQ4+kyUjJoiEFBWvXhXDOSW8ICPM9oASxsf2pSz2QW/lnXPomiMsbwgi4+D+V4xj9/jA0ocOijaWnGjD0ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787724e37b94196e101544c82da22b24032ad4856a135a0c7b1af0ffb5b0a8bd","last_reissued_at":"2026-05-18T04:03:44.290807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:44.290807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improvements to the Levenberg-Marquardt algorithm for nonlinear least-squares minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"physics.data-an","authors_text":"James P. Sethna, Mark K. Transtrum","submitted_at":"2012-01-27T20:40:44Z","abstract_excerpt":"When minimizing a nonlinear least-squares function, the Levenberg-Marquardt algorithm can suffer from a slow convergence, particularly when it must navigate a narrow canyon en route to a best fit. On the other hand, when the least-squares function is very flat, the algorithm may easily become lost in parameter space. We introduce several improvements to the Levenberg-Marquardt algorithm in order to improve both its convergence speed and robustness to initial parameter guesses. We update the usual step to include a geodesic acceleration correction term, explore a systematic way of accepting uph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5885","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.5885","created_at":"2026-05-18T04:03:44.290900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5885v1","created_at":"2026-05-18T04:03:44.290900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5885","created_at":"2026-05-18T04:03:44.290900+00:00"},{"alias_kind":"pith_short_12","alias_value":"PB3SJY33SQMW","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PB3SJY33SQMW4EAV","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PB3SJY33","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.07625","citing_title":"GATO: GPU-Accelerated and Batched Trajectory Optimization for Scalable Edge Model Predictive Control","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2604.10782","citing_title":"Inferring Unreported Measurement Uncertainties via Information Geometry in Astrophysics","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ","json":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ.json","graph_json":"https://pith.science/api/pith-number/PB3SJY33SQMW4EAVITEC3IRLEQ/graph.json","events_json":"https://pith.science/api/pith-number/PB3SJY33SQMW4EAVITEC3IRLEQ/events.json","paper":"https://pith.science/paper/PB3SJY33"},"agent_actions":{"view_html":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ","download_json":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ.json","view_paper":"https://pith.science/paper/PB3SJY33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5885&json=true","fetch_graph":"https://pith.science/api/pith-number/PB3SJY33SQMW4EAVITEC3IRLEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PB3SJY33SQMW4EAVITEC3IRLEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ/action/storage_attestation","attest_author":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ/action/author_attestation","sign_citation":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ/action/citation_signature","submit_replication":"https://pith.science/pith/PB3SJY33SQMW4EAVITEC3IRLEQ/action/replication_record"}},"created_at":"2026-05-18T04:03:44.290900+00:00","updated_at":"2026-05-18T04:03:44.290900+00:00"}