{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/ergodic-variational-flows","title":"MixFlows: principled variational inference via mixed flows","arxiv_id":"2205.07475","date":"2022-05-16","proceeding":null,"authors":["Zuheng Xu","Naitong Chen","Trevor Campbell"],"abstract":"This work presents mixed variational flows (MixFlows), a new variational family that consists of a mixture of repeated applications of a map to an initial reference distribution. First, we provide efficient algorithms for i.i.d. sampling, density evaluation, and unbiased ELBO estimation. We then show that MixFlows have MCMC-like convergence guarantees when the flow map is ergodic and measure-preserving, and provide bounds on the accumulation of error for practical implementations where the flow map is approximated. Finally, we develop an implementation of MixFlows based on uncorrected discretized Hamiltonian dynamics combined with deterministic momentum refreshment. Simulated and real data experiments show that MixFlows can provide more reliable posterior approximations than several black-box normalizing flows, as well as samples of comparable quality to those obtained from state-of-the-art MCMC methods.","url_abs":"https://arxiv.org/abs/2205.07475v6","url_pdf":"https://arxiv.org/pdf/2205.07475v6.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"ergodic-variational-flows","repo_url":"https://github.com/zuhengxu/ergodic-variational-flow-code","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"ergodic-variational-flows","repo_url":"https://github.com/giankdiluvi/madmix","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2205.07475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.07475"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zuhengxu/ergodic-variational-flow-code","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/giankdiluvi/madmix","reach":null}],"summary":{"ran_draft_wrong":1,"ran_fixture":1,"ran_honours":1,"unverified":1},"by_repo_kind":{"listed":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"4883ae6b574a6fa8","entry":"argmax_discsample_gen","repo":"giankdiluvi/madmix","repo_kind":"listed","path":"examples/GMM/sockeye/argmax/penguin/run/argmax_flows.py","file_url":"https://github.com/giankdiluvi/madmix/blob/HEAD/examples/GMM/sockeye/argmax/penguin/run/argmax_flows.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4883ae6b574a6fa8"}},{"code_sha256_prefix":"523fab3822c455e6","entry":"flow","repo":"giankdiluvi/madmix","repo_kind":"listed","path":"src/discrete_mixflows.py","file_url":"https://github.com/giankdiluvi/madmix/blob/HEAD/src/discrete_mixflows.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"523fab3822c455e6"}},{"code_sha256_prefix":"fa15737b50f930b1","entry":"randqN","repo":"giankdiluvi/madmix","repo_kind":"listed","path":"src/discrete_mixflows.py","file_url":"https://github.com/giankdiluvi/madmix/blob/HEAD/src/discrete_mixflows.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"fa15737b50f930b1"}},{"code_sha256_prefix":"6ec5506338740338","entry":"lqN","repo":"giankdiluvi/madmix","repo_kind":"listed","path":"src/discrete_mixflows.py","file_url":"https://github.com/giankdiluvi/madmix/blob/HEAD/src/discrete_mixflows.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6ec5506338740338"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}