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

14284256 · Jun 202019922001200920172026
48 results for compositional optimisation

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.

AVATAR uses a surrogate model to quickly evaluate ML pipelines, saving time and resources.

problem Time-consuming evaluation of ML pipelines limits exploration of complex models.
method AVATAR employs a surrogate model to assess pipeline validity without execution.
result AVATAR accelerates ML pipeline evaluation, improving efficiency in complex scenarios.

Paper proves multiplicative weight updates can train neural networks without learning rate tuning.

problem Vanishing and exploding gradients in gradient descent for compositional functions.
method Proves descent lemma for compositional functions using multiplicative weight updates and derives Madam optimizer.
result Madam optimizer trains state-of-the-art neural networks without learning rate tuning.

In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Fo…

2015-02-11abs ↗pdf ↗

A new framework uses an Incremental Transformer to design geopolymer mixtures efficiently.

problem Designing geopolymer mixtures with limited data and physical constraints.
method Topology-aware surrogate framework guided by Incremental Transformer.
result The design space is redundant, with fewer effective mixture regimes.

HydaLearn dynamically adjusts task weights for better MTL performance.

problem Constant loss weights in MTL lead to poor results due to drifting relevance and varying mini-batch composition.
method HydaLearn uses mini-batch gradients to dynamically adjust task weights.
result HydaLearn improves performance on synthetic and real-world data.

Compact models for methane/air combustion reduce complexity without sacrificing accuracy.

problem Creating accurate, computationally efficient models for methane combustion.
method Data-oriented three-step methodology: 1) Remove non-essential species, 2) Numerically optimize to key species profiles, 3) Machine learning to refine parameters.
result Produced 19 and 15 species compact models that outperform current state-of-the-art models in accuracy and range of conditions.

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.

A new method learns priors for Bayesian optimisation to improve performance.

problem Bayesian optimisation tasks often assume strong similarity, which is violated in many cases.
method Replace strong similarity assumption with shape similarity, learn priors for hyperparameters.
result PLeBO and prior transfer find good inputs in fewer evaluations.

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.

Wind farm layout optimisation tackles space constraints with Bayesian multi-objective approach.

problem Optimizing wind farm layout due to limited space and conflicting objectives.
method Set-based multi-objective Bayesian optimisation using Gaussian process.
result Demonstrates potential of set-based Bayesian multi-objective optimisation for wind farm layout.

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.

A new optimisation method efficiently scales Hessian-vector products for neural networks.

problem Challenges in applying second-order quasi-Newton methods due to large Hessian and non-convexity.
method Proposes an optimisation algorithm that asymptotically uses the exact inverse Hessian with modified eigenvalues.
result Demonstrates scalability and comparable performance to other optimisation methods in neural networks.

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.

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 ↗

Information-theoretic Bayesian optimisation techniques have demonstrated state-of-the-art performance in tackling important global optimisation problems. However, current information-theoretic approaches require many approximations in implementation, introduce often-prohibitive computational overhead and limit the choi…

2017-11-02abs ↗pdf ↗

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.

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.

One-pass optimisation for high-dimensional hyperparameters.

problem Efficient optimisation of hyperparameters in machine learning models.
method Approximate hypergradient-based optimisation for any continuous hyperparameter, requiring only one training episode.
result Competitive performance on various datasets without hyperparameter restarts.

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.

We present an efficient block-diagonal ap- proximation to the Gauss-Newton matrix for feedforward neural networks. Our result- ing algorithm is competitive against state- of-the-art first order optimisation methods, with sometimes significant improvement in optimisation performance. Unlike first-order methods, for whic…

2017-06-12abs ↗pdf ↗

Study reveals a universal formula for knotting in random equilateral polygons.

problem Probability of knotting in equilateral random polygons.
method Extensive Monte Carlo simulations with improved algorithms and knot invariants.
result A universal scaling formula for knotting probability with number of edges, involving exponential and power law factors.

New approach separates VAE and GP for better molecular optimisation.

problem Optimizing complex structured domains like molecular spaces using VAEs.
method Decouples VAE for structure generation and GP for predictive modelling, combining them with a Bayesian update rule.
result Improves identification of high-potential candidates in molecular optimisation.

Optimizes data power control in cell-free networks for better spectral efficiency.

problem Maximizing overall spectral efficiency in cell-free networks with multi-objective optimisation.
method Applied scalable multi-objective Bayesian optimisation to solve convergence-time limitations.
result Improved radio resource management in cell-free networks.

Novel algorithms for entropic optimal transport from an optimisation perspective.

problem Solving the entropic-regularised optimal transport problem.
method Developed novel methods inspired by mirror descent, solving semi-dual problems or non-convex constrained problems over joint distributions.
result Non-asymptotic rates of convergence for the proposed methods under minimal assumptions.

A simplified model for fixed income portfolio optimisation.

problem Modeling interest rates and credit risk in fixed income portfolios.
method Proposes a two-factor model for the time evolution of the efficient frontier.
result The efficient frontier is mainly controlled by linear constraints, with standard deviation less important.

TomOpt optimizes muon detector designs using differentiable programming.

problem Designing efficient particle detectors for muon tomography.
method Differentiable programming for muon interaction modeling, inference, and optimisation.
result Demonstrated end-to-end differentiable and inference-aware optimisation of particle physics instruments.

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 ↗