{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X36J3WADT2IQ23TTGJSXAB52U6","short_pith_number":"pith:X36J3WAD","schema_version":"1.0","canonical_sha256":"befc9dd8039e910d6e7332657007baa7ae88d6234f9d872116a30af5b2816004","source":{"kind":"arxiv","id":"1903.03704","version":1},"attestation_state":"computed","paper":{"title":"NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transport","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Dustin Tran, Ian Langmore, Joshua V. Dillon, Matthew Hoffman, Pavel Sountsov, Srinivas Vasudevan","submitted_at":"2019-03-09T00:23:26Z","abstract_excerpt":"Hamiltonian Monte Carlo is a powerful algorithm for sampling from difficult-to-normalize posterior distributions. However, when the geometry of the posterior is unfavorable, it may take many expensive evaluations of the target distribution and its gradient to converge and mix. We propose neural transport (NeuTra) HMC, a technique for learning to correct this sort of unfavorable geometry using inverse autoregressive flows (IAF), a powerful neural variational inference technique. The IAF is trained to minimize the KL divergence from an isotropic Gaussian to the warped posterior, and then HMC sam"},"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":"1903.03704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2019-03-09T00:23:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3e8d22c5a5b99aa7a00e55743217c9bdc72dbd2ecfaf740fec189e387069e2d0","abstract_canon_sha256":"ebce3031735c3a756d7704171eeac04d8f65d40c1ddb1ff55ede09d6885c3581"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.208066Z","signature_b64":"YTNzRfpL2dDsBl7iQctSH2bl9CqVTvzvqpoDCfWFonfsuUdKIUSaLiY63MuQ1hP03wYiJ2VaOAyHdxB93s7fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"befc9dd8039e910d6e7332657007baa7ae88d6234f9d872116a30af5b2816004","last_reissued_at":"2026-05-17T23:51:41.207592Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.207592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transport","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Dustin Tran, Ian Langmore, Joshua V. Dillon, Matthew Hoffman, Pavel Sountsov, Srinivas Vasudevan","submitted_at":"2019-03-09T00:23:26Z","abstract_excerpt":"Hamiltonian Monte Carlo is a powerful algorithm for sampling from difficult-to-normalize posterior distributions. However, when the geometry of the posterior is unfavorable, it may take many expensive evaluations of the target distribution and its gradient to converge and mix. We propose neural transport (NeuTra) HMC, a technique for learning to correct this sort of unfavorable geometry using inverse autoregressive flows (IAF), a powerful neural variational inference technique. The IAF is trained to minimize the KL divergence from an isotropic Gaussian to the warped posterior, and then HMC sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03704","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":"1903.03704","created_at":"2026-05-17T23:51:41.207663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03704v1","created_at":"2026-05-17T23:51:41.207663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03704","created_at":"2026-05-17T23:51:41.207663+00:00"},{"alias_kind":"pith_short_12","alias_value":"X36J3WADT2IQ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X36J3WADT2IQ23TT","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X36J3WAD","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.20345","citing_title":"Corrected Integrated Laplace Approximation for Bayesian Inference in Latent Gaussian Models","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2508.20266","citing_title":"Using Symbolic Regression to Emulate the Radial Fourier Transform of the S\\'ersic profile for Fast, Accurate and Differentiable Galaxy Profile Fitting","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.09832","citing_title":"Adaptive Riemannian Manifold Hamiltonian Monte Carlo with Hierarchical Metric","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6","json":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6.json","graph_json":"https://pith.science/api/pith-number/X36J3WADT2IQ23TTGJSXAB52U6/graph.json","events_json":"https://pith.science/api/pith-number/X36J3WADT2IQ23TTGJSXAB52U6/events.json","paper":"https://pith.science/paper/X36J3WAD"},"agent_actions":{"view_html":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6","download_json":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6.json","view_paper":"https://pith.science/paper/X36J3WAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03704&json=true","fetch_graph":"https://pith.science/api/pith-number/X36J3WADT2IQ23TTGJSXAB52U6/graph.json","fetch_events":"https://pith.science/api/pith-number/X36J3WADT2IQ23TTGJSXAB52U6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6/action/storage_attestation","attest_author":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6/action/author_attestation","sign_citation":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6/action/citation_signature","submit_replication":"https://pith.science/pith/X36J3WADT2IQ23TTGJSXAB52U6/action/replication_record"}},"created_at":"2026-05-17T23:51:41.207663+00:00","updated_at":"2026-05-17T23:51:41.207663+00:00"}