{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DOU3R64CN4RFHISOEA2MBSDCJI","short_pith_number":"pith:DOU3R64C","schema_version":"1.0","canonical_sha256":"1ba9b8fb826f2253a24e2034c0c8624a305f117f51a19fbacf2fd9960807adc8","source":{"kind":"arxiv","id":"1711.02679","version":2},"attestation_state":"computed","paper":{"title":"Neural Variational Inference and Learning in Undirected Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Stefano Ermon, Volodymyr Kuleshov","submitted_at":"2017-11-07T19:00:20Z","abstract_excerpt":"Many problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the log-partition function parametrized by a function q that we express as a flexible neural network. Our bound makes it possible to track the partition function during learning, to speed-up sampling, and to train a broad class of hybrid directed/undirected models via a unified variation"},"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":"1711.02679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-07T19:00:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f741a0395c87ef7990fc1b30c4f124a347a3fceeb2c9c6758231ab7c51f98fd","abstract_canon_sha256":"4fb7cc8f05413bf69398645223a20343906846466768dd2f45dcf8d80b06cb62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.733613Z","signature_b64":"Emhm/H68lAtftj8vZyTWtkSKT/jf/fQx2LmA7HfTZa0k0SatagS9h63aO9U54sR83MdJGyeqxEKEviXUqUiKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba9b8fb826f2253a24e2034c0c8624a305f117f51a19fbacf2fd9960807adc8","last_reissued_at":"2026-05-18T00:30:21.733071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.733071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Variational Inference and Learning in Undirected Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Stefano Ermon, Volodymyr Kuleshov","submitted_at":"2017-11-07T19:00:20Z","abstract_excerpt":"Many problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the log-partition function parametrized by a function q that we express as a flexible neural network. Our bound makes it possible to track the partition function during learning, to speed-up sampling, and to train a broad class of hybrid directed/undirected models via a unified variation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02679","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":"1711.02679","created_at":"2026-05-18T00:30:21.733164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02679v2","created_at":"2026-05-18T00:30:21.733164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02679","created_at":"2026-05-18T00:30:21.733164+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOU3R64CN4RF","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOU3R64CN4RFHISO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOU3R64C","created_at":"2026-05-18T12:31:12.930513+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/DOU3R64CN4RFHISOEA2MBSDCJI","json":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI.json","graph_json":"https://pith.science/api/pith-number/DOU3R64CN4RFHISOEA2MBSDCJI/graph.json","events_json":"https://pith.science/api/pith-number/DOU3R64CN4RFHISOEA2MBSDCJI/events.json","paper":"https://pith.science/paper/DOU3R64C"},"agent_actions":{"view_html":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI","download_json":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI.json","view_paper":"https://pith.science/paper/DOU3R64C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02679&json=true","fetch_graph":"https://pith.science/api/pith-number/DOU3R64CN4RFHISOEA2MBSDCJI/graph.json","fetch_events":"https://pith.science/api/pith-number/DOU3R64CN4RFHISOEA2MBSDCJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/action/storage_attestation","attest_author":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/action/author_attestation","sign_citation":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/action/citation_signature","submit_replication":"https://pith.science/pith/DOU3R64CN4RFHISOEA2MBSDCJI/action/replication_record"}},"created_at":"2026-05-18T00:30:21.733164+00:00","updated_at":"2026-05-18T00:30:21.733164+00:00"}