{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6W2Z47BTQYBRYE2BO43WBCPKI5","short_pith_number":"pith:6W2Z47BT","schema_version":"1.0","canonical_sha256":"f5b59e7c3386031c134177376089ea47465320aa0e1d13561aef9de5ed608eef","source":{"kind":"arxiv","id":"2410.18929","version":3},"attestation_state":"computed","paper":{"title":"AutoStep: Locally adaptive involutive MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.CO","authors_text":"Alexandre Bouchard-C\\^ot\\'e, Miguel Biron-Lattes, Nikola Surjanovic, Tiange Liu, Trevor Campbell","submitted_at":"2024-10-24T17:17:11Z","abstract_excerpt":"Many common Markov chain Monte Carlo (MCMC) kernels can be formulated using a deterministic involutive proposal with a step size parameter. Selecting an appropriate step size is often a challenging task in practice; and for complex multiscale targets, there may not be one choice of step size that works well globally. In this work, we address this problem with a novel class of involutive MCMC methods -- AutoStep MCMC -- that selects an appropriate step size at each iteration adapted to the local geometry of the target distribution. We prove that under mild conditions AutoStep MCMC is $\\pi$-inva"},"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":"2410.18929","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2024-10-24T17:17:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"0a2f60e7ac0be1c9afdaa6d03caaeafd93236a19de0b73430ff973cebfbcb406","abstract_canon_sha256":"786b187fb96e85fe0f7ede150dd4b9bbe7b3d3406ba2e3eedd332a09a2e9f433"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:24.542481Z","signature_b64":"+hYDWup3oBY0AIQ3qUVX1XLPBhO/tYmYkUhz07qwJ+z8tJ1yBhNtYF0i2gnkO7ZsUOLW1NWbhs8O3duR1M/sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b59e7c3386031c134177376089ea47465320aa0e1d13561aef9de5ed608eef","last_reissued_at":"2026-07-05T11:06:24.541991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:24.541991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AutoStep: Locally adaptive involutive MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"stat.CO","authors_text":"Alexandre Bouchard-C\\^ot\\'e, Miguel Biron-Lattes, Nikola Surjanovic, Tiange Liu, Trevor Campbell","submitted_at":"2024-10-24T17:17:11Z","abstract_excerpt":"Many common Markov chain Monte Carlo (MCMC) kernels can be formulated using a deterministic involutive proposal with a step size parameter. Selecting an appropriate step size is often a challenging task in practice; and for complex multiscale targets, there may not be one choice of step size that works well globally. In this work, we address this problem with a novel class of involutive MCMC methods -- AutoStep MCMC -- that selects an appropriate step size at each iteration adapted to the local geometry of the target distribution. We prove that under mild conditions AutoStep MCMC is $\\pi$-inva"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18929","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.18929/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":"2410.18929","created_at":"2026-07-05T11:06:24.542042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.18929v3","created_at":"2026-07-05T11:06:24.542042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18929","created_at":"2026-07-05T11:06:24.542042+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W2Z47BTQYBR","created_at":"2026-07-05T11:06:24.542042+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W2Z47BTQYBRYE2B","created_at":"2026-07-05T11:06:24.542042+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W2Z47BT","created_at":"2026-07-05T11:06:24.542042+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.00671","citing_title":"Harnessing the Power of Reinforcement Learning for Adaptive MCMC","ref_index":2000,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5","json":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5.json","graph_json":"https://pith.science/api/pith-number/6W2Z47BTQYBRYE2BO43WBCPKI5/graph.json","events_json":"https://pith.science/api/pith-number/6W2Z47BTQYBRYE2BO43WBCPKI5/events.json","paper":"https://pith.science/paper/6W2Z47BT"},"agent_actions":{"view_html":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5","download_json":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5.json","view_paper":"https://pith.science/paper/6W2Z47BT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.18929&json=true","fetch_graph":"https://pith.science/api/pith-number/6W2Z47BTQYBRYE2BO43WBCPKI5/graph.json","fetch_events":"https://pith.science/api/pith-number/6W2Z47BTQYBRYE2BO43WBCPKI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5/action/storage_attestation","attest_author":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5/action/author_attestation","sign_citation":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5/action/citation_signature","submit_replication":"https://pith.science/pith/6W2Z47BTQYBRYE2BO43WBCPKI5/action/replication_record"}},"created_at":"2026-07-05T11:06:24.542042+00:00","updated_at":"2026-07-05T11:06:24.542042+00:00"}