{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HPDKUBUDRB2BTZNE7HZIXN3ZWV","short_pith_number":"pith:HPDKUBUD","schema_version":"1.0","canonical_sha256":"3bc6aa0683887419e5a4f9f28bb779b5504067c3ae73ea90a08589437e4034a6","source":{"kind":"arxiv","id":"1802.09188","version":2},"attestation_state":"computed","paper":{"title":"Analysis of Langevin Monte Carlo via convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Alain Durmus, B{\\l}a\\.zej Miasojedow, Szymon Majewski","submitted_at":"2018-02-26T07:50:57Z","abstract_excerpt":"In this paper, we provide new insights on the Unadjusted Langevin Algorithm. We show that this method can be formulated as a first order optimization algorithm of an objective functional defined on the Wasserstein space of order $2$. Using this interpretation and techniques borrowed from convex optimization, we give a non-asymptotic analysis of this method to sample from logconcave smooth target distribution on $\\mathbb{R}^d$. Based on this interpretation, we propose two new methods for sampling from a non-smooth target distribution, which we analyze as well. Besides, these new algorithms are "},"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":"1802.09188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-26T07:50:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"aedbc62cbf0a49f3a1df6a4fb4d71e13b041f01cd2e37ed34e9c0dde33cf8b10","abstract_canon_sha256":"4446b23e05b0bd5283c80187c4c81cb13a0a2ab8085ce75b9320d40c78bbf0ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:50.715645Z","signature_b64":"dLPQ84BRavvRFhS544+zrALq4YJw4w+p0C6L0aor4wEvCUlVpstiJ8Kjbkm7iVFyKewDXXoSLR557rZHn+0aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bc6aa0683887419e5a4f9f28bb779b5504067c3ae73ea90a08589437e4034a6","last_reissued_at":"2026-05-18T00:19:50.714709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:50.714709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Langevin Monte Carlo via convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Alain Durmus, B{\\l}a\\.zej Miasojedow, Szymon Majewski","submitted_at":"2018-02-26T07:50:57Z","abstract_excerpt":"In this paper, we provide new insights on the Unadjusted Langevin Algorithm. We show that this method can be formulated as a first order optimization algorithm of an objective functional defined on the Wasserstein space of order $2$. Using this interpretation and techniques borrowed from convex optimization, we give a non-asymptotic analysis of this method to sample from logconcave smooth target distribution on $\\mathbb{R}^d$. Based on this interpretation, we propose two new methods for sampling from a non-smooth target distribution, which we analyze as well. Besides, these new algorithms are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09188","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":""},"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":"1802.09188","created_at":"2026-05-18T00:19:50.714873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09188v2","created_at":"2026-05-18T00:19:50.714873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09188","created_at":"2026-05-18T00:19:50.714873+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPDKUBUDRB2B","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPDKUBUDRB2BTZNE","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPDKUBUD","created_at":"2026-05-18T12:32:28.185984+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/HPDKUBUDRB2BTZNE7HZIXN3ZWV","json":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV.json","graph_json":"https://pith.science/api/pith-number/HPDKUBUDRB2BTZNE7HZIXN3ZWV/graph.json","events_json":"https://pith.science/api/pith-number/HPDKUBUDRB2BTZNE7HZIXN3ZWV/events.json","paper":"https://pith.science/paper/HPDKUBUD"},"agent_actions":{"view_html":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV","download_json":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV.json","view_paper":"https://pith.science/paper/HPDKUBUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09188&json=true","fetch_graph":"https://pith.science/api/pith-number/HPDKUBUDRB2BTZNE7HZIXN3ZWV/graph.json","fetch_events":"https://pith.science/api/pith-number/HPDKUBUDRB2BTZNE7HZIXN3ZWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/action/storage_attestation","attest_author":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/action/author_attestation","sign_citation":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/action/citation_signature","submit_replication":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/action/replication_record"}},"created_at":"2026-05-18T00:19:50.714873+00:00","updated_at":"2026-05-18T00:19:50.714873+00:00"}