{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HPDKUBUDRB2BTZNE7HZIXN3ZWV","short_pith_number":"pith:HPDKUBUD","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"},"canonical_sha256":"3bc6aa0683887419e5a4f9f28bb779b5504067c3ae73ea90a08589437e4034a6","source":{"kind":"arxiv","id":"1802.09188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09188","created_at":"2026-05-18T00:19:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09188v2","created_at":"2026-05-18T00:19:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09188","created_at":"2026-05-18T00:19:50Z"},{"alias_kind":"pith_short_12","alias_value":"HPDKUBUDRB2B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HPDKUBUDRB2BTZNE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HPDKUBUD","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HPDKUBUDRB2BTZNE7HZIXN3ZWV","target":"record","payload":{"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"},"canonical_sha256":"3bc6aa0683887419e5a4f9f28bb779b5504067c3ae73ea90a08589437e4034a6","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"},"source_kind":"arxiv","source_id":"1802.09188","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdEAc1bvlyEnp3Te+qyqgkIknBdRcHMYMW8XN18tNoOaulsuZ71BcLz3h9KhRX+4dmk0LfV2WCwMujHXapHUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:47:27.875684Z"},"content_sha256":"b1d612bf271a97c423453f7cb270efcadc52fc98f6834060dad8866c37273175","schema_version":"1.0","event_id":"sha256:b1d612bf271a97c423453f7cb270efcadc52fc98f6834060dad8866c37273175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HPDKUBUDRB2BTZNE7HZIXN3ZWV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Xg9mCg3CuBByWLw9rhvfehOnavnx+DQ/B2wlAkDvxTX0MmuObbAs40/YyprSC0laYUauCRFYgMUpFuEA9HfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:47:27.876150Z"},"content_sha256":"86279f4921db76297d171c511f9120368f7dcc7e891d79f8986296c04c403d73","schema_version":"1.0","event_id":"sha256:86279f4921db76297d171c511f9120368f7dcc7e891d79f8986296c04c403d73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/bundle.json","state_url":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T20:47:27Z","links":{"resolver":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV","bundle":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/bundle.json","state":"https://pith.science/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPDKUBUDRB2BTZNE7HZIXN3ZWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HPDKUBUDRB2BTZNE7HZIXN3ZWV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4446b23e05b0bd5283c80187c4c81cb13a0a2ab8085ce75b9320d40c78bbf0ab","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-26T07:50:57Z","title_canon_sha256":"aedbc62cbf0a49f3a1df6a4fb4d71e13b041f01cd2e37ed34e9c0dde33cf8b10"},"schema_version":"1.0","source":{"id":"1802.09188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09188","created_at":"2026-05-18T00:19:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09188v2","created_at":"2026-05-18T00:19:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09188","created_at":"2026-05-18T00:19:50Z"},{"alias_kind":"pith_short_12","alias_value":"HPDKUBUDRB2B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HPDKUBUDRB2BTZNE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HPDKUBUD","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:86279f4921db76297d171c511f9120368f7dcc7e891d79f8986296c04c403d73","target":"graph","created_at":"2026-05-18T00:19:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alain Durmus, B{\\l}a\\.zej Miasojedow, Szymon Majewski","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-26T07:50:57Z","title":"Analysis of Langevin Monte Carlo via convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09188","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b1d612bf271a97c423453f7cb270efcadc52fc98f6834060dad8866c37273175","target":"record","created_at":"2026-05-18T00:19:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4446b23e05b0bd5283c80187c4c81cb13a0a2ab8085ce75b9320d40c78bbf0ab","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-02-26T07:50:57Z","title_canon_sha256":"aedbc62cbf0a49f3a1df6a4fb4d71e13b041f01cd2e37ed34e9c0dde33cf8b10"},"schema_version":"1.0","source":{"id":"1802.09188","kind":"arxiv","version":2}},"canonical_sha256":"3bc6aa0683887419e5a4f9f28bb779b5504067c3ae73ea90a08589437e4034a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bc6aa0683887419e5a4f9f28bb779b5504067c3ae73ea90a08589437e4034a6","first_computed_at":"2026-05-18T00:19:50.714709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:50.714709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dLPQ84BRavvRFhS544+zrALq4YJw4w+p0C6L0aor4wEvCUlVpstiJ8Kjbkm7iVFyKewDXXoSLR557rZHn+0aAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:50.715645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1d612bf271a97c423453f7cb270efcadc52fc98f6834060dad8866c37273175","sha256:86279f4921db76297d171c511f9120368f7dcc7e891d79f8986296c04c403d73"],"state_sha256":"b14457ababeeee5b2e30fb993f511bdc1d0755b8eb04d247be4d19506e3adc3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Dc8ga5N0WS5OJtlzmoCS4T2XPHbF/FT8XPBpdcWU/gyY3/gKX+LvRUFkQgr1hnbbFDIrmXkMFJe+Ihbi/1qBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:47:27.879878Z","bundle_sha256":"4839e6d84064382c82466284df73b7ba17f2cdb835e241904fa85871884b6c04"}}