{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HJWFNTOBKAG4BROWXXY3YVTTMV","short_pith_number":"pith:HJWFNTOB","schema_version":"1.0","canonical_sha256":"3a6c56cdc1500dc0c5d6bdf1bc5673655ede97c8fe61f17c4c4852dac5988ab7","source":{"kind":"arxiv","id":"1810.04449","version":2},"attestation_state":"computed","paper":{"title":"Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"stat.CO","authors_text":"Changye Wu (U Paris Dauphine), Christian P. Robert (U Paris Dauphine & U Warwick), Julien Stoehr (U Paris Dauphine)","submitted_at":"2018-10-10T10:34:48Z","abstract_excerpt":"Hamiltonian Monte Carlo samplers have become standard algorithms for MCMC implementations, as opposed to more basic versions, but they still require some amount of tuning and calibration. Exploiting the U-turn criterion of the NUTS algorithm (Hoffman and Gelman, 2014), we propose a version of HMC that relies on the distribution of the integration time of the associated leapfrog integrator. Using in addition the primal-dual averaging method for tuning the step size of the integrator, we achieve an essentially calibration free version of HMC. When compared with the original NUTS on several bench"},"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":"1810.04449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-10-10T10:34:48Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"af13ea8d574742dd51768e342ad3e81d8b4a7f35c6a6503dfe9c78241a653f56","abstract_canon_sha256":"e0b1f7a5332cc23d4835af3e23c77cf1561953b806678689cac2f0ab2ea951b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:33.759073Z","signature_b64":"fCHI6IgT70jMN6w18Pamu8BzOnzBs9dPRHOBlTdn3Q6m/3t5/+raTApvtf16kvPclVWegPmsYAyjWGvXN2ioBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a6c56cdc1500dc0c5d6bdf1bc5673655ede97c8fe61f17c4c4852dac5988ab7","last_reissued_at":"2026-05-17T23:52:33.758640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:33.758640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"stat.CO","authors_text":"Changye Wu (U Paris Dauphine), Christian P. Robert (U Paris Dauphine & U Warwick), Julien Stoehr (U Paris Dauphine)","submitted_at":"2018-10-10T10:34:48Z","abstract_excerpt":"Hamiltonian Monte Carlo samplers have become standard algorithms for MCMC implementations, as opposed to more basic versions, but they still require some amount of tuning and calibration. Exploiting the U-turn criterion of the NUTS algorithm (Hoffman and Gelman, 2014), we propose a version of HMC that relies on the distribution of the integration time of the associated leapfrog integrator. Using in addition the primal-dual averaging method for tuning the step size of the integrator, we achieve an essentially calibration free version of HMC. When compared with the original NUTS on several bench"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04449","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":"1810.04449","created_at":"2026-05-17T23:52:33.758708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04449v2","created_at":"2026-05-17T23:52:33.758708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04449","created_at":"2026-05-17T23:52:33.758708+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJWFNTOBKAG4","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJWFNTOBKAG4BROW","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJWFNTOB","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02062","citing_title":"Functional probabilistic programming for scalable Bayesian modelling","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV","json":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV.json","graph_json":"https://pith.science/api/pith-number/HJWFNTOBKAG4BROWXXY3YVTTMV/graph.json","events_json":"https://pith.science/api/pith-number/HJWFNTOBKAG4BROWXXY3YVTTMV/events.json","paper":"https://pith.science/paper/HJWFNTOB"},"agent_actions":{"view_html":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV","download_json":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV.json","view_paper":"https://pith.science/paper/HJWFNTOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04449&json=true","fetch_graph":"https://pith.science/api/pith-number/HJWFNTOBKAG4BROWXXY3YVTTMV/graph.json","fetch_events":"https://pith.science/api/pith-number/HJWFNTOBKAG4BROWXXY3YVTTMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV/action/storage_attestation","attest_author":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV/action/author_attestation","sign_citation":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV/action/citation_signature","submit_replication":"https://pith.science/pith/HJWFNTOBKAG4BROWXXY3YVTTMV/action/replication_record"}},"created_at":"2026-05-17T23:52:33.758708+00:00","updated_at":"2026-05-17T23:52:33.758708+00:00"}