activity
20232025
most citedPID Tuning using Cross-Entropy Deep Learning: a Lyapunov Stability Analysis

4 citations · 5 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LG2025

Evaluating Interpretable Reinforcement Learning by Distilling Policies into Programs

Hector Kohler, Quentin Delfosse, Waris Radji +2

There exist applications of reinforcement learning like medicine where policies need to be ''interpretable'' by humans. User studies have shown that some policy classes might be mo…

cs.AI2024

Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

Hector Kohler, Quentin Delfosse, Riad Akrour +2

Deep reinforcement learning agents are prone to goal misalignments. The black-box nature of their policies hinders the detection and correction of such misalignments, and the trust…

eess.SY2024★ 4 cited

PID Tuning using Cross-Entropy Deep Learning: a Lyapunov Stability Analysis

Hector Kohler, Benoit Clement, Thomas Chaffre +1

Underwater Unmanned Vehicles (UUVs) have to constantly compensate for the external disturbing forces acting on their body. Adaptive Control theory is commonly used there to grant t…

cs.AI2024

Towards a Research Community in Interpretable Reinforcement Learning: the InterpPol Workshop

Hector Kohler, Quentin Delfosse, Paul Festor +1

Embracing the pursuit of intrinsically explainable reinforcement learning raises crucial questions: what distinguishes explainability from interpretability? Should explainable and…

cs.LG2023

Limits of Actor-Critic Algorithms for Decision Tree Policies Learning in IBMDPs

Hector Kohler, Riad Akrour, Philippe Preux

Interpretability of AI models allows for user safety checks to build trust in such AIs. In particular, Decision Trees (DTs) provide a global look at the learned model and transpare…

cs.LG2023★ 1 cited

Breiman meets Bellman: Non-Greedy Decision Trees with MDPs

Hector Kohler, Riad Akrour, Philippe Preux

In supervised learning, decision trees are valued for their interpretability and performance. While greedy decision tree algorithms like CART remain widely used due to their comput…

cs.LG2023

AdaStop: adaptive statistical testing for sound comparisons of Deep RL agents

Timothée Mathieu, Riccardo Della Vecchia, Alena Shilova +4

Recently, the scientific community has questioned the statistical reproducibility of many empirical results, especially in the field of machine learning. To contribute to the resol…