{"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","name":"Bayesian Optimisation","slug":"bayesian-optimisation","description_markdown":"Expensive black-box functions are a common problem in many disciplines, including tuning the parameters of machine learning algorithms, robotics, and other engineering design problems. **Bayesian Optimisation** is a principled and efficient technique for the global optimisation of these functions. The idea behind Bayesian Optimisation is to place a prior distribution over the target function and then update that prior with a set of “true” observations of the target function by expensively evaluating it in order to produce a posterior predictive distribution. The posterior then informs where to make the next observation of the target function through the use of an acquisition function, which balances the exploitation of regions known to have good performance with the exploration of regions where there is little information about the function’s response.\r\n\r\n\r\n<span class=\"description-source\">Source: [A Bayesian Approach for the Robust Optimisation of Expensive-to-Evaluate Functions ](https://arxiv.org/abs/1904.11416)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":221,"papers_with_code":97,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":1,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[{"url":"/task/bayesian-optimization","name":"Bayesian Optimization"}],"parent_tasks":[{"url":"/task/bayesian-optimization","name":"Bayesian Optimization"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":3,"rows_per_page":100,"shown":100,"of":221,"of_with_code":97,"tagged_in_all":221,"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"},"items":[{"url":"/paper/max-value-entropy-search-for-efficient","slug":"max-value-entropy-search-for-efficient","title":"Max-value Entropy Search for Efficient Bayesian Optimization","date":"2017-03-06","arxiv_id":"1703.01968","repositories_listed":4,"syntology":null},{"url":"/paper/developing-optimal-causal-cyber-defence","slug":"developing-optimal-causal-cyber-defence","title":"Developing Optimal Causal Cyber-Defence Agents via Cyber Security Simulation","date":"2022-07-25","arxiv_id":"2207.12355","repositories_listed":3,"syntology":null},{"url":"/paper/hebo-heteroscedastic-evolutionary-bayesian","slug":"hebo-heteroscedastic-evolutionary-bayesian","title":"HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisation","date":"2020-12-07","arxiv_id":"2012.03826","repositories_listed":3,"syntology":null},{"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/cheetah-bridging-the-gap-between-machine","slug":"cheetah-bridging-the-gap-between-machine","title":"Cheetah: Bridging the Gap Between Machine Learning and Particle Accelerator Physics with High-Speed, Differentiable Simulations","date":"2024-01-11","arxiv_id":"2401.05815","repositories_listed":2,"syntology":null},{"url":"/paper/end-to-end-meta-bayesian-optimisation-with","slug":"end-to-end-meta-bayesian-optimisation-with","title":"End-to-End Meta-Bayesian Optimisation with Transformer Neural Processes","date":"2023-05-25","arxiv_id":"2305.15930","repositories_listed":2,"syntology":null},{"url":"/paper/are-random-decompositions-all-we-need-in-high","slug":"are-random-decompositions-all-we-need-in-high","title":"Are Random Decompositions all we need in High Dimensional Bayesian Optimisation?","date":"2023-01-30","arxiv_id":"2301.12844","repositories_listed":2,"syntology":null},{"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/high-dimensional-bayesian-optimisation-with","slug":"high-dimensional-bayesian-optimisation-with","title":"High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learning","date":"2021-06-07","arxiv_id":"2106.03609","repositories_listed":2,"syntology":null},{"url":"/paper/neural-architecture-generator-optimization","slug":"neural-architecture-generator-optimization","title":"Neural Architecture Generator Optimization","date":"2020-04-03","arxiv_id":"2004.01395","repositories_listed":2,"syntology":null},{"url":"/paper/botorch-programmable-bayesian-optimization-in","slug":"botorch-programmable-bayesian-optimization-in","title":"BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization","date":"2019-10-14","arxiv_id":"1910.06403","repositories_listed":2,"syntology":null},{"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/bayesian-optimisation-for-fast-approximate","slug":"bayesian-optimisation-for-fast-approximate","title":"Bayesian optimisation for fast approximate inference in state-space models with intractable likelihoods","date":"2015-06-23","arxiv_id":"1506.06975","repositories_listed":2,"syntology":null},{"url":"/paper/nested-expectations-with-kernel-quadrature","slug":"nested-expectations-with-kernel-quadrature","title":"Nested Expectations with Kernel Quadrature","date":"2025-02-25","arxiv_id":"2502.18284","repositories_listed":1,"syntology":null},{"url":"/paper/mean-field-bayesian-optimisation","slug":"mean-field-bayesian-optimisation","title":"Mean-Field Bayesian Optimisation","date":"2025-02-17","arxiv_id":"2502.12315","repositories_listed":1,"syntology":null},{"url":"/paper/nonmyopic-global-optimisation-via-approximate","slug":"nonmyopic-global-optimisation-via-approximate","title":"Nonmyopic Global Optimisation via Approximate Dynamic Programming","date":"2024-12-06","arxiv_id":"2412.04882","repositories_listed":1,"syntology":null},{"url":"/paper/residual-deep-gaussian-processes-on-manifolds","slug":"residual-deep-gaussian-processes-on-manifolds","title":"Residual Deep Gaussian Processes on Manifolds","date":"2024-10-31","arxiv_id":"2411.00161","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-representations-for-accurate-causal","slug":"spectral-representations-for-accurate-causal","title":"Spectral Representations for Accurate Causal Uncertainty Quantification with Gaussian Processes","date":"2024-10-18","arxiv_id":"2410.14483","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimisation-with-unknown","slug":"bayesian-optimisation-with-unknown","title":"Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal","date":"2024-10-14","arxiv_id":"2410.10384","repositories_listed":1,"syntology":null},{"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":2,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":9,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 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":2,"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":5,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 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":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/personalized-llm-response-generation-with","slug":"personalized-llm-response-generation-with","title":"Personalized LLM Response Generation with Parameterized Memory Injection","date":"2024-04-04","arxiv_id":"2404.03565","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-development-of-a-practical-bayesian","slug":"on-the-development-of-a-practical-bayesian","title":"On the development of a practical Bayesian optimisation algorithm for expensive experiments and simulations with changing environmental conditions","date":"2024-02-05","arxiv_id":"2402.03006","repositories_listed":1,"syntology":null},{"url":"/paper/automated-machine-learning-for-positive","slug":"automated-machine-learning-for-positive","title":"Automated Machine Learning for Positive-Unlabelled Learning","date":"2024-01-12","arxiv_id":"2401.06452","repositories_listed":1,"syntology":null},{"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":3,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 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; 3 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":3,"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/bayesian-optimisation-against-climate-change","slug":"bayesian-optimisation-against-climate-change","title":"Bayesian Optimisation Against Climate Change: Applications and Benchmarks","date":"2023-06-07","arxiv_id":"2306.04343","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-do-or-learning-while-doing","slug":"learning-to-do-or-learning-while-doing","title":"Learning to Do or Learning While Doing: Reinforcement Learning and Bayesian Optimisation for Online Continuous Tuning","date":"2023-06-06","arxiv_id":"2306.03739","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-optimization-using-the-r2","slug":"multi-objective-optimization-using-the-r2","title":"Multi-objective optimisation via the R2 utilities","date":"2023-05-19","arxiv_id":"2305.11774","repositories_listed":1,"syntology":null},{"url":"/paper/nubo-a-transparent-python-package-for","slug":"nubo-a-transparent-python-package-for","title":"NUBO: A Transparent Python Package for Bayesian Optimization","date":"2023-05-11","arxiv_id":"2305.06709","repositories_listed":1,"syntology":null},{"url":"/paper/applications-of-gaussian-processes-at-extreme","slug":"applications-of-gaussian-processes-at-extreme","title":"Applications of Gaussian Processes at Extreme Lengthscales: From Molecules to Black Holes","date":"2023-03-24","arxiv_id":"2303.14291","repositories_listed":1,"syntology":null},{"url":"/paper/protein-sequence-design-with-batch-bayesian","slug":"protein-sequence-design-with-batch-bayesian","title":"Protein Sequence Design with Batch Bayesian Optimisation","date":"2023-03-18","arxiv_id":"2303.10429","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-human-and-non-human-vocal","slug":"detecting-human-and-non-human-vocal","title":"Detection and classification of vocal productions in large scale audio recordings","date":"2023-02-14","arxiv_id":"2302.07640","repositories_listed":1,"syntology":null},{"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":7,"n_instrument":4,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":4,"n_pointer_only":13,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 4 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":7,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/sober-scalable-batch-bayesian-optimization","slug":"sober-scalable-batch-bayesian-optimization","title":"SOBER: Highly Parallel Bayesian Optimization and Bayesian Quadrature over Discrete and Mixed Spaces","date":"2023-01-27","arxiv_id":"2301.11832","repositories_listed":1,"syntology":null},{"url":"/paper/policy-learning-for-many-outcomes-of-interest","slug":"policy-learning-for-many-outcomes-of-interest","title":"Policy learning for many outcomes of interest: Combining optimal policy trees with multi-objective Bayesian optimisation","date":"2022-12-13","arxiv_id":"2212.06312","repositories_listed":1,"syntology":null},{"url":"/paper/batch-bayesian-optimisation-via-density-ratio","slug":"batch-bayesian-optimisation-via-density-ratio","title":"Batch Bayesian optimisation via density-ratio estimation with guarantees","date":"2022-09-22","arxiv_id":"2209.10715","repositories_listed":1,"syntology":null},{"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/the-case-for-fully-bayesian-optimisation-in","slug":"the-case-for-fully-bayesian-optimisation-in","title":"The case for fully Bayesian optimisation in small-sample trials","date":"2022-08-30","arxiv_id":"2208.13960","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-trading-algorithm-in-simulated","slug":"learning-the-trading-algorithm-in-simulated","title":"Nonstationary Continuum-Armed Bandit Strategies for Automated Trading in a Simulated Financial Market","date":"2022-08-04","arxiv_id":"2208.02901","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-development-of-a-bayesian-optimisation","slug":"on-the-development-of-a-bayesian-optimisation","title":"Investigating Bayesian optimization for expensive-to-evaluate black box functions: Application in fluid dynamics","date":"2022-07-19","arxiv_id":"2207.09154","repositories_listed":1,"syntology":null},{"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/neural-diffusion-processes","slug":"neural-diffusion-processes","title":"Neural Diffusion Processes","date":"2022-06-08","arxiv_id":"2206.03992","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-learning-of-effective-chemical","slug":"bayesian-learning-of-effective-chemical","title":"Bayesian learning of effective chemical master equations in crowded intracellular conditions","date":"2022-05-11","arxiv_id":"2205.06268","repositories_listed":1,"syntology":null},{"url":"/paper/mbore-multi-objective-bayesian-optimisation","slug":"mbore-multi-objective-bayesian-optimisation","title":"MBORE: Multi-objective Bayesian Optimisation by Density-Ratio Estimation","date":"2022-03-31","arxiv_id":"2203.16912","repositories_listed":1,"syntology":null},{"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/antbo-towards-real-world-automated-antibody","slug":"antbo-towards-real-world-automated-antibody","title":"AntBO: Towards Real-World Automated Antibody Design with Combinatorial Bayesian Optimisation","date":"2022-01-29","arxiv_id":"2201.12570","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-graph-classifiers-via","slug":"adversarial-attacks-on-graph-classifiers-via","title":"Adversarial Attacks on Graph Classifiers via Bayesian Optimisation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/kernel-functional-optimisation","slug":"kernel-functional-optimisation","title":"Kernel Functional Optimisation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparse-adversarial-video-attacks-with-spatial","slug":"sparse-adversarial-video-attacks-with-spatial","title":"Sparse Adversarial Video Attacks with Spatial Transformations","date":"2021-11-10","arxiv_id":"2111.05468","repositories_listed":1,"syntology":null},{"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/bayesian-optimisation-for-sequential","slug":"bayesian-optimisation-for-sequential","title":"Bayesian Optimisation for Sequential Experimental Design with Applications in Additive Manufacturing","date":"2021-07-27","arxiv_id":"2107.12809","repositories_listed":1,"syntology":null},{"url":"/paper/neuroadaptive-electroencephalography-a-proof","slug":"neuroadaptive-electroencephalography-a-proof","title":"Neuroadaptive electroencephalography: a proof-of-principle study in infants","date":"2021-06-10","arxiv_id":"2106.06029","repositories_listed":1,"syntology":null},{"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/benchmarking-the-performance-of-bayesian","slug":"benchmarking-the-performance-of-bayesian","title":"Benchmarking the Performance of Bayesian Optimization across Multiple Experimental Materials Science Domains","date":"2021-05-23","arxiv_id":"2106.01309","repositories_listed":1,"syntology":null},{"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/how-bayesian-should-bayesian-optimisation-be","slug":"how-bayesian-should-bayesian-optimisation-be","title":"How Bayesian Should Bayesian Optimisation Be?","date":"2021-05-03","arxiv_id":"2105.00894","repositories_listed":1,"syntology":null},{"url":"/paper/octis-comparing-and-optimizing-topic-models","slug":"octis-comparing-and-optimizing-topic-models","title":"OCTIS: Comparing and Optimizing Topic models is Simple!","date":"2021-04-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/think-global-and-act-local-bayesian","slug":"think-global-and-act-local-bayesian","title":"Think Global and Act Local: Bayesian Optimisation over High-Dimensional Categorical and Mixed Search Spaces","date":"2021-02-14","arxiv_id":"2102.07188","repositories_listed":1,"syntology":null},{"url":"/paper/rapidly-adapting-robot-swarms-with-swarm-map","slug":"rapidly-adapting-robot-swarms-with-swarm-map","title":"Rapidly adapting robot swarms with Swarm Map-based Bayesian Optimisation","date":"2020-12-21","arxiv_id":"2012.11444","repositories_listed":1,"syntology":null},{"url":"/paper/are-we-forgetting-about-compositional","slug":"are-we-forgetting-about-compositional","title":"Are we Forgetting about Compositional Optimisers in Bayesian Optimisation?","date":"2020-12-15","arxiv_id":"2012.08240","repositories_listed":1,"syntology":null},{"url":"/paper/diversity-guided-multi-objective-bayesian","slug":"diversity-guided-multi-objective-bayesian","title":"Diversity-Guided Multi-Objective Bayesian Optimization With Batch Evaluations","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/asynchronous-e-greedy-bayesian-optimisation","slug":"asynchronous-e-greedy-bayesian-optimisation","title":"Asynchronous ε-Greedy Bayesian Optimisation","date":"2020-10-15","arxiv_id":"2010.07615","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-bayesian-optimisation-and","slug":"multi-objective-bayesian-optimisation-and","title":"Multi-Objective Bayesian Optimisation and Joint Inversion for Active Sensor Fusion","date":"2020-10-12","arxiv_id":"2010.05386","repositories_listed":1,"syntology":null},{"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/bayesopt-adversarial-attack","slug":"bayesopt-adversarial-attack","title":"BayesOpt Adversarial Attack","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/-shotgun-greedy-batch-bayesian-optimisation","slug":"-shotgun-greedy-batch-bayesian-optimisation","title":"$ε$-shotgun: $ε$-greedy Batch Bayesian Optimisation","date":"2020-02-05","arxiv_id":"2002.01873","repositories_listed":1,"syntology":null},{"url":"/paper/max-value-entropy-search-for-multi-objective","slug":"max-value-entropy-search-for-multi-objective","title":"Max-value Entropy Search for Multi-Objective Bayesian Optimization","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":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/interactive-text-ranking-with-bayesian","slug":"interactive-text-ranking-with-bayesian","title":"Interactive Text Ranking with Bayesian Optimisation: A Case Study on Community QA and Summarisation","date":"2019-11-22","arxiv_id":"1911.10183","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-robustness-to-aleatoric-uncertainty","slug":"achieving-robustness-to-aleatoric-uncertainty","title":"Achieving Robustness to Aleatoric Uncertainty with Heteroscedastic Bayesian Optimisation","date":"2019-10-17","arxiv_id":"1910.07779","repositories_listed":1,"syntology":null},{"url":"/paper/distributional-bayesian-optimisation-for","slug":"distributional-bayesian-optimisation-for","title":"Distributional Bayesian optimisation for variational inference on black-box simulators","date":"2019-10-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-reliable-architecture-selection-for","slug":"fast-and-reliable-architecture-selection-for","title":"Fast and Reliable Architecture Selection for Convolutional Neural Networks","date":"2019-05-06","arxiv_id":"1905.01924","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-gaussian-process-surrogate-method-to","slug":"parallel-gaussian-process-surrogate-method-to","title":"Parallel Gaussian process surrogate Bayesian inference with noisy likelihood evaluations","date":"2019-05-03","arxiv_id":"1905.01252","repositories_listed":1,"syntology":null},{"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/gaussian-process-priors-for-dynamic-paired","slug":"gaussian-process-priors-for-dynamic-paired","title":"Gaussian Process Priors for Dynamic Paired Comparison Modelling","date":"2019-02-20","arxiv_id":"1902.07378","repositories_listed":1,"syntology":null},{"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/fitting-a-mixture-distribution-to-data","slug":"fitting-a-mixture-distribution-to-data","title":"Fitting A Mixture Distribution to Data: Tutorial","date":"2019-01-20","arxiv_id":"1901.06708","repositories_listed":1,"syntology":null},{"url":"/paper/batch-selection-for-parallelisation-of","slug":"batch-selection-for-parallelisation-of","title":"Batch Selection for Parallelisation of Bayesian Quadrature","date":"2018-12-04","arxiv_id":"1812.01553","repositories_listed":1,"syntology":null},{"url":"/paper/algorithmic-assurance-an-active-approach-to","slug":"algorithmic-assurance-an-active-approach-to","title":"Algorithmic Assurance: An Active Approach to Algorithmic Testing using Bayesian Optimisation","date":"2018-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/fast-information-theoretic-bayesian","slug":"fast-information-theoretic-bayesian","title":"Fast Information-theoretic Bayesian Optimisation","date":"2017-11-02","arxiv_id":"1711.00673","repositories_listed":1,"syntology":null},{"url":"/paper/generalising-random-forest-parameter","slug":"generalising-random-forest-parameter","title":"Generalising Random Forest Parameter Optimisation to Include Stability and Cost","date":"2017-06-29","arxiv_id":"1706.09865","repositories_listed":1,"syntology":null},{"url":"/paper/asynchronous-parallel-bayesian-optimisation","slug":"asynchronous-parallel-bayesian-optimisation","title":"Asynchronous Parallel Bayesian Optimisation via Thompson Sampling","date":"2017-05-25","arxiv_id":"1705.09236","repositories_listed":1,"syntology":null},{"url":"/paper/batch-bayesian-optimization-via-local","slug":"batch-bayesian-optimization-via-local","title":"Batch Bayesian Optimization via Local Penalization","date":"2015-05-29","arxiv_id":"1505.08052","repositories_listed":1,"syntology":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}},{"url":null,"slug":"modelling-the-effects-of-hearing-loss-on","title":"Modelling the Effects of Hearing Loss on Neural Coding in the Auditory Midbrain with Variational Conditioning","date":"2025-06-03","arxiv_id":"2506.03088","repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-reasoning-navigating-solution-spaces-in","title":"Soft Reasoning: Navigating Solution Spaces in Large Language Models through Controlled Embedding Exploration","date":"2025-05-30","arxiv_id":"2505.24688","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-based-regional-cooling","title":"Machine Learning-based Regional Cooling Demand Prediction with Optimised Dataset Partitioning","date":"2025-03-04","arxiv_id":"2503.05813","repositories_listed":0,"syntology":null}],"syntology_records":31,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":31,"papers_where_code_ran_first_page":"/task/bayesian-optimisation/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":3,"url":"/task/bayesian-optimisation/papers/2","json":"/task/bayesian-optimisation/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/bayesian-optimisation/papers/3","json":"/task/bayesian-optimisation/papers/3.json","rows":21},{"order":"ran","page":1,"of":1,"url":"/task/bayesian-optimisation/papers/ran/1","json":"/task/bayesian-optimisation/papers/ran/1.json","rows":31}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"b7608b2e0348389dd3568dc7b34ffe033ba9e95ebc5d0fee7f76f908661eb766","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}