{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SXKINSDQ2XJN6VZYRLKRV3Z4K2","short_pith_number":"pith:SXKINSDQ","schema_version":"1.0","canonical_sha256":"95d486c870d5d2df57388ad51aef3c56b682fbb03e1906d9d0573d53d1f94edd","source":{"kind":"arxiv","id":"1909.09501","version":2},"attestation_state":"computed","paper":{"title":"Trivializations for Gradient-Based Optimization on Manifolds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mario Lezcano-Casado","submitted_at":"2019-09-20T13:41:43Z","abstract_excerpt":"We introduce a framework to study the transformation of problems with manifold constraints into unconstrained problems through parametrizations in terms of a Euclidean space. We call these parametrizations \"trivializations\". We prove conditions under which a trivialization is sound in the context of gradient-based optimization and we show how two large families of trivializations have overall favorable properties, but also suffer from a performance issue. We then introduce \"dynamic trivializations\", which solve this problem, and we show how these form a family of optimization methods that lie "},"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":"1909.09501","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T13:41:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"33d35c7bf99e5dcc91ef3057bcc0e2425956cb95f7a0bf8a08724f7654c003d0","abstract_canon_sha256":"65ba23f97dcb0e38df1ed0d8943e871cf9ff804378ad7f776a20e4574c0eabcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:14:45.021368Z","signature_b64":"6qzW2FML+cO9dLd6neHQ8XTtvzBhPhlJA6UdU1+IpbQQcntELqa2UaMxvJAHmerXmQMx7PLUAziYEq9QGzc2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d486c870d5d2df57388ad51aef3c56b682fbb03e1906d9d0573d53d1f94edd","last_reissued_at":"2026-07-05T00:14:45.021023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:14:45.021023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trivializations for Gradient-Based Optimization on Manifolds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mario Lezcano-Casado","submitted_at":"2019-09-20T13:41:43Z","abstract_excerpt":"We introduce a framework to study the transformation of problems with manifold constraints into unconstrained problems through parametrizations in terms of a Euclidean space. We call these parametrizations \"trivializations\". We prove conditions under which a trivialization is sound in the context of gradient-based optimization and we show how two large families of trivializations have overall favorable properties, but also suffer from a performance issue. We then introduce \"dynamic trivializations\", which solve this problem, and we show how these form a family of optimization methods that lie "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.09501","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.09501/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.09501","created_at":"2026-07-05T00:14:45.021079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.09501v2","created_at":"2026-07-05T00:14:45.021079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09501","created_at":"2026-07-05T00:14:45.021079+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXKINSDQ2XJN","created_at":"2026-07-05T00:14:45.021079+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXKINSDQ2XJN6VZY","created_at":"2026-07-05T00:14:45.021079+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXKINSDQ","created_at":"2026-07-05T00:14:45.021079+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16035","citing_title":"Equivariant Eikonal Neural Networks: Grid-Free, Scalable Travel-Time Prediction on Homogeneous Spaces","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2","json":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2.json","graph_json":"https://pith.science/api/pith-number/SXKINSDQ2XJN6VZYRLKRV3Z4K2/graph.json","events_json":"https://pith.science/api/pith-number/SXKINSDQ2XJN6VZYRLKRV3Z4K2/events.json","paper":"https://pith.science/paper/SXKINSDQ"},"agent_actions":{"view_html":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2","download_json":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2.json","view_paper":"https://pith.science/paper/SXKINSDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.09501&json=true","fetch_graph":"https://pith.science/api/pith-number/SXKINSDQ2XJN6VZYRLKRV3Z4K2/graph.json","fetch_events":"https://pith.science/api/pith-number/SXKINSDQ2XJN6VZYRLKRV3Z4K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2/action/storage_attestation","attest_author":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2/action/author_attestation","sign_citation":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2/action/citation_signature","submit_replication":"https://pith.science/pith/SXKINSDQ2XJN6VZYRLKRV3Z4K2/action/replication_record"}},"created_at":"2026-07-05T00:14:45.021079+00:00","updated_at":"2026-07-05T00:14:45.021079+00:00"}