518 citations
- Centre National de la Recherche ScientifiqueFR241 papers
- Université Toulouse III - Paul SabatierFR172 papers
- Institut de Recherche en Informatique de ToulouseFR171 papers
- Université Toulouse-I-CapitoleFR171 papers
- Université Toulouse - Jean JaurèsFR171 papers
- Institut de Mathématiques de MarseilleFR147 papers
- Université de BordeauxFR138 papers
- Château GombertFR107 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR80 papers
- Aix-Marseille UniversitéFR54 papers
- Institut de Mécanique et d'Ingénierie de BordeauxFR45 papers
- Centrale MéditerranéeFR39 papers
6 papers · 2 filters
From Black-Box Tuning to Guided Optimization via Hyperparameters Interaction Analysis
Moncef Garouani, Ayah Barhrhouj
Hyperparameters tuning is a fundamental, yet computationally expensive, step in optimizing machine learning models. Beyond optimization, understanding the relative importance and i…
Efficient Robust Conformal Prediction via Lipschitz-Bounded Networks
Thomas Massena, Léo andéol, Thibaut Boissin +4
Conformal Prediction (CP) has proven to be an effective post-hoc method for improving the trustworthiness of neural networks by providing prediction sets with finite-sample guarant…
Model Lake: a New Alternative for Machine Learning Models Management and Governance
Moncef Garouani, Franck Ravat, Nathalie Valles-Parlangeau
The rise of artificial intelligence and data science across industries underscores the pressing need for effective management and governance of machine learning (ML) models. Tradit…
Investigating the Duality of Interpretability and Explainability in Machine Learning
Moncef Garouani, Josiane Mothe, Ayah Barhrhouj +1
The rapid evolution of machine learning (ML) has led to the widespread adoption of complex "black box" models, such as deep neural networks and ensemble methods. These models exhib…
SMT-EX: An Explainable Surrogate Modeling Toolbox for Mixed-Variables Design Exploration
Mohammad Daffa Robani, Paul Saves, Pramudita Satria Palar +2
Surrogate models are of high interest for many engineering applications, serving as cheap-to-evaluate time-efficient approximations of black-box functions to help engineers and pra…
The regret lower bound for communicating Markov Decision Processes
Victor Boone, Odalric-Ambrym Maillard
This paper is devoted to the extension of the regret lower bound beyond ergodic Markov decision processes (MDPs) in the problem dependent setting. While the regret lower bound for…