Zobrazeno 1 - 10
of 957
pro vyhledávání: '"Ibáñez, Manuel"'
Autor:
Pricopie, Stefan, Allmendinger, Richard, Lopez-Ibanez, Manuel, Fare, Clyde, Benatan, Matt, Knowles, Joshua
We investigate modifications to Bayesian Optimization for a resource-constrained setting of sequential experimental design where changes to certain design variables of the search space incur a switching cost. This models the scenario where there is a
Externí odkaz:
http://arxiv.org/abs/2405.08973
Publikováno v:
IEEE Transactions on Evolutionary Computation (2024)
A widely accepted way to assess the performance of iterative black-box optimizers is to analyze their empirical cumulative distribution function (ECDF) of pre-defined quality targets achieved not later than a given runtime. In this work, we consider
Externí odkaz:
http://arxiv.org/abs/2404.02031
Autor:
Rudich, Isaac, Cappart, Quentin, López-Ibáñez, Manuel, Römer, Michael, Rousseau, Louis-Martin
Many real-world scenarios involve solving bi-level optimization problems in which there is an outer discrete optimization problem, and an inner problem involving expensive or black-box computation. This arises in space-time dependent variants of the
Externí odkaz:
http://arxiv.org/abs/2312.01404
Autor:
Vermetten, Diederick, López-Ibáñez, Manuel, Mersmann, Olaf, Allmendinger, Richard, Kononova, Anna V.
Box-constraints limit the domain of decision variables and are common in real-world optimization problems, for example, due to physical, natural or spatial limitations. Consequently, solutions violating a box-constraint may not be evaluable. This ass
Externí odkaz:
http://arxiv.org/abs/2305.15102
Autor:
Ayodele, Mayowa, Allmendinger, Richard, López-Ibáñez, Manuel, Liefooghe, Arnaud, Parizy, Matthieu
Multi-objective optimisation problems involve finding solutions with varying trade-offs between multiple and often conflicting objectives. Ising machines are physical devices that aim to find the absolute or approximate ground states of an Ising mode
Externí odkaz:
http://arxiv.org/abs/2305.11648
Most multi-objective optimisation algorithms maintain an archive explicitly or implicitly during their search. Such an archive can be solely used to store high-quality solutions presented to the decision maker, but in many cases may participate in th
Externí odkaz:
http://arxiv.org/abs/2303.09685
In recent years, there has been significant research interest in solving Quadratic Unconstrained Binary Optimisation (QUBO) problems. Physics-inspired optimisation algorithms have been proposed for deriving optimal or sub-optimal solutions to QUBOs.
Externí odkaz:
http://arxiv.org/abs/2210.11321
Autor:
Trajanov, Risto, Nikolikj, Ana, Cenikj, Gjorgjina, Teytaud, Fabien, Videau, Mathurin, Teytaud, Olivier, Eftimov, Tome, López-Ibáñez, Manuel, Doerr, Carola
Algorithm selection wizards are effective and versatile tools that automatically select an optimization algorithm given high-level information about the problem and available computational resources, such as number and type of decision variables, max
Externí odkaz:
http://arxiv.org/abs/2209.04412
In multi-objective optimization problems, there might exist hidden objectives that are important to the decision-maker but are not being optimized. On the other hand, there might also exist irrelevant objectives that are being optimized but are of le
Externí odkaz:
http://arxiv.org/abs/2206.01320
Quantum and quantum-inspired optimisation algorithms are designed to solve problems represented in binary, quadratic and unconstrained form. Combinatorial optimisation problems are therefore often formulated as Quadratic Unconstrained Binary Optimisa
Externí odkaz:
http://arxiv.org/abs/2205.13399