{"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/derivative-free-optimization-via-repeated","title":"Derivative free optimization via repeated classification","arxiv_id":"1804.03761","date":"2018-04-11","proceeding":null,"authors":["Tatsunori B. Hashimoto","Steve Yadlowsky","John C. Duchi"],"abstract":"We develop an algorithm for minimizing a function using $n$ batched function\nvalue measurements at each of $T$ rounds by using classifiers to identify a\nfunction's sublevel set. We show that sufficiently accurate classifiers can\nachieve linear convergence rates, and show that the convergence rate is tied to\nthe difficulty of active learning sublevel sets. Further, we show that the\nbootstrap is a computationally efficient approximation to the necessary\nclassification scheme.\n  The end result is a computationally efficient derivative-free algorithm\nrequiring no tuning that consistently outperforms other approaches on\nsimulations, standard benchmarks, real-world DNA binding optimization, and\nairfoil design problems whenever batched function queries are natural.","url_abs":"http://arxiv.org/abs/1804.03761v1","url_pdf":"http://arxiv.org/pdf/1804.03761v1.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":"derivative-free-optimization-via-repeated","repo_url":"https://worksheets.codalab.org/worksheets/0x978bd1ba6b284678994c067f9c9bdb78","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.03761","atlas_url":"https://app.syntology.ai/?focus=1804.03761","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":"1804.03761"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.03761\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.03761"},"call":"get_concepts_for_paper(arxiv_id=\"1804.03761\")"}],"by_repo":[{"repo":"worksheets.codalab.org/worksheets/0x978bd1ba6b284678994c067f9c9bdb78","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":"852c732778aa98039e0b22f853a3145b40b6c7aa821fe2fcf1bdf976a4cac365","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}