1 citations · 1 across the 6 of their papers we have counts for
Showing 2024 · cs.AIShow all
3 papers · 2 filters
cs.AI2024
IDEQ -- Improving Diffusion Models for the Traveling Salesman Problem (TSP) by Leveraging the Structure of the Solution Space
Mickael Basson, Philippe Preux
We investigate diffusion models to solve the Traveling Salesman Problem. Building on the recent DIFUSCO and T2TCO approaches, we propose IDEQ. IDEQ improves the quality of the solu…
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…
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…