Lecture
Joint Lectures on Evolutionary Algorithms (JoLEA)
- Date
- Wednesday 19 April 2023
- Time
- Location
- Online
Multi-Objective Learning using Hypervolume Maximization - Monika Grewal
Real-world problems are often multi-objective, with decision-makers unable to specify a priori which trade-off between the conflicting objectives is preferable. Intuitively, building machine learning solutions in such cases would entail providing multiple predictions that span and uniformly cover the Pareto front of all optimal trade-off solutions. We propose a novel approach for multi-objective training of neural networks to approximate the Pareto front during inference. In our approach, we train the neural networks multi-objectively using a dynamic loss function, wherein each network’s losses (corresponding to multiple objectives) are weighted by their hypervolume maximizing gradients. Experiments on different multi-objective problems show that our approach returns well-spread outputs across different trade-offs on the approximated Pareto front without requiring the trade-off vectors to be specified a priori. Further, results of comparisons with the state-of-the-art approaches highlight the added value of our proposed approach, especially in cases where the Pareto front is asymmetric.
Tabu-driven Quantum Neighborhood Samplers - Charles Moussa
Combinatorial optimization is an important application targeted by quantum computing. However, near-term hardware constraints make quantum algorithms unlikely to be competitive when compared to high-performing classical heuristics on large practical problems. One option to achieve advantages with near-term devices is to use them in combination with classical heuristics. In particular, we propose using quantum methods to sample from classically intractable distributions – which is the most probable approach to attain a true provable quantum separation in the near-term – which are used to solve optimization problems faster. We numerically study this enhancement by an adaptation of Tabu Search using the Quantum Approximate Optimization Algorithm (QAOA) as a neighborhood sampler. We show that QAOA provides a flexible tool for exploration-exploitation in such hybrid settings and can provide evidence that it can help in solving problems faster by saving many tabu iterations and achieving better solutions.
About Monika Grewal and Charles Moussa
Manuel López-Ibáñez is a Senior Lecturer (Associate Professor) in the Decision and Cognitive Sciences Research Centre at the Alliance Manchester Business School, University of Manchester, UK. His main expertise is on the application of metaheuristics, including local search, evolutionary algorithms and ant colony optimization, to optimization problems, including continuous, combinatorial, and multi-objective problems. His current research is on the experimental analysis and automatic configuration and tuning of stochastic optimization algorithms, in particular, when applied to multi-objective optimization problems. He has also developed several widely used software tools such as irace, hypervolume computation and EAF computation and visualization.
