{"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/deep-boltzmann-machines-in-estimation-of","title":"Deep Boltzmann Machines in Estimation of Distribution Algorithms for Combinatorial Optimization","arxiv_id":"1509.06535","date":"2015-09-22","proceeding":null,"authors":["Malte Probst","Franz Rothlauf"],"abstract":"Estimation of Distribution Algorithms (EDAs) require flexible probability\nmodels that can be efficiently learned and sampled. Deep Boltzmann Machines\n(DBMs) are generative neural networks with these desired properties. We\nintegrate a DBM into an EDA and evaluate the performance of this system in\nsolving combinatorial optimization problems with a single objective. We compare\nthe results to the Bayesian Optimization Algorithm. The performance of DBM-EDA\nwas superior to BOA for difficult additively decomposable functions, i.e.,\nconcatenated deceptive traps of higher order. For most other benchmark\nproblems, DBM-EDA cannot clearly outperform BOA, or other neural network-based\nEDAs. In particular, it often yields optimal solutions for a subset of the runs\n(with fewer evaluations than BOA), but is unable to provide reliable\nconvergence to the global optimum competitively. At the same time, the model\nbuilding process is computationally more expensive than that of other EDAs\nusing probabilistic models from the neural network family, such as DAE-EDA.","url_abs":"http://arxiv.org/abs/1509.06535v2","url_pdf":"http://arxiv.org/pdf/1509.06535v2.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":"deep-boltzmann-machines-in-estimation-of","repo_url":"https://github.com/wohnjayne/eda-suite","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"}],"methods":[],"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":"wohnjayne/eda-suite","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":"cf7b7b4187e7662b36ff7ccfe8c6ce84cc18ffd5698b139d0af8ab116767476d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}