{"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/gray-box-optimization-and-factorized","title":"Gray-box optimization and factorized distribution algorithms: where two worlds collide","arxiv_id":"1707.03093","date":"2017-07-11","proceeding":null,"authors":["Roberto Santana"],"abstract":"The concept of gray-box optimization, in juxtaposition to black-box\noptimization, revolves about the idea of exploiting the problem structure to\nimplement more efficient evolutionary algorithms (EAs). Work on factorized\ndistribution algorithms (FDAs), whose factorizations are directly derived from\nthe problem structure, has also contributed to show how exploiting the problem\nstructure produces important gains in the efficiency of EAs. In this paper we\nanalyze the general question of using problem structure in EAs focusing on\nconfronting work done in gray-box optimization with related research\naccomplished in FDAs. This contrasted analysis helps us to identify, in current\nstudies on the use problem structure in EAs, two distinct analytical\ncharacterizations of how these algorithms work. Moreover, we claim that these\ntwo characterizations collide and compete at the time of providing a coherent\nframework to investigate this type of algorithms. To illustrate this claim, we\npresent a contrasted analysis of formalisms, questions, and results produced in\nFDAs and gray-box optimization. Common underlying principles in the two\napproaches, which are usually overlooked, are identified and discussed.\nBesides, an extensive review of previous research related to different uses of\nthe problem structure in EAs is presented. The paper also elaborates on some of\nthe questions that arise when extending the use of problem structure in EAs,\nsuch as the question of evolvability, high cardinality of the variables and\nlarge definition sets, constrained and multi-objective problems, etc. Finally,\nemergent approaches that exploit neural models to capture the problem structure\nare covered.","url_abs":"http://arxiv.org/abs/1707.03093v1","url_pdf":"http://arxiv.org/pdf/1707.03093v1.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":"gray-box-optimization-and-factorized","repo_url":"https://github.com/rsantana-isg/graybox_fda_paper","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"},{"task_slug":"two","task_name":"Vocal Bursts Valence Prediction"}],"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":"rsantana-isg/graybox_fda_paper","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":"eb4a1d12d4cf98272abbd628b9b592142d98d249d62966f4e8eeaa08bc8fc1a5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}