{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2MDCGK6QMCEJ3IWK77XFIH3JCM","short_pith_number":"pith:2MDCGK6Q","schema_version":"1.0","canonical_sha256":"d306232bd060889da2caffee541f69133ccceda7d31fed13e60efbc6d967d12a","source":{"kind":"arxiv","id":"1511.01437","version":3},"attestation_state":"computed","paper":{"title":"The sample size required in importance sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.ST","physics.data-an","stat.TH"],"primary_cat":"math.PR","authors_text":"Persi Diaconis, Sourav Chatterjee","submitted_at":"2015-11-04T19:06:25Z","abstract_excerpt":"The goal of importance sampling is to estimate the expected value of a given function with respect to a probability measure $\\nu$ using a random sample of size $n$ drawn from a different probability measure $\\mu$. If the two measures $\\mu$ and $\\nu$ are nearly singular with respect to each other, which is often the case in practice, the sample size required for accurate estimation is large. In this article it is shown that in a fairly general setting, a sample of size approximately $\\exp(D(\\nu||\\mu))$ is necessary and sufficient for accurate estimation by importance sampling, where $D(\\nu||\\mu"},"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":"1511.01437","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-11-04T19:06:25Z","cross_cats_sorted":["math.NA","math.ST","physics.data-an","stat.TH"],"title_canon_sha256":"49f1f6b5cc2abd7525ca4c743e1a17ddfe9d17c5107ad2d558f22b272d3e9a5e","abstract_canon_sha256":"6664cffdab9ef6aca9b21fea21d46f9c5e441f9fbbca2c658a0456897a4e9be1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:58.573190Z","signature_b64":"3X5fzdN9NhKtxaNU2JiWq3yCKEO4O6H0AwA3l95iSup6vBXTV5c1+iwEEX4zuSaMFMqXLba4pvuzZFiBXul2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d306232bd060889da2caffee541f69133ccceda7d31fed13e60efbc6d967d12a","last_reissued_at":"2026-05-18T00:41:58.572535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:58.572535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sample size required in importance sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.ST","physics.data-an","stat.TH"],"primary_cat":"math.PR","authors_text":"Persi Diaconis, Sourav Chatterjee","submitted_at":"2015-11-04T19:06:25Z","abstract_excerpt":"The goal of importance sampling is to estimate the expected value of a given function with respect to a probability measure $\\nu$ using a random sample of size $n$ drawn from a different probability measure $\\mu$. If the two measures $\\mu$ and $\\nu$ are nearly singular with respect to each other, which is often the case in practice, the sample size required for accurate estimation is large. In this article it is shown that in a fairly general setting, a sample of size approximately $\\exp(D(\\nu||\\mu))$ is necessary and sufficient for accurate estimation by importance sampling, where $D(\\nu||\\mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01437","kind":"arxiv","version":3},"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":"1511.01437","created_at":"2026-05-18T00:41:58.572632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01437v3","created_at":"2026-05-18T00:41:58.572632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01437","created_at":"2026-05-18T00:41:58.572632+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MDCGK6QMCEJ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MDCGK6QMCEJ3IWK","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MDCGK6Q","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM","json":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM.json","graph_json":"https://pith.science/api/pith-number/2MDCGK6QMCEJ3IWK77XFIH3JCM/graph.json","events_json":"https://pith.science/api/pith-number/2MDCGK6QMCEJ3IWK77XFIH3JCM/events.json","paper":"https://pith.science/paper/2MDCGK6Q"},"agent_actions":{"view_html":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM","download_json":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM.json","view_paper":"https://pith.science/paper/2MDCGK6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01437&json=true","fetch_graph":"https://pith.science/api/pith-number/2MDCGK6QMCEJ3IWK77XFIH3JCM/graph.json","fetch_events":"https://pith.science/api/pith-number/2MDCGK6QMCEJ3IWK77XFIH3JCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM/action/storage_attestation","attest_author":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM/action/author_attestation","sign_citation":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM/action/citation_signature","submit_replication":"https://pith.science/pith/2MDCGK6QMCEJ3IWK77XFIH3JCM/action/replication_record"}},"created_at":"2026-05-18T00:41:58.572632+00:00","updated_at":"2026-05-18T00:41:58.572632+00:00"}