{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":97,"tagged_in_all":221,"items":[{"url":"/paper/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","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","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","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_unverified":1,"n_pointer_only":1}},{"url":"/paper/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","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","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","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":0,"n_unverified":10,"n_pointer_only":0}},{"url":"/paper/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","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","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","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":1,"n_unverified":12,"n_pointer_only":0}},{"url":"/paper/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":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/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","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","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","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","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","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/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":3,"n_unverified":6,"n_pointer_only":9}},{"url":"/paper/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/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_unverified":4,"n_pointer_only":0}},{"url":"/paper/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","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","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","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_unverified":4,"n_pointer_only":0}},{"url":"/paper/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_unverified":0,"n_pointer_only":3}},{"url":"/paper/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_unverified":0,"n_pointer_only":2}},{"url":"/paper/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_unverified":4,"n_pointer_only":0}},{"url":"/paper/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_unverified":0,"n_pointer_only":1}}],"syntology_records":11,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}