{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C7ZAPTKLWTVXBCA5QHR43U5JCJ","short_pith_number":"pith:C7ZAPTKL","schema_version":"1.0","canonical_sha256":"17f207cd4bb4eb70881d81e3cdd3a9126556da4f486d8dfafb6cdb40fc26a959","source":{"kind":"arxiv","id":"1307.1799","version":2},"attestation_state":"computed","paper":{"title":"The Containment Condition and AdapFail algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jeffrey S. Rosenthal, Krzysztof Latuszynski","submitted_at":"2013-07-06T16:18:48Z","abstract_excerpt":"This short note investigates convergence of adaptive MCMC algorithms, i.e.\\ algorithms which modify the Markov chain update probabilities on the fly. We focus on the Containment condition introduced in \\cite{roberts2007coupling}. We show that if the Containment condition is \\emph{not} satisfied, then the algorithm will perform very poorly. Specifically, with positive probability, the adaptive algorithm will be asymptotically less efficient then \\emph{any} nonadaptive ergodic MCMC algorithm. We call such algorithms \\texttt{AdapFail}, and conclude that they should not be used."},"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":"1307.1799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-07-06T16:18:48Z","cross_cats_sorted":[],"title_canon_sha256":"057209277534fc8de0b577d124364177ca4ce05d3f8f68f4485697c547fc08b1","abstract_canon_sha256":"d31cecdda833981a150e549d56c6de21908cf4ef6a7946584b8b33b838940ee7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:44.239017Z","signature_b64":"v9hH0a0L+IJrMCB3YvY7/JkdOsvasHpJ7gEcRJxH5SE7Sq7aduYaqvT0fbzAtisot3Emkov68YEMlMCtvW0NBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17f207cd4bb4eb70881d81e3cdd3a9126556da4f486d8dfafb6cdb40fc26a959","last_reissued_at":"2026-05-18T03:03:44.238195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:44.238195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Containment Condition and AdapFail algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jeffrey S. Rosenthal, Krzysztof Latuszynski","submitted_at":"2013-07-06T16:18:48Z","abstract_excerpt":"This short note investigates convergence of adaptive MCMC algorithms, i.e.\\ algorithms which modify the Markov chain update probabilities on the fly. We focus on the Containment condition introduced in \\cite{roberts2007coupling}. We show that if the Containment condition is \\emph{not} satisfied, then the algorithm will perform very poorly. Specifically, with positive probability, the adaptive algorithm will be asymptotically less efficient then \\emph{any} nonadaptive ergodic MCMC algorithm. We call such algorithms \\texttt{AdapFail}, and conclude that they should not be used."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1799","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":"1307.1799","created_at":"2026-05-18T03:03:44.238330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1799v2","created_at":"2026-05-18T03:03:44.238330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1799","created_at":"2026-05-18T03:03:44.238330+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7ZAPTKLWTVX","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7ZAPTKLWTVXBCA5","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7ZAPTKL","created_at":"2026-05-18T12:27:40.988391+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/C7ZAPTKLWTVXBCA5QHR43U5JCJ","json":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ.json","graph_json":"https://pith.science/api/pith-number/C7ZAPTKLWTVXBCA5QHR43U5JCJ/graph.json","events_json":"https://pith.science/api/pith-number/C7ZAPTKLWTVXBCA5QHR43U5JCJ/events.json","paper":"https://pith.science/paper/C7ZAPTKL"},"agent_actions":{"view_html":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ","download_json":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ.json","view_paper":"https://pith.science/paper/C7ZAPTKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1799&json=true","fetch_graph":"https://pith.science/api/pith-number/C7ZAPTKLWTVXBCA5QHR43U5JCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/C7ZAPTKLWTVXBCA5QHR43U5JCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ/action/storage_attestation","attest_author":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ/action/author_attestation","sign_citation":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ/action/citation_signature","submit_replication":"https://pith.science/pith/C7ZAPTKLWTVXBCA5QHR43U5JCJ/action/replication_record"}},"created_at":"2026-05-18T03:03:44.238330+00:00","updated_at":"2026-05-18T03:03:44.238330+00:00"}