{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K6B2L7EU6FOGGHZKDG6BUWNORW","short_pith_number":"pith:K6B2L7EU","schema_version":"1.0","canonical_sha256":"5783a5fc94f15c631f2a19bc1a59ae8daa5ce568f24f945746430e86718cdefa","source":{"kind":"arxiv","id":"1901.07487","version":1},"attestation_state":"computed","paper":{"title":"Non-Asymptotic Analysis of Fractional Langevin Monte Carlo for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ga\\\"el Richard, Thanh Huy Nguyen, Umut \\c{S}im\\c{s}ekli","submitted_at":"2019-01-22T17:53:01Z","abstract_excerpt":"Recent studies on diffusion-based sampling methods have shown that Langevin Monte Carlo (LMC) algorithms can be beneficial for non-convex optimization, and rigorous theoretical guarantees have been proven for both asymptotic and finite-time regimes. Algorithmically, LMC-based algorithms resemble the well-known gradient descent (GD) algorithm, where the GD recursion is perturbed by an additive Gaussian noise whose variance has a particular form. Fractional Langevin Monte Carlo (FLMC) is a recently proposed extension of LMC, where the Gaussian noise is replaced by a heavy-tailed {\\alpha}-stable "},"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":"1901.07487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-22T17:53:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d173199e305aa9bac81ebd064c4f2da6626e1b78314d3ddd94792cb596ed0e1e","abstract_canon_sha256":"12bc9b8c317d78724df510055fbd5019672bc8c779bbd3d0ea5e930fa91e9508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:44.650454Z","signature_b64":"WPLmMxF59qHByQsm2tWXHGEqhKGaxyVX9la2uk+Dh1R+Tt16Leor2Mw3kpeYuvrZ6+KEDlQWFNpff5Kh6+T0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5783a5fc94f15c631f2a19bc1a59ae8daa5ce568f24f945746430e86718cdefa","last_reissued_at":"2026-05-17T23:55:44.649696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:44.649696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Asymptotic Analysis of Fractional Langevin Monte Carlo for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ga\\\"el Richard, Thanh Huy Nguyen, Umut \\c{S}im\\c{s}ekli","submitted_at":"2019-01-22T17:53:01Z","abstract_excerpt":"Recent studies on diffusion-based sampling methods have shown that Langevin Monte Carlo (LMC) algorithms can be beneficial for non-convex optimization, and rigorous theoretical guarantees have been proven for both asymptotic and finite-time regimes. Algorithmically, LMC-based algorithms resemble the well-known gradient descent (GD) algorithm, where the GD recursion is perturbed by an additive Gaussian noise whose variance has a particular form. Fractional Langevin Monte Carlo (FLMC) is a recently proposed extension of LMC, where the Gaussian noise is replaced by a heavy-tailed {\\alpha}-stable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07487","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":""},"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":"1901.07487","created_at":"2026-05-17T23:55:44.649828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07487v1","created_at":"2026-05-17T23:55:44.649828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07487","created_at":"2026-05-17T23:55:44.649828+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6B2L7EU6FOG","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6B2L7EU6FOGGHZK","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6B2L7EU","created_at":"2026-05-18T12:33:21.387695+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/K6B2L7EU6FOGGHZKDG6BUWNORW","json":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW.json","graph_json":"https://pith.science/api/pith-number/K6B2L7EU6FOGGHZKDG6BUWNORW/graph.json","events_json":"https://pith.science/api/pith-number/K6B2L7EU6FOGGHZKDG6BUWNORW/events.json","paper":"https://pith.science/paper/K6B2L7EU"},"agent_actions":{"view_html":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW","download_json":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW.json","view_paper":"https://pith.science/paper/K6B2L7EU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07487&json=true","fetch_graph":"https://pith.science/api/pith-number/K6B2L7EU6FOGGHZKDG6BUWNORW/graph.json","fetch_events":"https://pith.science/api/pith-number/K6B2L7EU6FOGGHZKDG6BUWNORW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/action/storage_attestation","attest_author":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/action/author_attestation","sign_citation":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/action/citation_signature","submit_replication":"https://pith.science/pith/K6B2L7EU6FOGGHZKDG6BUWNORW/action/replication_record"}},"created_at":"2026-05-17T23:55:44.649828+00:00","updated_at":"2026-05-17T23:55:44.649828+00:00"}