{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DAQL2HS74CUS26M2YIP64IDN5F","short_pith_number":"pith:DAQL2HS7","schema_version":"1.0","canonical_sha256":"1820bd1e5fe0a92d799ac21fee206de9516b7950101b1c27147b5cdfe06b8e75","source":{"kind":"arxiv","id":"2106.03076","version":2},"attestation_state":"computed","paper":{"title":"A Convergence Theory for SVGD in the Population Limit under Talagrand's Inequality T1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Adil Salim, Lukang Sun, Peter Richt\\'arik","submitted_at":"2021-06-06T09:51:32Z","abstract_excerpt":"Stein Variational Gradient Descent (SVGD) is an algorithm for sampling from a target density which is known up to a multiplicative constant. Although SVGD is a popular algorithm in practice, its theoretical study is limited to a few recent works. We study the convergence of SVGD in the population limit, (i.e., with an infinite number of particles) to sample from a non-logconcave target distribution satisfying Talagrand's inequality T1. We first establish the convergence of the algorithm. Then, we establish a dimension-dependent complexity bound in terms of the Kernelized Stein Discrepancy (KSD"},"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":"2106.03076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-06T09:51:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c3b7001ddc30bce0f2fbb85506f10bbba1650481fe8dac5eaccbc40e3ad72301","abstract_canon_sha256":"0ccbc1f47783aaf201c204a312c5c21d8713550c0b6b4d92d533220d28864af1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:25.893725Z","signature_b64":"PgcS2jzzon9KGa2DAE3j2klZvDAUt1yIr48ShgF0iSjx7/bwkrPnZSIfwXRvc06/9M7F25gwEx/K5YeYekw8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1820bd1e5fe0a92d799ac21fee206de9516b7950101b1c27147b5cdfe06b8e75","last_reissued_at":"2026-07-05T04:32:25.893262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:25.893262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convergence Theory for SVGD in the Population Limit under Talagrand's Inequality T1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Adil Salim, Lukang Sun, Peter Richt\\'arik","submitted_at":"2021-06-06T09:51:32Z","abstract_excerpt":"Stein Variational Gradient Descent (SVGD) is an algorithm for sampling from a target density which is known up to a multiplicative constant. Although SVGD is a popular algorithm in practice, its theoretical study is limited to a few recent works. We study the convergence of SVGD in the population limit, (i.e., with an infinite number of particles) to sample from a non-logconcave target distribution satisfying Talagrand's inequality T1. We first establish the convergence of the algorithm. Then, we establish a dimension-dependent complexity bound in terms of the Kernelized Stein Discrepancy (KSD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.03076","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.03076/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":"2106.03076","created_at":"2026-07-05T04:32:25.893321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.03076v2","created_at":"2026-07-05T04:32:25.893321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.03076","created_at":"2026-07-05T04:32:25.893321+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAQL2HS74CUS","created_at":"2026-07-05T04:32:25.893321+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAQL2HS74CUS26M2","created_at":"2026-07-05T04:32:25.893321+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAQL2HS7","created_at":"2026-07-05T04:32:25.893321+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/DAQL2HS74CUS26M2YIP64IDN5F","json":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F.json","graph_json":"https://pith.science/api/pith-number/DAQL2HS74CUS26M2YIP64IDN5F/graph.json","events_json":"https://pith.science/api/pith-number/DAQL2HS74CUS26M2YIP64IDN5F/events.json","paper":"https://pith.science/paper/DAQL2HS7"},"agent_actions":{"view_html":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F","download_json":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F.json","view_paper":"https://pith.science/paper/DAQL2HS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.03076&json=true","fetch_graph":"https://pith.science/api/pith-number/DAQL2HS74CUS26M2YIP64IDN5F/graph.json","fetch_events":"https://pith.science/api/pith-number/DAQL2HS74CUS26M2YIP64IDN5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F/action/storage_attestation","attest_author":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F/action/author_attestation","sign_citation":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F/action/citation_signature","submit_replication":"https://pith.science/pith/DAQL2HS74CUS26M2YIP64IDN5F/action/replication_record"}},"created_at":"2026-07-05T04:32:25.893321+00:00","updated_at":"2026-07-05T04:32:25.893321+00:00"}