{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YDZCDGD4FO2WSM3EV367TZSZ5U","short_pith_number":"pith:YDZCDGD4","schema_version":"1.0","canonical_sha256":"c0f221987c2bb5693364aefdf9e659ed0925ee3c99ad2c3c01c47447c6e327a8","source":{"kind":"arxiv","id":"2405.16734","version":1},"attestation_state":"computed","paper":{"title":"Faster Sampling via Stochastic Gradient Proximal Sampler","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Difan Zou, HanZe Dong, Tong Zhang, Xunpeng Huang, Yi-An Ma","submitted_at":"2024-05-27T00:53:18Z","abstract_excerpt":"Stochastic gradients have been widely integrated into Langevin-based methods to improve their scalability and efficiency in solving large-scale sampling problems. However, the proximal sampler, which exhibits much faster convergence than Langevin-based algorithms in the deterministic setting Lee et al. (2021), has yet to be explored in its stochastic variants. In this paper, we study the Stochastic Proximal Samplers (SPS) for sampling from non-log-concave distributions. We first establish a general framework for implementing stochastic proximal samplers and establish the convergence theory acc"},"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":"2405.16734","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-05-27T00:53:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4765246353fcf5bb6742d1f6a30ba02e8452d44e62e11331dd16f723e52f7303","abstract_canon_sha256":"7758e3fa13fd51184cb027ca68545266b9a83209244355729f62fb529c15df40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:34.621091Z","signature_b64":"rQIt6BN1vtXN6VDGjImyYXedWaOyDDQ37AD1qpN7xv1umCjZpilIkA34BIFQ9uOIIZD83PMYjJ+Kum7xIQ0PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0f221987c2bb5693364aefdf9e659ed0925ee3c99ad2c3c01c47447c6e327a8","last_reissued_at":"2026-07-05T08:23:34.620616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:34.620616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Sampling via Stochastic Gradient Proximal Sampler","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Difan Zou, HanZe Dong, Tong Zhang, Xunpeng Huang, Yi-An Ma","submitted_at":"2024-05-27T00:53:18Z","abstract_excerpt":"Stochastic gradients have been widely integrated into Langevin-based methods to improve their scalability and efficiency in solving large-scale sampling problems. However, the proximal sampler, which exhibits much faster convergence than Langevin-based algorithms in the deterministic setting Lee et al. (2021), has yet to be explored in its stochastic variants. In this paper, we study the Stochastic Proximal Samplers (SPS) for sampling from non-log-concave distributions. We first establish a general framework for implementing stochastic proximal samplers and establish the convergence theory acc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16734","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.16734/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":"2405.16734","created_at":"2026-07-05T08:23:34.620675+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16734v1","created_at":"2026-07-05T08:23:34.620675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16734","created_at":"2026-07-05T08:23:34.620675+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDZCDGD4FO2W","created_at":"2026-07-05T08:23:34.620675+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDZCDGD4FO2WSM3E","created_at":"2026-07-05T08:23:34.620675+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDZCDGD4","created_at":"2026-07-05T08:23:34.620675+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17667","citing_title":"Rapid Bayesian Computation and Estimation for Neural Networks via Log-Concave Coupling","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U","json":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U.json","graph_json":"https://pith.science/api/pith-number/YDZCDGD4FO2WSM3EV367TZSZ5U/graph.json","events_json":"https://pith.science/api/pith-number/YDZCDGD4FO2WSM3EV367TZSZ5U/events.json","paper":"https://pith.science/paper/YDZCDGD4"},"agent_actions":{"view_html":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U","download_json":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U.json","view_paper":"https://pith.science/paper/YDZCDGD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16734&json=true","fetch_graph":"https://pith.science/api/pith-number/YDZCDGD4FO2WSM3EV367TZSZ5U/graph.json","fetch_events":"https://pith.science/api/pith-number/YDZCDGD4FO2WSM3EV367TZSZ5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U/action/storage_attestation","attest_author":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U/action/author_attestation","sign_citation":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U/action/citation_signature","submit_replication":"https://pith.science/pith/YDZCDGD4FO2WSM3EV367TZSZ5U/action/replication_record"}},"created_at":"2026-07-05T08:23:34.620675+00:00","updated_at":"2026-07-05T08:23:34.620675+00:00"}