{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7K3655ZCDHXLZUFINVQWSRDZDI","short_pith_number":"pith:7K3655ZC","schema_version":"1.0","canonical_sha256":"fab7eef72219eebcd0a86d616944791a0bee3781aacba40338a46b4af851b52d","source":{"kind":"arxiv","id":"1310.7479","version":1},"attestation_state":"computed","paper":{"title":"Weak Convergence Rates of Population versus Single-Chain Stochastic Approximation MCMC Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Faming Liang, Mingqi Wu, Qifan Song","submitted_at":"2013-10-28T16:23:50Z","abstract_excerpt":"In this paper, we establish the theory of weak convergence (toward a normal distribution) for both single-chain and population stochastic approximation MCMC algorithms. Based on the theory, we give an explicit ratio of convergence rates for the population SAMCMC algorithm and the single-chain SAMCMC algorithm. Our results provide a theoretic guarantee that the population SAMCMC algorithms are asymptotically more efficient than the single-chain SAMCMC algorithms when the gain factor sequence decreases slower than O(1/t), where t indexes the number of iterations. This is of interest for practica"},"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":"1310.7479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.ST","submitted_at":"2013-10-28T16:23:50Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4a58142d560d9ec31cdf03a1204a3551d0ce140b007f83a1e66b6e5489d045b5","abstract_canon_sha256":"af60c9f32901c1d140e5b9b485d0b83f7a0f08f83a29549d251fa5e44e5f56f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:39.010359Z","signature_b64":"WeuJNRoYNyj2Wl3pZJKvgvpO1Vy6ajUOeQyK9SDexok90CpuYgXJXgnSgc/XC84SCrl1SG6vbgouAadK+ncZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab7eef72219eebcd0a86d616944791a0bee3781aacba40338a46b4af851b52d","last_reissued_at":"2026-05-18T03:08:39.009924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:39.009924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak Convergence Rates of Population versus Single-Chain Stochastic Approximation MCMC Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Faming Liang, Mingqi Wu, Qifan Song","submitted_at":"2013-10-28T16:23:50Z","abstract_excerpt":"In this paper, we establish the theory of weak convergence (toward a normal distribution) for both single-chain and population stochastic approximation MCMC algorithms. Based on the theory, we give an explicit ratio of convergence rates for the population SAMCMC algorithm and the single-chain SAMCMC algorithm. Our results provide a theoretic guarantee that the population SAMCMC algorithms are asymptotically more efficient than the single-chain SAMCMC algorithms when the gain factor sequence decreases slower than O(1/t), where t indexes the number of iterations. This is of interest for practica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7479","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":""},"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":"1310.7479","created_at":"2026-05-18T03:08:39.009981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7479v1","created_at":"2026-05-18T03:08:39.009981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7479","created_at":"2026-05-18T03:08:39.009981+00:00"},{"alias_kind":"pith_short_12","alias_value":"7K3655ZCDHXL","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7K3655ZCDHXLZUFI","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7K3655ZC","created_at":"2026-05-18T12:27:36.564083+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/7K3655ZCDHXLZUFINVQWSRDZDI","json":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI.json","graph_json":"https://pith.science/api/pith-number/7K3655ZCDHXLZUFINVQWSRDZDI/graph.json","events_json":"https://pith.science/api/pith-number/7K3655ZCDHXLZUFINVQWSRDZDI/events.json","paper":"https://pith.science/paper/7K3655ZC"},"agent_actions":{"view_html":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI","download_json":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI.json","view_paper":"https://pith.science/paper/7K3655ZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7479&json=true","fetch_graph":"https://pith.science/api/pith-number/7K3655ZCDHXLZUFINVQWSRDZDI/graph.json","fetch_events":"https://pith.science/api/pith-number/7K3655ZCDHXLZUFINVQWSRDZDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI/action/storage_attestation","attest_author":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI/action/author_attestation","sign_citation":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI/action/citation_signature","submit_replication":"https://pith.science/pith/7K3655ZCDHXLZUFINVQWSRDZDI/action/replication_record"}},"created_at":"2026-05-18T03:08:39.009981+00:00","updated_at":"2026-05-18T03:08:39.009981+00:00"}