Search Results for author: El-Ghazali Talbi

Found 14 papers, 5 papers with code

Parallel Hyperparameter Optimization Of Spiking Neural Network

1 code implementation1 Mar 2024 Thomas Firmin, Pierre Boulet, El-Ghazali Talbi

By defining an early stopping criterion detecting silent networks and by designing specific constraints, we were able to instantiate larger and more flexible search spaces.

Bayesian Optimization Hyperparameter Optimization +1

SONATA: Self-adaptive Evolutionary Framework for Hardware-aware Neural Architecture Search

no code implementations20 Feb 2024 Halima Bouzidi, Smail Niar, Hamza Ouarnoughi, El-Ghazali Talbi

Our SONATA has seen up to sim$93. 6% Pareto dominance over the native NSGA-II, further stipulating the importance of self-adaptive evolution operators in HW-aware NAS.

Evolutionary Algorithms Hardware Aware Neural Architecture Search +1

Multi-Objective Reinforcement Learning Based on Decomposition: A Taxonomy and Framework

1 code implementation21 Nov 2023 Florian Felten, El-Ghazali Talbi, Grégoire Danoy

To tackle such an issue, this paper introduces multi-objective reinforcement learning based on decomposition (MORL/D), a novel methodology bridging the literature of RL and MOO.

Multi-Objective Reinforcement Learning reinforcement-learning

A Toolkit for Reliable Benchmarking and Research in Multi-Objective Reinforcement Learning

2 code implementations Conference on Neural Information Processing Systems Datasets and Benchmarks Track 2023 Florian Felten, Lucas N. Alegre, Ann Nowé, Ana L. C. Bazzan, El-Ghazali Talbi, Grégoire Danoy, Bruno C. da Silva

Multi-objective reinforcement learning algorithms (MORL) extend standard reinforcement learning (RL) to scenarios where agents must optimize multiple---potentially conflicting---objectives, each represented by a distinct reward function.

Benchmarking Multi-Objective Reinforcement Learning +1

A Virtual-Force Based Swarm Algorithm for Balanced Circular Bin Packing Problems

no code implementations1 Jun 2023 Juliette Gamot, Mathieu Balesdent, Romain Wuilbercq, Arnault Tremolet, Nouredine Melab, El-Ghazali Talbi

Balanced circular bin packing problems consist in positioning a given number of weighted circles in order to minimize the radius of a circular container while satisfying equilibrium constraints.

An algorithmic framework for the optimization of deep neural networks architectures and hyperparameters

no code implementations27 Feb 2023 Julie Keisler, El-Ghazali Talbi, Sandra Claudel, Gilles Cabriel

Based on this search space we propose neighbourhood and evolution search operators to optimize both the architecture and hyper-parameters of our networks.

Time Series Time Series Prediction

Recovery-to-Efficiency: A New Robustness Concept for Multi-objective Optimization under Uncertainty

no code implementations20 Nov 2020 El-Ghazali Talbi, Raca Todosijevic

More precisely, in the paper the so-called recovery-to-efficiency robustness concept is proposed and investigated.

Multi-fidelity modeling with different input domain definitions using Deep Gaussian Processes

no code implementations29 Jun 2020 Ali Hebbal, Loic Brevault, Mathieu Balesdent, El-Ghazali Talbi, Nouredine Melab

Gaussian Processes (GPs) are one of the popular approaches to exhibit the correlations between these different fidelity levels.

Gaussian Processes

Bayesian optimization of variable-size design space problems

no code implementations6 Mar 2020 Julien Pelamatti, Loic Brevault, Mathieu Balesdent, El-Ghazali Talbi, Yannick Guerin

This results in an optimization problem for which the search space varies dynamically (with respect to both number and type of variables) along the optimization process as a function of the values of specific discrete decision variables.

Bayesian Optimization

Matheuristics to optimize refueling and maintenance planning of nuclear power plants

no code implementations13 Dec 2018 Nicolas Dupin, El-Ghazali Talbi

It is shown that the restriction of time windows, which was used to ease computations, induces large over-costs and that this restriction is not required anymore with the capabilities of matheuristics or local search to solve such size of instances.

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