Search Results for author: Juergen Branke

Found 23 papers, 6 papers with code

Bayesian Optimization of Bilevel Problems

no code implementations24 Dec 2024 Omer Ekmekcioglu, Nursen Aydin, Juergen Branke

Bilevel optimization, a hierarchical mathematical framework where one optimization problem is nested within another, has emerged as a powerful tool for modeling complex decision-making processes in various fields such as economics, engineering, and machine learning.

Bayesian Optimization Bilevel Optimization +3

Respecting the limit:Bayesian optimization with a bound on the optimal value

no code implementations7 Nov 2024 HanYang Wang, Juergen Branke, Matthias Poloczek

In many real-world optimization problems, we have prior information about what objective function values are achievable.

Bayesian Optimization

Identifying the Best Arm in the Presence of Global Environment Shifts

no code implementations22 Aug 2024 Phurinut Srisawad, Juergen Branke, Long Tran-Thanh

This paper formulates a new Best-Arm Identification problem in the non-stationary stochastic bandits setting, where the means of all arms are shifted in the same way due to a global influence of the environment.

Clustering in Dynamic Environments: A Framework for Benchmark Dataset Generation With Heterogeneous Changes

1 code implementation24 Feb 2024 Danial Yazdani, Juergen Branke, Mohammad Sadegh Khorshidi, Mohammad Nabi Omidvar, XiaoDong Li, Amir H. Gandomi, Xin Yao

Clustering in dynamic environments is of increasing importance, with broad applications ranging from real-time data analysis and online unsupervised learning to dynamic facility location problems.

Clustering Dataset Generation

Generating a Graph Colouring Heuristic with Deep Q-Learning and Graph Neural Networks

1 code implementation8 Apr 2023 George Watkins, Giovanni Montana, Juergen Branke

The graph colouring problem consists of assigning labels, or colours, to the vertices of a graph such that no two adjacent vertices share the same colour.

Deep Reinforcement Learning Graph Neural Network +2

Knowledge Gradient for Multi-Objective Bayesian Optimization with Decoupled Evaluations

no code implementations2 Feb 2023 Jack M. Buckingham, Sebastian Rojas Gonzalez, Juergen Branke

Multi-objective Bayesian optimization aims to find the Pareto front of trade-offs between a set of expensive objectives while collecting as few samples as possible.

Bayesian Optimization

Efficient computation of the Knowledge Gradient for Bayesian Optimization

no code implementations30 Sep 2022 Juan Ungredda, Michael Pearce, Juergen Branke

Bayesian optimization is a powerful collection of methods for optimizing stochastic expensive black box functions.

Bayesian Optimization

Bi-objective Ranking and Selection Using Stochastic Kriging

no code implementations5 Sep 2022 Sebastian Rojas Gonzalez, Juergen Branke, Inneke Van Nieuwenhuyse

We consider bi-objective ranking and selection problems, where the goal is to correctly identify the Pareto optimal solutions among a finite set of candidates for which the two objective outcomes have been observed with uncertainty (e. g., after running a multiobjective stochastic simulation optimization procedure).

Tackling Neural Architecture Search With Quality Diversity Optimization

1 code implementation30 Jul 2022 Lennart Schneider, Florian Pfisterer, Paul Kent, Juergen Branke, Bernd Bischl, Janek Thomas

Although considerable progress has been made in the field of multi-objective NAS, we argue that there is some discrepancy between the actual optimization problem of practical interest and the optimization problem that multi-objective NAS tries to solve.

Diversity Neural Architecture Search

Generating Large-scale Dynamic Optimization Problem Instances Using the Generalized Moving Peaks Benchmark

1 code implementation23 Jul 2021 Mohammad Nabi Omidvar, Danial Yazdani, Juergen Branke, XiaoDong Li, Shengxiang Yang, Xin Yao

This document describes the generalized moving peaks benchmark (GMPB) and how it can be used to generate problem instances for continuous large-scale dynamic optimization problems.

Competition on Dynamic Optimization Problems Generated by Generalized Moving Peaks Benchmark (GMPB)

1 code implementation11 Jun 2021 Danial Yazdani, Michalis Mavrovouniotis, Changhe Li, Guoyu Chen, Wenjian Luo, Mohammad Nabi Omidvar, Juergen Branke, Shengxiang Yang, Xin Yao

The Generalized Moving Peaks Benchmark (GMPB) is a tool for generating continuous dynamic optimization problem instances with controllable dynamic and morphological characteristics.

Bayesian Optimisation for Constrained Problems

no code implementations27 May 2021 Juan Ungredda, Juergen Branke

Many real-world optimisation problems such as hyperparameter tuning in machine learning or simulation-based optimisation can be formulated as expensive-to-evaluate black-box functions.

Bayesian Optimisation

One Step Preference Elicitation in Multi-Objective Bayesian Optimization

no code implementations27 May 2021 Juan Ungredda, Mariapia Marchi, Teresa Montrone, Juergen Branke

We address this issue by using a multi-objective Bayesian optimization algorithm and allowing the DM to select a preferred solution from a predicted continuous Pareto front just once before the end of the algorithm rather than selecting a solution after the end.

Bayesian Optimization

Reproducibility in Evolutionary Computation

no code implementations5 Feb 2021 Manuel López-Ibáñez, Juergen Branke, Luís Paquete

Experimental studies are prevalent in Evolutionary Computation (EC), and concerns about the reproducibility and replicability of such studies have increased in recent times, reflecting similar concerns in other scientific fields.

Exploiting Transitivity for Top-k Selection with Score-Based Dueling Bandits

no code implementations31 Dec 2020 Matthew Groves, Juergen Branke

We extend this to selection problems where sampling results contain quantitative information by proposing a Thurstonian style model and adapting the Pairwise Optimal Computing Budget Allocation for subset selection (POCBAm) sampling method to exploit this model for efficient sample selection.

Bayesian Optimisation vs. Input Uncertainty Reduction

no code implementations31 May 2020 Juan Ungredda, Michael Pearce, Juergen Branke

Particularly when performing simulation optimisation to find an optimal solution, the uncertainty in the inputs significantly affects the quality of the found solution.

Bayesian Optimisation

BOP-Elites, a Bayesian Optimisation algorithm for Quality-Diversity search

no code implementations8 May 2020 Paul Kent, Juergen Branke

Quality Diversity (QD) algorithms such as MAP-Elites are a class of optimisation techniques that attempt to find a set of high-performing points from an objective function while enforcing behavioural diversity of the points over one or more interpretable, user chosen, feature functions.

Bayesian Optimisation Diversity +1

Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems

no code implementations20 Nov 2019 Jordan MacLachlan, Yi Mei, Juergen Branke, Mengjie Zhang

Due to its direct relevance to post-disaster operations, meter reading and civil refuse collection, the Uncertain Capacitated Arc Routing Problem (UCARP) is an important optimisation problem.

ARC Meter Reading

Bayesian Optimization Allowing for Common Random Numbers

no code implementations21 Oct 2019 Michael Pearce, Matthias Poloczek, Juergen Branke

Bayesian optimization is a powerful tool for expensive stochastic black-box optimization problems such as simulation-based optimization or machine learning hyperparameter tuning.

Bayesian Optimization BIG-bench Machine Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.