{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2XZDIIJNPGJJHTMRKKHUTKCXIE","short_pith_number":"pith:2XZDIIJN","canonical_record":{"source":{"id":"2604.02969","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-03T11:08:59Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"49eb9796127f9a6f7277855863c4d31edae4d022ad98776580ff632326be5704","abstract_canon_sha256":"96f3126de07bde542cb95d5b1de3ce498f35c751e8b915aa02f0cf48a9909bc5"},"schema_version":"1.0"},"canonical_sha256":"d5f234212d799293cd91528f49a8574137b11f31c6a4e51c89cf06fd85eb341d","source":{"kind":"arxiv","id":"2604.02969","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.02969","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"arxiv_version","alias_value":"2604.02969v2","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.02969","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"pith_short_12","alias_value":"2XZDIIJNPGJJ","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"pith_short_16","alias_value":"2XZDIIJNPGJJHTMR","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"pith_short_8","alias_value":"2XZDIIJN","created_at":"2026-06-01T01:03:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2XZDIIJNPGJJHTMRKKHUTKCXIE","target":"record","payload":{"canonical_record":{"source":{"id":"2604.02969","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-03T11:08:59Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"49eb9796127f9a6f7277855863c4d31edae4d022ad98776580ff632326be5704","abstract_canon_sha256":"96f3126de07bde542cb95d5b1de3ce498f35c751e8b915aa02f0cf48a9909bc5"},"schema_version":"1.0"},"canonical_sha256":"d5f234212d799293cd91528f49a8574137b11f31c6a4e51c89cf06fd85eb341d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:52.543724Z","signature_b64":"q0/g9tg4X5KmL4rzG7OGmCGzS3WOmO4rItYaCToG5dh81hjQ99MYPVHwBHNq0Wr9PAsIzlaW/vloNiJLYw/rBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f234212d799293cd91528f49a8574137b11f31c6a4e51c89cf06fd85eb341d","last_reissued_at":"2026-06-01T01:03:52.542611Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:52.542611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.02969","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:03:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcy3dwOvO5uv42VB6T94ybJlWx2ELG4CHhYMJeHAwu87nk/3sjVwoLHOf9dJKkAmLc0uuth5kIPgU8t3p7UqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:23:10.311077Z"},"content_sha256":"78999df1e95e65131bf6f46b09e03eda1275373f154155f26fc8200f22ebf01a","schema_version":"1.0","event_id":"sha256:78999df1e95e65131bf6f46b09e03eda1275373f154155f26fc8200f22ebf01a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2XZDIIJNPGJJHTMRKKHUTKCXIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inversion-Free Natural Gradient Descent on Riemannian Manifolds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An inversion-free natural gradient method on Riemannian manifolds updates an online approximation to the inverse Fisher information matrix using transported score vectors.","cross_cats":["cs.LG","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Dario Draca, Minh-Ngoc Tran, Takuo Matsubara","submitted_at":"2026-04-03T11:08:59Z","abstract_excerpt":"The natural gradient method is a central tool for statistical optimisation, but its broader application is hindered by the assumption of a Euclidean parameter space, the repeated estimation of the Fisher information matrix (FIM), and the computational cost of its subsequent inversion. This paper proposes an intrinsic, inversion-free natural gradient method for statistical models whose parameters lie on general Riemannian manifolds. Formulating statistical optimisation in this non-Euclidean setting allows for the natural enforcement of parameter constraints, the elimination of non-identifiable "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove almost-sure convergence rates of O(log s / s^α) for the squared distance to the minimizer when the step size exponent α > 2/3. We also establish almost-sure rates for the approximate FIM, which now accumulates transport-based errors.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That transport operations between tangent spaces at successive iterates can be performed accurately enough that accumulated errors do not destroy the claimed convergence rates, and that the manifold admits sufficient regularity (e.g., geodesic convexity) for the stochastic approximation to converge.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper develops an inversion-free natural gradient descent algorithm on Riemannian manifolds that maintains an online approximation of the inverse Fisher information matrix using transported score vectors and proves almost-sure convergence rates of O(log s / s^α) for α > 2/3.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An inversion-free natural gradient method on Riemannian manifolds updates an online approximation to the inverse Fisher information matrix using transported score vectors.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d4b295e07b49b8a1b6608a77f585bcfcd6f7a8a89f09a7b01db3342fe5b5a270"},"source":{"id":"2604.02969","kind":"arxiv","version":2},"verdict":{"id":"43a96799-bcb7-482e-ae79-79dbcf548465","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T18:12:12.978807Z","strongest_claim":"We prove almost-sure convergence rates of O(log s / s^α) for the squared distance to the minimizer when the step size exponent α > 2/3. We also establish almost-sure rates for the approximate FIM, which now accumulates transport-based errors.","one_line_summary":"The paper develops an inversion-free natural gradient descent algorithm on Riemannian manifolds that maintains an online approximation of the inverse Fisher information matrix using transported score vectors and proves almost-sure convergence rates of O(log s / s^α) for α > 2/3.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That transport operations between tangent spaces at successive iterates can be performed accurately enough that accumulated errors do not destroy the claimed convergence rates, and that the manifold admits sufficient regularity (e.g., geodesic convexity) for the stochastic approximation to converge.","pith_extraction_headline":"An inversion-free natural gradient method on Riemannian manifolds updates an online approximation to the inverse Fisher information matrix using transported score vectors."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.02969/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":2,"snapshot_sha256":"7342b468ece791d2a755eff736db42298a7fd9fcd13d418f11bb053598e438b9"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"43a96799-bcb7-482e-ae79-79dbcf548465"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:03:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ya09VCmkcxel7TudQQPQVr1mTl6/dh+tMqTcVTNzLJqzoyuF3PwPfYQOmfvGRLdLGPRJY2GY5CxROiNv/b8CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:23:10.311761Z"},"content_sha256":"740f50d2b51ef66f04b27cb523ab3a18e3a0599f03e2ed60bf6b4c369ff0eece","schema_version":"1.0","event_id":"sha256:740f50d2b51ef66f04b27cb523ab3a18e3a0599f03e2ed60bf6b4c369ff0eece"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XZDIIJNPGJJHTMRKKHUTKCXIE/bundle.json","state_url":"https://pith.science/pith/2XZDIIJNPGJJHTMRKKHUTKCXIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XZDIIJNPGJJHTMRKKHUTKCXIE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T00:23:10Z","links":{"resolver":"https://pith.science/pith/2XZDIIJNPGJJHTMRKKHUTKCXIE","bundle":"https://pith.science/pith/2XZDIIJNPGJJHTMRKKHUTKCXIE/bundle.json","state":"https://pith.science/pith/2XZDIIJNPGJJHTMRKKHUTKCXIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XZDIIJNPGJJHTMRKKHUTKCXIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2XZDIIJNPGJJHTMRKKHUTKCXIE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96f3126de07bde542cb95d5b1de3ce498f35c751e8b915aa02f0cf48a9909bc5","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-03T11:08:59Z","title_canon_sha256":"49eb9796127f9a6f7277855863c4d31edae4d022ad98776580ff632326be5704"},"schema_version":"1.0","source":{"id":"2604.02969","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.02969","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"arxiv_version","alias_value":"2604.02969v2","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.02969","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"pith_short_12","alias_value":"2XZDIIJNPGJJ","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"pith_short_16","alias_value":"2XZDIIJNPGJJHTMR","created_at":"2026-06-01T01:03:52Z"},{"alias_kind":"pith_short_8","alias_value":"2XZDIIJN","created_at":"2026-06-01T01:03:52Z"}],"graph_snapshots":[{"event_id":"sha256:740f50d2b51ef66f04b27cb523ab3a18e3a0599f03e2ed60bf6b4c369ff0eece","target":"graph","created_at":"2026-06-01T01:03:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove almost-sure convergence rates of O(log s / s^α) for the squared distance to the minimizer when the step size exponent α > 2/3. We also establish almost-sure rates for the approximate FIM, which now accumulates transport-based errors."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That transport operations between tangent spaces at successive iterates can be performed accurately enough that accumulated errors do not destroy the claimed convergence rates, and that the manifold admits sufficient regularity (e.g., geodesic convexity) for the stochastic approximation to converge."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The paper develops an inversion-free natural gradient descent algorithm on Riemannian manifolds that maintains an online approximation of the inverse Fisher information matrix using transported score vectors and proves almost-sure convergence rates of O(log s / s^α) for α > 2/3."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An inversion-free natural gradient method on Riemannian manifolds updates an online approximation to the inverse Fisher information matrix using transported score vectors."}],"snapshot_sha256":"d4b295e07b49b8a1b6608a77f585bcfcd6f7a8a89f09a7b01db3342fe5b5a270"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"7342b468ece791d2a755eff736db42298a7fd9fcd13d418f11bb053598e438b9"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.02969/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The natural gradient method is a central tool for statistical optimisation, but its broader application is hindered by the assumption of a Euclidean parameter space, the repeated estimation of the Fisher information matrix (FIM), and the computational cost of its subsequent inversion. This paper proposes an intrinsic, inversion-free natural gradient method for statistical models whose parameters lie on general Riemannian manifolds. Formulating statistical optimisation in this non-Euclidean setting allows for the natural enforcement of parameter constraints, the elimination of non-identifiable ","authors_text":"Dario Draca, Minh-Ngoc Tran, Takuo Matsubara","cross_cats":["cs.LG","stat.CO","stat.ME"],"headline":"An inversion-free natural gradient method on Riemannian manifolds updates an online approximation to the inverse Fisher information matrix using transported score vectors.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-03T11:08:59Z","title":"Inversion-Free Natural Gradient Descent on Riemannian Manifolds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.02969","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T18:12:12.978807Z","id":"43a96799-bcb7-482e-ae79-79dbcf548465","model_set":{"reader":"grok-4.3"},"one_line_summary":"The paper develops an inversion-free natural gradient descent algorithm on Riemannian manifolds that maintains an online approximation of the inverse Fisher information matrix using transported score vectors and proves almost-sure convergence rates of O(log s / s^α) for α > 2/3.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An inversion-free natural gradient method on Riemannian manifolds updates an online approximation to the inverse Fisher information matrix using transported score vectors.","strongest_claim":"We prove almost-sure convergence rates of O(log s / s^α) for the squared distance to the minimizer when the step size exponent α > 2/3. We also establish almost-sure rates for the approximate FIM, which now accumulates transport-based errors.","weakest_assumption":"That transport operations between tangent spaces at successive iterates can be performed accurately enough that accumulated errors do not destroy the claimed convergence rates, and that the manifold admits sufficient regularity (e.g., geodesic convexity) for the stochastic approximation to converge."}},"verdict_id":"43a96799-bcb7-482e-ae79-79dbcf548465"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:78999df1e95e65131bf6f46b09e03eda1275373f154155f26fc8200f22ebf01a","target":"record","created_at":"2026-06-01T01:03:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"96f3126de07bde542cb95d5b1de3ce498f35c751e8b915aa02f0cf48a9909bc5","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-03T11:08:59Z","title_canon_sha256":"49eb9796127f9a6f7277855863c4d31edae4d022ad98776580ff632326be5704"},"schema_version":"1.0","source":{"id":"2604.02969","kind":"arxiv","version":2}},"canonical_sha256":"d5f234212d799293cd91528f49a8574137b11f31c6a4e51c89cf06fd85eb341d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5f234212d799293cd91528f49a8574137b11f31c6a4e51c89cf06fd85eb341d","first_computed_at":"2026-06-01T01:03:52.542611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:52.542611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q0/g9tg4X5KmL4rzG7OGmCGzS3WOmO4rItYaCToG5dh81hjQ99MYPVHwBHNq0Wr9PAsIzlaW/vloNiJLYw/rBg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:52.543724Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.02969","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78999df1e95e65131bf6f46b09e03eda1275373f154155f26fc8200f22ebf01a","sha256:740f50d2b51ef66f04b27cb523ab3a18e3a0599f03e2ed60bf6b4c369ff0eece"],"state_sha256":"f76d954eadbd133d9051a06c104ca85b8681c5d694454bfd1c1c8b0974afdffd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMh6z5OiJ6cuvLIQPProTbjxmUIYpd1wsN9Ab83L9lOn/l/A1G6b5RlwLQ7EbbQuk5E4OEVCMe7x057XOVBTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:23:10.318264Z","bundle_sha256":"0bd234a73b999561943bf079e9d9ce313e36c66f6177f06f4c038c687b55176a"}}