{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OWRHUK7RL2AKVDOHCTGOGNO2ZY","short_pith_number":"pith:OWRHUK7R","schema_version":"1.0","canonical_sha256":"75a27a2bf15e80aa8dc714cce335dace391cc19171822debf6d01c2e914767cd","source":{"kind":"arxiv","id":"2010.08908","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Algorithms for Convex and Non-Convex Optimization on Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.CO","authors_text":"Bayan Saparbayeva, David B. Dunson, Lizhen Lin, Michael Minyi Zhang","submitted_at":"2020-10-18T02:48:22Z","abstract_excerpt":"We propose a general scheme for solving convex and non-convex optimization problems on manifolds. The central idea is that, by adding a multiple of the squared retraction distance to the objective function in question, we \"convexify\" the objective function and solve a series of convex sub-problems in the optimization procedure. One of the key challenges for optimization on manifolds is the difficulty of verifying the complexity of the objective function, e.g., whether the objective function is convex or non-convex, and the degree of non-convexity. Our proposed algorithm adapts to the level of "},"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":"2010.08908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2020-10-18T02:48:22Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"729fe9413a0a05f73df05ef83de7ba0b45d575a3c1435f99d28baf0ffdfd72c0","abstract_canon_sha256":"ed915c678aa09ffa861d3867807dd3c24cfe5fb2850fbac2f7c863602bd4fb5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:46.532435Z","signature_b64":"2dHQWO7m79IsfcQhxm+HuDZzf7aWfMNSf/fmOJUvggHSGR95WjzlHzL+C76k/zghFSe9qjVYZ4YZSNIEXnDeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75a27a2bf15e80aa8dc714cce335dace391cc19171822debf6d01c2e914767cd","last_reissued_at":"2026-07-05T01:43:46.532028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:46.532028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Algorithms for Convex and Non-Convex Optimization on Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.CO","authors_text":"Bayan Saparbayeva, David B. Dunson, Lizhen Lin, Michael Minyi Zhang","submitted_at":"2020-10-18T02:48:22Z","abstract_excerpt":"We propose a general scheme for solving convex and non-convex optimization problems on manifolds. The central idea is that, by adding a multiple of the squared retraction distance to the objective function in question, we \"convexify\" the objective function and solve a series of convex sub-problems in the optimization procedure. One of the key challenges for optimization on manifolds is the difficulty of verifying the complexity of the objective function, e.g., whether the objective function is convex or non-convex, and the degree of non-convexity. Our proposed algorithm adapts to the level of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.08908","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.08908/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":"2010.08908","created_at":"2026-07-05T01:43:46.532091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.08908v1","created_at":"2026-07-05T01:43:46.532091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.08908","created_at":"2026-07-05T01:43:46.532091+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWRHUK7RL2AK","created_at":"2026-07-05T01:43:46.532091+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWRHUK7RL2AKVDOH","created_at":"2026-07-05T01:43:46.532091+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWRHUK7R","created_at":"2026-07-05T01:43:46.532091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16970","citing_title":"Horospherically Convex Optimization on Hadamard Manifolds Part I: Analysis and Algorithms","ref_index":75,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY","json":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY.json","graph_json":"https://pith.science/api/pith-number/OWRHUK7RL2AKVDOHCTGOGNO2ZY/graph.json","events_json":"https://pith.science/api/pith-number/OWRHUK7RL2AKVDOHCTGOGNO2ZY/events.json","paper":"https://pith.science/paper/OWRHUK7R"},"agent_actions":{"view_html":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY","download_json":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY.json","view_paper":"https://pith.science/paper/OWRHUK7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.08908&json=true","fetch_graph":"https://pith.science/api/pith-number/OWRHUK7RL2AKVDOHCTGOGNO2ZY/graph.json","fetch_events":"https://pith.science/api/pith-number/OWRHUK7RL2AKVDOHCTGOGNO2ZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY/action/storage_attestation","attest_author":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY/action/author_attestation","sign_citation":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY/action/citation_signature","submit_replication":"https://pith.science/pith/OWRHUK7RL2AKVDOHCTGOGNO2ZY/action/replication_record"}},"created_at":"2026-07-05T01:43:46.532091+00:00","updated_at":"2026-07-05T01:43:46.532091+00:00"}