{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZXWEBKU4K27HNFI4ZDIAXBVU74","short_pith_number":"pith:ZXWEBKU4","schema_version":"1.0","canonical_sha256":"cdec40aa9c56be76951cc8d00b86b4ff31bdb3809eaf1ed8ffe9f2d5e5c698e3","source":{"kind":"arxiv","id":"1602.02616","version":2},"attestation_state":"computed","paper":{"title":"Guarantees in Wasserstein Distance for the Langevin Monte Carlo Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.CO","authors_text":"Thomas Bonis","submitted_at":"2016-02-08T15:49:07Z","abstract_excerpt":"We study the problem of sampling from a distribution $\\target$ using the Langevin Monte Carlo algorithm and provide rate of convergences for this algorithm in terms of Wasserstein distance of order $2$. Our result holds as long as the continuous diffusion process associated with the algorithm converges exponentially fast to the target distribution along with some technical assumptions. While such an exponential convergence holds for example in the log-concave measure case, it also holds for the more general case of asymptoticaly log-concave measures. Our results thus extends the known rates 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":"1602.02616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-02-08T15:49:07Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7c6dffbb53569013fee0d20d9f3e228710e518b6161c399983b18f3ed1484d4e","abstract_canon_sha256":"69ac60eb0650667d2da5691160868696b037da679333c3e884c8d8c5950d2c77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:38.489825Z","signature_b64":"chUDTbxwTq2peWlk6p0cp+kpjkeRAi23DfO48NAC5eCGEO7e3fb41rVj/iJEk2Ratj8tEhfnrHm865IvUYpLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdec40aa9c56be76951cc8d00b86b4ff31bdb3809eaf1ed8ffe9f2d5e5c698e3","last_reissued_at":"2026-05-18T01:11:38.489468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:38.489468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarantees in Wasserstein Distance for the Langevin Monte Carlo Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.CO","authors_text":"Thomas Bonis","submitted_at":"2016-02-08T15:49:07Z","abstract_excerpt":"We study the problem of sampling from a distribution $\\target$ using the Langevin Monte Carlo algorithm and provide rate of convergences for this algorithm in terms of Wasserstein distance of order $2$. Our result holds as long as the continuous diffusion process associated with the algorithm converges exponentially fast to the target distribution along with some technical assumptions. While such an exponential convergence holds for example in the log-concave measure case, it also holds for the more general case of asymptoticaly log-concave measures. Our results thus extends the known rates of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02616","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":"1602.02616","created_at":"2026-05-18T01:11:38.489529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02616v2","created_at":"2026-05-18T01:11:38.489529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02616","created_at":"2026-05-18T01:11:38.489529+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXWEBKU4K27H","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXWEBKU4K27HNFI4","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXWEBKU4","created_at":"2026-05-18T12:30:55.937587+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/ZXWEBKU4K27HNFI4ZDIAXBVU74","json":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74.json","graph_json":"https://pith.science/api/pith-number/ZXWEBKU4K27HNFI4ZDIAXBVU74/graph.json","events_json":"https://pith.science/api/pith-number/ZXWEBKU4K27HNFI4ZDIAXBVU74/events.json","paper":"https://pith.science/paper/ZXWEBKU4"},"agent_actions":{"view_html":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74","download_json":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74.json","view_paper":"https://pith.science/paper/ZXWEBKU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02616&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXWEBKU4K27HNFI4ZDIAXBVU74/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXWEBKU4K27HNFI4ZDIAXBVU74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74/action/storage_attestation","attest_author":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74/action/author_attestation","sign_citation":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74/action/citation_signature","submit_replication":"https://pith.science/pith/ZXWEBKU4K27HNFI4ZDIAXBVU74/action/replication_record"}},"created_at":"2026-05-18T01:11:38.489529+00:00","updated_at":"2026-05-18T01:11:38.489529+00:00"}