Bayesian Optimisation vs. Input Uncertainty Reduction
نویسندگان
چکیده
Simulators often require calibration inputs estimated from real-world data, and the estimate can significantly affect simulation output. Particularly when performing optimisation to find an optimal solution, uncertainty in affects quality of found solution. One remedy is search for solution that has best performance on average over uncertain range yielding compromise We consider more general setting where a user may choose between either running simulations or querying external data source, improving input enabling targeted, less compromised explicitly examine trade-off real collection simulator with true inputs. Using value information procedure, we propose novel unified procedure called Bayesian Information Collection Optimisation that, each iteration, automatically determines which two actions (running collection) beneficial. theoretically prove convergence infinite budget limit perform numerical experiments demonstrating proposed algorithm able determine appropriate balance collection.
منابع مشابه
Bayesian Optimisation for Safe Navigation under Localisation Uncertainty
In outdoor environments, mobile robots are required to navigate through terrain with varying characteristics, some of which might significantly affect the integrity of the platform. Ideally, the robot should be able to identify areas that are safe for navigation based on its own percepts about the environment while avoiding damage to itself. Bayesian optimisation (BO) has been successfully appl...
متن کاملHeteroscedastic Treed Bayesian Optimisation
We propose new hierarchical models and estimation techniques to solve the problem of heteroscedasticity in Bayesian optimisation. Our results demonstrate substantial gains in a wide range of applications, including automatic machine learning and mining exploration.
متن کاملBayesian Optimisation with Continuous Approximations
To present the theoretical results for GP-UCB, we begin by defining the Maximum Information Gain (MIG) which characterises the statistical difficulty of GP bandits. Definition 2. (Maximum Information Gain (Srinivas et al., 2010)) Let f ∼ GP(0, φX ). Consider any A ⊂ R and let A′ = {x1, . . . , xn} ⊂ A be a finite subset. Let fA′ , A′ ∈ R such that (fA′)i = f(xi) and ( A′)i ∼ N (0, η). Let yA′ =...
متن کاملBayesian Optimisation for Machine Translation
This paper presents novel Bayesian optimisation algorithms for minimum error rate training of statistical machine translation systems. We explore two classes of algorithms for efficiently exploring the translation space, with the first based on N-best lists and the second based on a hypergraph representation that compactly represents an exponential number of translation options. Our algorithms ...
متن کاملModelling pesticide leaching under climate change: parameter vs. climate input uncertainty
Assessing climate change impacts on pesticide leaching requires careful consideration of different sources of uncertainty. We investigated the uncertainty related to climate scenario input and its importance relative to parameter uncertainty of the pesticide leaching model. The pesticide fate model MACRO was calibrated against a comprehensive one-year field data set for a well-structured clay s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Modeling and Computer Simulation
سال: 2022
ISSN: ['1049-3301', '1558-1195']
DOI: https://doi.org/10.1145/3510380