{"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":"/task/bayesian-optimisation/papers/ran/1","list_of":"/task/bayesian-optimisation","task":"Bayesian Optimisation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,31],"of":31,"counts":{"archive_papers_tagged":221,"with_a_code_link":97,"where_syntology_ran_a_sample":31,"not_listed_spam_title":0,"listed":221,"listed_where_code_ran":31,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":27,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":27,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/bayesian-optimisation/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/sample-efficient-bayesian-optimisation-using","slug":"sample-efficient-bayesian-optimisation-using","title":"Sample-efficient Bayesian Optimisation Using Known Invariances","date":"2024-10-22","arxiv_id":"2410.16972","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sample-efficient-bayesian-optimisation-using#ran","syntology_url":"https://syntology.ai/paper/2410.16972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16972"}},"official":{"repos":["theo-brown/bayesopt_with_invariances","theo-brown/invariantkernels"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/principled-bayesian-optimisation-in","slug":"principled-bayesian-optimisation-in","title":"Principled Bayesian Optimisation in Collaboration with Human Experts","date":"2024-10-14","arxiv_id":"2410.10452","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/principled-bayesian-optimisation-in#ran","syntology_url":"https://syntology.ai/paper/2410.10452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10452"}},"official":{"repos":["ma921/cobol"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/a-quadrature-approach-for-general-purpose","slug":"a-quadrature-approach-for-general-purpose","title":"A Quadrature Approach for General-Purpose Batch Bayesian Optimization via Probabilistic Lifting","date":"2024-04-18","arxiv_id":"2404.12219","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-quadrature-approach-for-general-purpose#ran","syntology_url":"https://syntology.ai/paper/2404.12219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12219"}},"official":{"repos":["ma921/sober"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/expert-guided-bayesian-optimisation-for-human","slug":"expert-guided-bayesian-optimisation-for-human","title":"Expert-guided Bayesian Optimisation for Human-in-the-loop Experimental Design of Known Systems","date":"2023-12-05","arxiv_id":"2312.02852","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/expert-guided-bayesian-optimisation-for-human#ran","syntology_url":"https://syntology.ai/paper/2312.02852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02852"}},"official":{"repos":["trsav/hitl-bo"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/data-driven-prior-learning-for-bayesian","slug":"data-driven-prior-learning-for-bayesian","title":"Data-driven Prior Learning for Bayesian Optimisation","date":"2023-11-24","arxiv_id":"2311.14653","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-driven-prior-learning-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/2311.14653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14653"}},"official":{"repos":["sighellan/plebo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-and-conjugate-gaussian-process","slug":"robust-and-conjugate-gaussian-process","title":"Robust and Conjugate Gaussian Process Regression","date":"2023-11-01","arxiv_id":"2311.00463","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-and-conjugate-gaussian-process#ran","syntology_url":"https://syntology.ai/paper/2311.00463","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00463"}},"official":{"repos":["maltamiranomontero/RCGP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-gradient-descent-for-gaussian","slug":"stochastic-gradient-descent-for-gaussian","title":"Stochastic Gradient Descent for Gaussian Processes Done Right","date":"2023-10-31","arxiv_id":"2310.20581","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/stochastic-gradient-descent-for-gaussian#ran","syntology_url":"https://syntology.ai/paper/2310.20581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.20581"}},"official":{"repos":["cambridge-mlg/sgd-gp"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-agnostic-batch-bayesian-optimization","slug":"domain-agnostic-batch-bayesian-optimization","title":"Adaptive Batch Sizes for Active Learning A Probabilistic Numerics Approach","date":"2023-06-09","arxiv_id":"2306.05843","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/domain-agnostic-batch-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2306.05843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05843"}},"official":{"repos":["ma921/adabatal"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autopeft-automatic-configuration-search-for","slug":"autopeft-automatic-configuration-search-for","title":"AutoPEFT: Automatic Configuration Search for Parameter-Efficient Fine-Tuning","date":"2023-01-28","arxiv_id":"2301.12132","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/autopeft-automatic-configuration-search-for#ran","syntology_url":"https://syntology.ai/paper/2301.12132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12132"}},"official":{"repos":["cambridgeltl/autopeft"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/gauche-a-library-for-gaussian-processes-in-1","slug":"gauche-a-library-for-gaussian-processes-in-1","title":"GAUCHE: A Library for Gaussian Processes in Chemistry","date":"2022-12-06","arxiv_id":"2212.04450","repositories_listed":2,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gauche-a-library-for-gaussian-processes-in-1#ran","syntology_url":"https://syntology.ai/paper/2212.04450","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04450"}},"official":{"repos":["leojklarner/gauche"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/batch-bayesian-optimization-via-particle","slug":"batch-bayesian-optimization-via-particle","title":"Batch Bayesian Optimization via Particle Gradient Flows","date":"2022-09-10","arxiv_id":"2209.04722","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/batch-bayesian-optimization-via-particle#ran","syntology_url":"https://syntology.ai/paper/2209.04722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.04722"}},"official":{"repos":["enricocrovini/BBO-via-PGF"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-penalisation-method-for-batch-multi","slug":"a-penalisation-method-for-batch-multi","title":"A penalisation method for batch multi-objective Bayesian optimisation with application in heat exchanger design","date":"2022-06-27","arxiv_id":"2206.13326","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-penalisation-method-for-batch-multi#ran","syntology_url":"https://syntology.ai/paper/2206.13326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13326"}},"official":{"repos":["apaleyes/hippo"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/omlt-optimization-machine-learning-toolkit","slug":"omlt-optimization-machine-learning-toolkit","title":"OMLT: Optimization & Machine Learning Toolkit","date":"2022-02-04","arxiv_id":"2202.02414","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/omlt-optimization-machine-learning-toolkit#ran","syntology_url":"https://syntology.ai/paper/2202.02414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02414"}},"official":{"repos":["cog-imperial/omlt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-attacks-on-graph-classification","slug":"adversarial-attacks-on-graph-classification","title":"Adversarial Attacks on Graph Classification via Bayesian Optimisation","date":"2021-11-04","arxiv_id":"2111.02842","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-attacks-on-graph-classification#ran","syntology_url":"https://syntology.ai/paper/2111.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02842"}},"official":{"repos":["xingchenwan/grabnel"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/expobench-benchmarking-surrogate-based","slug":"expobench-benchmarking-surrogate-based","title":"EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions","date":"2021-06-08","arxiv_id":"2106.04618","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/expobench-benchmarking-surrogate-based#ran","syntology_url":"https://syntology.ai/paper/2106.04618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04618"}},"official":{"repos":["AlgTUDelft/ExpensiveOptimBenchmark"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autolrs-automatic-learning-rate-schedule-by-1","slug":"autolrs-automatic-learning-rate-schedule-by-1","title":"AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Fly","date":"2021-05-22","arxiv_id":"2105.10762","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/autolrs-automatic-learning-rate-schedule-by-1#ran","syntology_url":"https://syntology.ai/paper/2105.10762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.10762"}},"official":{"repos":["YuchenJin/autolrs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-architecture-search-using-bayesian","slug":"neural-architecture-search-using-bayesian","title":"Interpretable Neural Architecture Search via Bayesian Optimisation with Weisfeiler-Lehman Kernels","date":"2020-06-13","arxiv_id":"2006.07556","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-architecture-search-using-bayesian#ran","syntology_url":"https://syntology.ai/paper/2006.07556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07556"}},"official":null}},{"url":"/paper/randomised-gaussian-process-upper-confidence","slug":"randomised-gaussian-process-upper-confidence","title":"Randomised Gaussian Process Upper Confidence Bound for Bayesian Optimisation","date":"2020-06-08","arxiv_id":"2006.04296","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/randomised-gaussian-process-upper-confidence#ran","syntology_url":"https://syntology.ai/paper/2006.04296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04296"}},"official":{"repos":["jmaberk/RGPUCB"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/what-do-you-mean-the-role-of-the-mean","slug":"what-do-you-mean-the-role-of-the-mean","title":"What do you Mean? The Role of the Mean Function in Bayesian Optimisation","date":"2020-04-17","arxiv_id":"2004.08349","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/what-do-you-mean-the-role-of-the-mean#ran","syntology_url":"https://syntology.ai/paper/2004.08349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08349"}},"official":{"repos":["georgedeath/bomean"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/sequential-bayesian-experimental-design-for","slug":"sequential-bayesian-experimental-design-for","title":"Sequential Bayesian Experimental Design for Implicit Models via Mutual Information","date":"2020-03-20","arxiv_id":"2003.09379","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequential-bayesian-experimental-design-for#ran","syntology_url":"https://syntology.ai/paper/2003.09379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09379"}},"official":null}},{"url":"/paper/greed-is-good-exploration-and-exploitation","slug":"greed-is-good-exploration-and-exploitation","title":"Greed is Good: Exploration and Exploitation Trade-offs in Bayesian Optimisation","date":"2019-11-28","arxiv_id":"1911.12809","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/greed-is-good-exploration-and-exploitation#ran","syntology_url":"https://syntology.ai/paper/1911.12809","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12809"}},"official":{"repos":["georgedeath/egreedy"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pathologies-of-factorised-gaussian-and-mc","slug":"pathologies-of-factorised-gaussian-and-mc","title":"On the Expressiveness of Approximate Inference in Bayesian Neural Networks","date":"2019-09-02","arxiv_id":"1909.00719","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/pathologies-of-factorised-gaussian-and-mc#ran","syntology_url":"https://syntology.ai/paper/1909.00719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00719"}},"official":{"repos":["cambridge-mlg/expressiveness-approx-bnns"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bayesian-optimisation-over-multiple","slug":"bayesian-optimisation-over-multiple","title":"Bayesian Optimisation over Multiple Continuous and Categorical Inputs","date":"2019-06-20","arxiv_id":"1906.08878","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayesian-optimisation-over-multiple#ran","syntology_url":"https://syntology.ai/paper/1906.08878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08878"}},"official":{"repos":["rubinxin/CoCaBO_code"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/effective-estimation-of-deep-generative","slug":"effective-estimation-of-deep-generative","title":"Effective Estimation of Deep Generative Language Models","date":"2019-04-17","arxiv_id":"1904.08194","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/effective-estimation-of-deep-generative#ran","syntology_url":"https://syntology.ai/paper/1904.08194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08194"}},"official":{"repos":["tom-pelsmaeker/deep-generative-lm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tuning-hyperparameters-without-grad-students","slug":"tuning-hyperparameters-without-grad-students","title":"Tuning Hyperparameters without Grad Students: Scalable and Robust Bayesian Optimisation with Dragonfly","date":"2019-03-15","arxiv_id":"1903.06694","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":3,"n_ran_checked":3,"n_instrument":4,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/tuning-hyperparameters-without-grad-students#ran","syntology_url":"https://syntology.ai/paper/1903.06694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.06694"}},"official":{"repos":["dragonfly/dragonfly"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/asynchronous-batch-bayesian-optimisation-with","slug":"asynchronous-batch-bayesian-optimisation-with","title":"Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation","date":"2019-01-29","arxiv_id":"1901.10452","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/asynchronous-batch-bayesian-optimisation-with#ran","syntology_url":"https://syntology.ai/paper/1901.10452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10452"}},"official":{"repos":["a5a/asynchronous-BO"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-bayesian-experimental-design-for","slug":"efficient-bayesian-experimental-design-for","title":"Efficient Bayesian Experimental Design for Implicit Models","date":"2018-10-23","arxiv_id":"1810.09912","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-bayesian-experimental-design-for#ran","syntology_url":"https://syntology.ai/paper/1810.09912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.09912"}},"official":null}},{"url":"/paper/hyperparameter-learning-via-distributional","slug":"hyperparameter-learning-via-distributional","title":"Hyperparameter Learning via Distributional Transfer","date":"2018-10-15","arxiv_id":"1810.06305","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hyperparameter-learning-via-distributional#ran","syntology_url":"https://syntology.ai/paper/1810.06305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06305"}},"official":null}},{"url":"/paper/neural-architecture-search-with-bayesian","slug":"neural-architecture-search-with-bayesian","title":"Neural Architecture Search with Bayesian Optimisation and Optimal Transport","date":"2018-02-11","arxiv_id":"1802.07191","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-architecture-search-with-bayesian#ran","syntology_url":"https://syntology.ai/paper/1802.07191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.07191"}},"official":{"repos":["kirthevasank/nasbot"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gpflowopt-a-bayesian-optimization-library","slug":"gpflowopt-a-bayesian-optimization-library","title":"GPflowOpt: A Bayesian Optimization Library using TensorFlow","date":"2017-11-10","arxiv_id":"1711.03845","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gpflowopt-a-bayesian-optimization-library#ran","syntology_url":"https://syntology.ai/paper/1711.03845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03845"}},"official":null}},{"url":"/paper/theoretical-analysis-of-bayesian-optimisation","slug":"theoretical-analysis-of-bayesian-optimisation","title":"Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameters","date":"2014-06-30","arxiv_id":"1406.7758","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/theoretical-analysis-of-bayesian-optimisation#ran","syntology_url":"https://syntology.ai/paper/1406.7758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.7758"}},"official":null}}],"record_sha256":"0ba9fa9ec3bee8383ed0a4c010e18513d3705a1310d52ab8566db3444e9af1f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}