{"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/input-warping-for-bayesian-optimization-of","title":"Input Warping for Bayesian Optimization of Non-stationary Functions","arxiv_id":"1402.0929","date":"2014-02-05","proceeding":null,"authors":["Jasper Snoek","Kevin Swersky","Richard S. Zemel","Ryan P. Adams"],"abstract":"Bayesian optimization has proven to be a highly effective methodology for the\nglobal optimization of unknown, expensive and multimodal functions. The ability\nto accurately model distributions over functions is critical to the\neffectiveness of Bayesian optimization. Although Gaussian processes provide a\nflexible prior over functions which can be queried efficiently, there are\nvarious classes of functions that remain difficult to model. One of the most\nfrequently occurring of these is the class of non-stationary functions. The\noptimization of the hyperparameters of machine learning algorithms is a problem\ndomain in which parameters are often manually transformed a priori, for example\nby optimizing in \"log-space,\" to mitigate the effects of spatially-varying\nlength scale. We develop a methodology for automatically learning a wide family\nof bijective transformations or warpings of the input space using the Beta\ncumulative distribution function. We further extend the warping framework to\nmulti-task Bayesian optimization so that multiple tasks can be warped into a\njointly stationary space. On a set of challenging benchmark optimization tasks,\nwe observe that the inclusion of warping greatly improves on the\nstate-of-the-art, producing better results faster and more reliably.","url_abs":"http://arxiv.org/abs/1402.0929v3","url_pdf":"http://arxiv.org/pdf/1402.0929v3.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":"input-warping-for-bayesian-optimization-of","repo_url":"https://github.com/HIPS/Spearmint","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"},{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"},{"task_slug":"global-optimization","task_name":"global-optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1402.0929","atlas_url":"https://app.syntology.ai/?focus=1402.0929","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":"1402.0929"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1402.0929\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1402.0929"},"call":"get_concepts_for_paper(arxiv_id=\"1402.0929\")"}],"by_repo":[{"repo":"HIPS/Spearmint","kind":"listed","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":"e60cdaf8936c7824facd992b1b8be9ab29e481e380aed36fca368b5c2e2d3a7e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}