activity
20242026
collaborators

5 papers

cs.AI2026

Stein Variational Black-Box Combinatorial Optimization

Thomas Landais, Olivier Goudet, Adrien Goëffon +2

Combinatorial black-box optimization in high-dimensional settings demands a careful trade-off between exploiting promising regions of the search space and preserving sufficient exp…

cs.LG2026

Black-Box Combinatorial Optimization with Order-Invariant Reinforcement Learning

Olivier Goudet, Quentin Suire, Adrien Goëffon +2

We introduce an order-invariant reinforcement learning framework for black-box combinatorial optimization. Classical estimation-of-distribution algorithms (EDAs) often rely on lear…

cs.NE2025

Discovering new robust local search algorithms with neuro-evolution

Mohamed Salim Amri Sakhri, Adrien Goëffon, Olivier Goudet +2

This paper explores a novel approach aimed at overcoming existing challenges in the realm of local search algorithms. Our aim is to improve the decision process that takes place wi…

cs.AI2025

Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring

Cyril Grelier, Olivier Goudet, Jin-Kao Hao

This work investigates the Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem. In addition to the basic MCTS…

cs.LG2024

Deinterleaving of Discrete Renewal Process Mixtures with Application to Electronic Support Measures

Jean Pinsolle, Olivier Goudet, Cyrille Enderli +2

In this paper, we propose a new deinterleaving method for mixtures of discrete renewal Markov chains. This method relies on the maximization of a penalized likelihood score. It exp…