{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BFOCP2JRORW62FYYDGFDKD2EZM","short_pith_number":"pith:BFOCP2JR","schema_version":"1.0","canonical_sha256":"095c27e931746ded1718198a350f44cb022182e4f9e4707e48c7597583093a18","source":{"kind":"arxiv","id":"2203.05717","version":2},"attestation_state":"computed","paper":{"title":"Single Loop Gaussian Homotopy Method for Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Hidenori Iwakiri, Shinji Ito, Yuhang Wang","submitted_at":"2022-03-11T02:05:27Z","abstract_excerpt":"The Gaussian homotopy (GH) method is a popular approach to finding better stationary points for non-convex optimization problems by gradually reducing a parameter value $t$, which changes the problem to be solved from an almost convex one to the original target one. Existing GH-based methods repeatedly call an iterative optimization solver to find a stationary point every time $t$ is updated, which incurs high computational costs. We propose a novel single loop framework for GH methods (SLGH) that updates the parameter $t$ and the optimization decision variables at the same. Computational comp"},"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":"2203.05717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-11T02:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"861dd24875ddcd2919ad233dac483ede04c97a09ca8fb311d506e8cfeb873a43","abstract_canon_sha256":"0a72760b64331765620e73a8bc5af715641e908574335b52727a747610f8e918"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:32.776617Z","signature_b64":"J9S0gURjUfeX2PM6bjVvtlTsSThxCfUtoC3Ba9XIw8XkEBE/x4HChr8Ou7cqiBruZamyuLxKwos9/Frc9IdCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"095c27e931746ded1718198a350f44cb022182e4f9e4707e48c7597583093a18","last_reissued_at":"2026-07-05T05:16:32.776155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:32.776155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single Loop Gaussian Homotopy Method for Non-convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiko Takeda, Hidenori Iwakiri, Shinji Ito, Yuhang Wang","submitted_at":"2022-03-11T02:05:27Z","abstract_excerpt":"The Gaussian homotopy (GH) method is a popular approach to finding better stationary points for non-convex optimization problems by gradually reducing a parameter value $t$, which changes the problem to be solved from an almost convex one to the original target one. Existing GH-based methods repeatedly call an iterative optimization solver to find a stationary point every time $t$ is updated, which incurs high computational costs. We propose a novel single loop framework for GH methods (SLGH) that updates the parameter $t$ and the optimization decision variables at the same. Computational comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05717","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/2203.05717/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":"2203.05717","created_at":"2026-07-05T05:16:32.776211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.05717v2","created_at":"2026-07-05T05:16:32.776211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05717","created_at":"2026-07-05T05:16:32.776211+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFOCP2JRORW6","created_at":"2026-07-05T05:16:32.776211+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFOCP2JRORW62FYY","created_at":"2026-07-05T05:16:32.776211+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFOCP2JR","created_at":"2026-07-05T05:16:32.776211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":109,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM","json":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM.json","graph_json":"https://pith.science/api/pith-number/BFOCP2JRORW62FYYDGFDKD2EZM/graph.json","events_json":"https://pith.science/api/pith-number/BFOCP2JRORW62FYYDGFDKD2EZM/events.json","paper":"https://pith.science/paper/BFOCP2JR"},"agent_actions":{"view_html":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM","download_json":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM.json","view_paper":"https://pith.science/paper/BFOCP2JR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.05717&json=true","fetch_graph":"https://pith.science/api/pith-number/BFOCP2JRORW62FYYDGFDKD2EZM/graph.json","fetch_events":"https://pith.science/api/pith-number/BFOCP2JRORW62FYYDGFDKD2EZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/action/storage_attestation","attest_author":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/action/author_attestation","sign_citation":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/action/citation_signature","submit_replication":"https://pith.science/pith/BFOCP2JRORW62FYYDGFDKD2EZM/action/replication_record"}},"created_at":"2026-07-05T05:16:32.776211+00:00","updated_at":"2026-07-05T05:16:32.776211+00:00"}