Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

0.9%1.9%2.8%3.7% · Jun 202019922001200920172026
48 results for black-box optimisation

New method optimizes black-box functions using generative models and Wasserstein distance.

problem Optimizing black-box functions with stochastic responses in high dimensions.
method Deep generative surrogate models and Wasserstein distance for uncertainty estimation.
result Method outperforms state-of-the-art methods in robustness to function shape and stochasticity.

Bayesian optimisation tackles expensive black-box functions with constraints.

problem Optimizing constrained black-box functions in machine learning and simulation.
method Proposes a new Knowledge Gradient acquisition function for constrained Bayesian optimisation.
result Demonstrates superior performance over four state-of-the-art constrained Bayesian optimisation algorithms.

Optimising black-box functions is important in many disciplines, such as tuning machine learning models, robotics, finance and mining exploration. Bayesian optimisation is a state-of-the-art technique for the global optimisation of black-box functions which are expensive to evaluate. At the core of this approach is a G…

2014-10-27abs ↗pdf ↗

Real world experiments are expensive, and thus it is important to reach a target in minimum number of experiments. Experimental processes often involve control variables that changes over time. Such problems can be formulated as a functional optimisation problem. We develop a novel Bayesian optimisation framework for s…

2018-09-19abs ↗pdf ↗

Bayesian optimisation tackles high-dimensional categorical and mixed search spaces.

problem Bayesian optimisation on high-dimensional categorical and mixed search spaces is challenging.
method Combining local optimisation with a tailored kernel design.
result Empirically outperforms current baselines in performance and computational costs.

Unified Bayesian Optimisation for mixed variables improves performance.

problem Efficient optimisation of problems with both categorical and continuous variables.
method Derive value proposals from the Expected Improvement criterion to optimise both categorical and continuous variables under a single acquisition metric.
result Unified approach significantly outperforms existing methods across mixed-variable tasks.

Improves Bayesian optimisation for engineering design problems with many variables.

problem Efficiently searching for global minima in high-dimensional design spaces.
method Integrates input and output data to identify a reduced latent subspace using probabilistic partial least squares.
result Significant improvements in convergence to the global minimum compared to existing methods.

MBORE optimizes multi-objective problems using density-ratio estimation.

problem Optimizing complex, multi-objective functions with expensive evaluations.
method Extends BORE to multi-objective Bayesian optimisation, using density-ratio estimation.
result MBORE outperforms BO on high-dimensional and real-world problems.

Bayesian optimisation algorithm for unknown search spaces with sub-linear regret.

problem Efficient optimisation of expensive black-box functions in unknown search spaces.
method Expands search space over iterations based on a hyperharmonic series, scales to high dimensions.
result Sub-linear regret growth for both algorithms.

Many expensive black-box optimisation problems are sensitive to their inputs. In these problems it makes more sense to locate a region of good designs, than a single-possibly fragile-optimal design. Expensive black-box functions can be optimised effectively with Bayesian optimisation, where a Gaussian process is a popu…

2019-04-25abs ↗pdf ↗

Efficient optimisation of black-box problems that comprise both continuous and categorical inputs is important, yet poses significant challenges. We propose a new approach, Continuous and Categorical Bayesian Optimisation (CoCaBO), which combines the strengths of multi-armed bandits and Bayesian optimisation to select …

2019-06-20abs ↗pdf ↗

Study improves Bayesian optimisation with ensemble transfer learning.

problem Improving sample efficiency in Bayesian optimisation of expensive functions.
method Empirical analysis of ensemble-based transfer learning methods and pipeline components.
result Two components (warm start initialisation and positive weight constraint) improve transfer learning Bayesian optimisation performance.

Bayesian optimisation framework considers only variable orderings to handle ill-conditioned objectives.

problem Bayesian optimisation fails with ill-conditioned or discontinuous objectives.
method Proposes a new framework that considers only the ordering of variables in input and output spaces, fitting a Gaussian process in a latent space.
result Proves optimal performance under the measure of regret for an optimistic strategy in the latent space.

BOE reformulates BO as a classifier for scalable batch optimisation.

problem Scalable batch optimisation of expensive functions.
method Reformulates BO as density-ratio estimation, removing need for explicit function prior.
result Theoretical guarantees and improved uncertainty estimates for batch optimisation.

The notion of expense in Bayesian optimisation generally refers to the uniformly expensive cost of function evaluations over the whole search space. However, in some scenarios, the cost of evaluation for black-box objective functions is non-uniform since different inputs from search space may incur different costs for …

2019-09-09abs ↗pdf ↗

Many deployed learned models are black boxes: given input, returns output. Internal information about the model, such as the architecture, optimisation procedure, or training data, is not disclosed explicitly as it might contain proprietary information or make the system more vulnerable. This work shows that such attri…

2017-11-06abs ↗pdf ↗

New Bayesian models optimize quantiles and expectiles for stochastic functions.

problem Optimizing for quantiles and expectiles in stochastic functions.
method Proposed variational models and BO strategies for quantile and expectile regression.
result Proposed models and strategies outperform existing methods in heteroscedastic, non-Gaussian settings.

Bandit methods for black-box optimisation, such as Bayesian optimisation, are used in a variety of applications including hyper-parameter tuning and experiment design. Recently, \emph{multi-fidelity} methods have garnered considerable attention since function evaluations have become increasingly expensive in such appli…

2017-03-18abs ↗pdf ↗

Bayesian optimisation is improved by incorporating expert prior through space warping.

problem Cold start phase in expensive function optimisation.
method Prior distribution warps the search space around high probability regions of function optimum.
result Improves optimisation performance through acquisition agnostic approach.

New methods improve global optimisation for expensive functions using lookahead strategies.

problem Optimising expensive functions without gradient info in high dimensions.
method Nonmyopic acquisition strategies based on approximate dynamic programming.
result Nonmyopic methods outperform myopic approaches in various applications.

Bayesian optimisation (BO) is a well-known efficient algorithm for finding the global optimum of expensive, black-box functions. The current practical BO algorithms have regret bounds ranging from O(logNN)\mathcal{O}(\frac{logN}{\sqrt{N}}) to O(eN)\mathcal O(e^{-\sqrt{N}}), where NN is the number of evaluations. This paper exp…

2021-05-10abs ↗pdf ↗

New method optimizes multiple points in Bayesian optimization efficiently.

problem Optimizing multiple points in expensive black-box functions.
method Reformulated BO as probability measure optimization, using convex gradient flows.
result Demonstrated effectiveness on various benchmarks compared to state-of-the-art methods.

New method uses random decompositions for high-dimensional Bayesian optimization.

problem Learning accurate decompositions for high-dimensional black-box functions.
method Data-independent random tree-based decomposition sampling.
result Random decomposition upper-confidence bound algorithm (RDUCB) yields significant empirical gains.

Bayesian optimisation improves with fully-Bayesian treatment of hyperparameters.

problem Overconfident model predictions in BO due to ignoring hyperparameter uncertainty.
method Investigate FBBO using three approximate inference schemes compared to maximum likelihood approach.
result FBBO using EI with an ARD kernel leads to best performance in noise-free setting.

Bayesian optimisation's mean function choice affects convergence speed.

problem The choice of mean function in Bayesian optimisation impacts convergence speed.
method Empirical investigation of 8 mean functions on 10 synthetic and 2 real-world problems.
result Using a constant mean function equal to the worst observed quality value promotes faster convergence.

Techniques known as Nonlinear Set Membership prediction, Kinky Inference or Lipschitz Interpolation are fast and numerically robust approaches to nonparametric machine learning that have been proposed to be utilised in the context of system identification and learning-based control. They utilise presupposed Lipschitz p…

2017-02-28abs ↗pdf ↗

New algorithms minimize noisy, irregular functions without gradients.

problem Minimizing noisy, irregular, and algebraically intractable functions.
method Generalized gradient descent recursion with smooth approximations.
result Convergence results under weak assumptions on function regularity.

Bayesian optimisation method targets graph classification models against adversarial attacks.

problem Adversarial attacks on graph classification models, especially for graph-level tasks.
method Bayesian optimisation-based attack method for graph classification models.
result Effectiveness and flexibility of the proposed method validated on various graph classification tasks.

Paper presents efficient IS for tail risk estimation with machine learning features.

problem Estimating Value at Risk and Conditional Value at Risk with black-box access.
method Efficient Importance Sampling algorithm with self-structuring transformation.
result Asymptotically optimal variance reduction in logarithmic scale.

EDRBO optimizes Bayesian optimization with continuous contexts using ensemble models and robust methods.

problem Bayesian optimization with unknown and continuous contextual distributions leads to suboptimal results.
method EDRBO uses ensemble surrogate models and Wasserstein ball ambiguity sets to handle uncertainty and maintain computational tractability.
result EDRBO achieves sublinear cumulative regret guarantees of order O(γTT)\mathcal{O}(γ_T \sqrt{T}).

Marich extracts high-fidelity models from public data with minimal queries.

problem Creating an accurate replica of a target ML model using few queries.
method Sequentially selects informative queries to maximize entropy and reduce model mismatch.
result Extracted models achieve 60-95% of target model's accuracy with 1,000-8,500 queries.

MVRSM optimizes expensive functions with mixed variables, outperforming state-of-the-art methods.

problem Minimizing expensive functions with mixed continuous and integer variables.
method Mixed-Variable ReLU-based Surrogate Modelling (MVRSM) using rectified linear units.
result MVRSM outperforms state-of-the-art methods on synthetic and real-life benchmarks.

AntBO optimizes antibody design using Bayesian optimization for efficient and effective CDRH3 sequence generation.

problem Designing optimal antigen-specific CDRH3 regions in antibody design due to combinatorial sequence space.
method Combinatorial Bayesian optimization framework with trust region for developability.
result AntBO designs CDRH3 regions with diverse biophysical properties and outperforms existing methods.

This paper explores optimising acquisition functions in Bayesian optimisation.

problem Optimising acquisition functions in Bayesian optimisation is challenging due to their non-convex nature.
method The authors derive compositional forms for acquisition functions and use them to recast maximisation as a compositional optimisation problem.
result The compositional approach to maximising acquisition functions shows empirical advantages across various tasks.

We introduce a unified probabilistic framework for solving sequential decision making problems ranging from Bayesian optimisation to contextual bandits and reinforcement learning. This is accomplished by a probabilistic model-based approach that explains observed data while capturing predictive uncertainty during the d…

2019-03-28abs ↗pdf ↗