{"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/on-the-choice-of-the-low-dimensional-domain","title":"On the choice of the low-dimensional domain for global optimization via random embeddings","arxiv_id":"1704.05318","date":"2017-04-18","proceeding":null,"authors":["Mickaël Binois","David Ginsbourger","Olivier Roustant"],"abstract":"The challenge of taking many variables into account in optimization problems\nmay be overcome under the hypothesis of low effective dimensionality. Then, the\nsearch of solutions can be reduced to the random embedding of a low dimensional\nspace into the original one, resulting in a more manageable optimization\nproblem. Specifically, in the case of time consuming black-box functions and\nwhen the budget of evaluations is severely limited, global optimization with\nrandom embeddings appears as a sound alternative to random search. Yet, in the\ncase of box constraints on the native variables, defining suitable bounds on a\nlow dimensional domain appears to be complex. Indeed, a small search domain\ndoes not guarantee to find a solution even under restrictive hypotheses about\nthe function, while a larger one may slow down convergence dramatically. Here\nwe tackle the issue of low-dimensional domain selection based on a detailed\nstudy of the properties of the random embedding, giving insight on the\naforementioned difficulties. In particular, we describe a minimal\nlow-dimensional set in correspondence with the embedded search space. We\nadditionally show that an alternative equivalent embedding procedure yields\nsimultaneously a simpler definition of the low-dimensional minimal set and\nbetter properties in practice. Finally, the performance and robustness gains of\nthe proposed enhancements for Bayesian optimization are illustrated on\nnumerical examples.","url_abs":"http://arxiv.org/abs/1704.05318v3","url_pdf":"http://arxiv.org/pdf/1704.05318v3.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":"on-the-choice-of-the-low-dimensional-domain","repo_url":"https://github.com/mbinois/RRembo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"global-optimization","task_name":"global-optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.05318","atlas_url":"https://app.syntology.ai/?focus=1704.05318","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1704.05318"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.05318\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.05318"},"call":"get_concepts_for_paper(arxiv_id=\"1704.05318\")"}],"by_repo":[{"repo":"mbinois/RRembo","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":"275df7bbd132bafcfcacdadd22de88256eeca5d70994dc2e173e72b38c2376e4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}