{"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/max-value-entropy-search-for-efficient","title":"Max-value Entropy Search for Efficient Bayesian Optimization","arxiv_id":"1703.01968","date":"2017-03-06","proceeding":"ICML 2017 8","authors":["Zi Wang","Stefanie Jegelka"],"abstract":"Entropy Search (ES) and Predictive Entropy Search (PES) are popular and\nempirically successful Bayesian Optimization techniques. Both rely on a\ncompelling information-theoretic motivation, and maximize the information\ngained about the $\\arg\\max$ of the unknown function; yet, both are plagued by\nthe expensive computation for estimating entropies. We propose a new criterion,\nMax-value Entropy Search (MES), that instead uses the information about the\nmaximum function value. We show relations of MES to other Bayesian optimization\nmethods, and establish a regret bound. We observe that MES maintains or\nimproves the good empirical performance of ES/PES, while tremendously\nlightening the computational burden. In particular, MES is much more robust to\nthe number of samples used for computing the entropy, and hence more efficient\nfor higher dimensional problems.","url_abs":"http://arxiv.org/abs/1703.01968v3","url_pdf":"http://arxiv.org/pdf/1703.01968v3.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":"max-value-entropy-search-for-efficient","repo_url":"https://github.com/zi-w/Max-value-Entropy-Search","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"max-value-entropy-search-for-efficient","repo_url":"https://github.com/SK-tklab/BayesianOptimization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"max-value-entropy-search-for-efficient","repo_url":"https://github.com/kiudee/bayes-skopt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"max-value-entropy-search-for-efficient","repo_url":"https://github.com/svedel/greattunes","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"bayesian-optimisation","task_name":"Bayesian Optimisation"},{"task_slug":"bayesian-optimization","task_name":"Bayesian Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.01968","atlas_url":"https://app.syntology.ai/?focus=1703.01968","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":"1703.01968"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.01968\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.01968"},"call":"get_concepts_for_paper(arxiv_id=\"1703.01968\")"}],"by_repo":[{"repo":"zi-w/Max-value-Entropy-Search","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"SK-tklab/BayesianOptimization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kiudee/bayes-skopt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"svedel/greattunes","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1807.02811"],"harvested_for_calls":[{"arxiv_id":"1807.02811","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1807.02811"},"call":"get_harvested_code_for_paper(arxiv_id=\"1807.02811\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"e58416f99a5ab569bab6396014a26881edd3c5b6de2244dbbc98fc005145f700","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}