{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FIZF6W53W4Q4CWDPWGQ6RKJUGP","short_pith_number":"pith:FIZF6W53","schema_version":"1.0","canonical_sha256":"2a325f5bbbb721c1586fb1a1e8a93433c24f8797b3a1014733925facb33f02c1","source":{"kind":"arxiv","id":"1703.04890","version":3},"attestation_state":"computed","paper":{"title":"Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bamdev Mishra, Hiroyuki Kasai, Hiroyuki Sato","submitted_at":"2017-03-15T02:34:39Z","abstract_excerpt":"Stochastic variance reduction algorithms have recently become popular for minimizing the average of a large, but finite number of loss functions. The present paper proposes a Riemannian stochastic quasi-Newton algorithm with variance reduction (R-SQN-VR). The key challenges of averaging, adding, and subtracting multiple gradients are addressed with notions of retraction and vector transport. We present convergence analyses of R-SQN-VR on both non-convex and retraction-convex functions under retraction and vector transport operators. The proposed algorithm is evaluated on the Karcher mean compu"},"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":"1703.04890","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-15T02:34:39Z","cross_cats_sorted":["cs.NA","math.NA","math.OC","stat.ML"],"title_canon_sha256":"2ae9f9be8f1646a0294be19fcd08cf39088104435616e7e8947774d14848af23","abstract_canon_sha256":"d882b700d7103f2abc0a9cf7b55aadd2e42efd98643922997e0882689cca1caa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:04.601001Z","signature_b64":"K6+nqXv3WbC3aaF1uKuCnTnszZZ/wR+F4jjXxml/2oEPVLGd7H+HzNbRhQ744x/PU0mqiTPuV5UF+F8NZqZQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a325f5bbbb721c1586fb1a1e8a93433c24f8797b3a1014733925facb33f02c1","last_reissued_at":"2026-05-18T00:35:04.600235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:04.600235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bamdev Mishra, Hiroyuki Kasai, Hiroyuki Sato","submitted_at":"2017-03-15T02:34:39Z","abstract_excerpt":"Stochastic variance reduction algorithms have recently become popular for minimizing the average of a large, but finite number of loss functions. The present paper proposes a Riemannian stochastic quasi-Newton algorithm with variance reduction (R-SQN-VR). The key challenges of averaging, adding, and subtracting multiple gradients are addressed with notions of retraction and vector transport. We present convergence analyses of R-SQN-VR on both non-convex and retraction-convex functions under retraction and vector transport operators. The proposed algorithm is evaluated on the Karcher mean compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04890","kind":"arxiv","version":3},"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":"1703.04890","created_at":"2026-05-18T00:35:04.600384+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04890v3","created_at":"2026-05-18T00:35:04.600384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04890","created_at":"2026-05-18T00:35:04.600384+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIZF6W53W4Q4","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIZF6W53W4Q4CWDP","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIZF6W53","created_at":"2026-05-18T12:31:15.632608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP","json":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP.json","graph_json":"https://pith.science/api/pith-number/FIZF6W53W4Q4CWDPWGQ6RKJUGP/graph.json","events_json":"https://pith.science/api/pith-number/FIZF6W53W4Q4CWDPWGQ6RKJUGP/events.json","paper":"https://pith.science/paper/FIZF6W53"},"agent_actions":{"view_html":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP","download_json":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP.json","view_paper":"https://pith.science/paper/FIZF6W53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04890&json=true","fetch_graph":"https://pith.science/api/pith-number/FIZF6W53W4Q4CWDPWGQ6RKJUGP/graph.json","fetch_events":"https://pith.science/api/pith-number/FIZF6W53W4Q4CWDPWGQ6RKJUGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP/action/storage_attestation","attest_author":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP/action/author_attestation","sign_citation":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP/action/citation_signature","submit_replication":"https://pith.science/pith/FIZF6W53W4Q4CWDPWGQ6RKJUGP/action/replication_record"}},"created_at":"2026-05-18T00:35:04.600384+00:00","updated_at":"2026-05-18T00:35:04.600384+00:00"}