{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/understanding-minimum-probability-flow-for","title":"Understanding Minimum Probability Flow for RBMs Under Various Kinds of Dynamics","arxiv_id":"1412.6617","date":"2014-12-20","proceeding":null,"authors":["Daniel Jiwoong Im","Ethan Buchman","Graham W. Taylor"],"abstract":"Energy-based models are popular in machine learning due to the elegance of\ntheir formulation and their relationship to statistical physics. Among these,\nthe Restricted Boltzmann Machine (RBM), and its staple training algorithm\ncontrastive divergence (CD), have been the prototype for some recent\nadvancements in the unsupervised training of deep neural networks. However, CD\nhas limited theoretical motivation, and can in some cases produce undesirable\nbehavior. Here, we investigate the performance of Minimum Probability Flow\n(MPF) learning for training RBMs. Unlike CD, with its focus on approximating an\nintractable partition function via Gibbs sampling, MPF proposes a tractable,\nconsistent, objective function defined in terms of a Taylor expansion of the KL\ndivergence with respect to sampling dynamics. Here we propose a more general\nform for the sampling dynamics in MPF, and explore the consequences of\ndifferent choices for these dynamics for training RBMs. Experimental results\nshow MPF outperforming CD for various RBM configurations.","url_abs":"http://arxiv.org/abs/1412.6617v6","url_pdf":"http://arxiv.org/pdf/1412.6617v6.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":"understanding-minimum-probability-flow-for","repo_url":"https://github.com/jiwoongim/minimum_probability_flow_learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"restricted-boltzmann-machine","method_name":"Restricted Boltzmann Machine"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"jiwoongim/minimum_probability_flow_learning","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d9b22bd211d336b7de58d337116e7086ab2468043a256efc5cdf2f12bddc51da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}