{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7BNYKRBUJP4HFHLUUEXSIX3UTF","short_pith_number":"pith:7BNYKRBU","schema_version":"1.0","canonical_sha256":"f85b8544344bf8729d74a12f245f7499753cdf71a27765bd5b0e5f2ce9fb62e7","source":{"kind":"arxiv","id":"1706.07561","version":3},"attestation_state":"computed","paper":{"title":"A-NICE-MC: Adversarial Training for MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jiaming Song, Shengjia Zhao, Stefano Ermon","submitted_at":"2017-06-23T04:19:04Z","abstract_excerpt":"Existing Markov Chain Monte Carlo (MCMC) methods are either based on general-purpose and domain-agnostic schemes which can lead to slow convergence, or hand-crafting of problem-specific proposals by an expert. We propose A-NICE-MC, a novel method to train flexible parametric Markov chain kernels to produce samples with desired properties. First, we propose an efficient likelihood-free adversarial training method to train a Markov chain and mimic a given data distribution. Then, we leverage flexible volume preserving flows to obtain parametric kernels for MCMC. Using a bootstrap approach, we sh"},"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":"1706.07561","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-23T04:19:04Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"6b07e6a5d0342efc47478c27a9da61752b73105a8fd78fbc7c02c75b96cc5663","abstract_canon_sha256":"d2c8e4fb637f1b47e1195836fd417ada9c3b55b69a186fb37d2361c891291c43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:56.411773Z","signature_b64":"Jq+r6t1MCAPdl3o4UG8OStl2C5iSDXQR+0uZDP+0j8IfLkdY5bMracwYGhWjLT8YrVzrchctNmyCVhiyB3zKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85b8544344bf8729d74a12f245f7499753cdf71a27765bd5b0e5f2ce9fb62e7","last_reissued_at":"2026-05-18T00:20:56.411259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:56.411259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A-NICE-MC: Adversarial Training for MCMC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jiaming Song, Shengjia Zhao, Stefano Ermon","submitted_at":"2017-06-23T04:19:04Z","abstract_excerpt":"Existing Markov Chain Monte Carlo (MCMC) methods are either based on general-purpose and domain-agnostic schemes which can lead to slow convergence, or hand-crafting of problem-specific proposals by an expert. We propose A-NICE-MC, a novel method to train flexible parametric Markov chain kernels to produce samples with desired properties. First, we propose an efficient likelihood-free adversarial training method to train a Markov chain and mimic a given data distribution. Then, we leverage flexible volume preserving flows to obtain parametric kernels for MCMC. Using a bootstrap approach, we sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07561","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":"1706.07561","created_at":"2026-05-18T00:20:56.411333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07561v3","created_at":"2026-05-18T00:20:56.411333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07561","created_at":"2026-05-18T00:20:56.411333+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BNYKRBUJP4H","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BNYKRBUJP4HFHLU","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BNYKRBU","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2010.02502","citing_title":"Denoising Diffusion Implicit Models","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF","json":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF.json","graph_json":"https://pith.science/api/pith-number/7BNYKRBUJP4HFHLUUEXSIX3UTF/graph.json","events_json":"https://pith.science/api/pith-number/7BNYKRBUJP4HFHLUUEXSIX3UTF/events.json","paper":"https://pith.science/paper/7BNYKRBU"},"agent_actions":{"view_html":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF","download_json":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF.json","view_paper":"https://pith.science/paper/7BNYKRBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07561&json=true","fetch_graph":"https://pith.science/api/pith-number/7BNYKRBUJP4HFHLUUEXSIX3UTF/graph.json","fetch_events":"https://pith.science/api/pith-number/7BNYKRBUJP4HFHLUUEXSIX3UTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF/action/storage_attestation","attest_author":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF/action/author_attestation","sign_citation":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF/action/citation_signature","submit_replication":"https://pith.science/pith/7BNYKRBUJP4HFHLUUEXSIX3UTF/action/replication_record"}},"created_at":"2026-05-18T00:20:56.411333+00:00","updated_at":"2026-05-18T00:20:56.411333+00:00"}