Portrait de Quentin Cappart

Quentin Cappart

Membre affilié
Professeur agrégé, Polytechnique Montréal, Département de génie informatique et génie logiciel
Sujets de recherche
Apprentissage sur graphes
Raisonnement
Réseaux de neurones en graphes
Site web
Google Scholar
LinkedIn
X

Biographie

Quentin Cappart est professeur agrégé au Département de génie informatique et logiciel de Polytechnique Montréal et un membre affilié de Mila. Il a obtenu successivement un baccalauréat en ingénierie (2012), une M. Sc. en génie informatique (2014), une M. Sc. en gestion (2018) et un doctorat (2017) à l'Université catholique de Louvain (Belgique). Après son doctorat, il s’est joint à Polytechnique Montréal et au Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport (CIRRELT) en tant que chercheur postdoctoral de 2018 à 2020. Pendant ces deux années, il a également été stagiaire en recherche chez ElementAI. Il dirige le groupe de recherche CORAIL, qu'il a cofondé avec le professeur Louis-Martin Rousseau. Ses recherches portent principalement sur l'intégration de l'apprentissage automatique à des procédures de recherche pour résoudre des problèmes combinatoires.

Étudiants actuels

Léo Boisvert
Doctorat - Polytechnique
Thibault Le Sellier De Chezelles
Maîtrise recherche - Polytechnique
Github
Google Scholar

Publications

Decision Diagrams in Space!
Isaac Rudich
Quentin Cappart
Manuel L'opez-Ib'anez
Michael Romer
Louis-Martin Rousseau
2023-12-03
ArXiv (prépublication)
arxiv.org
arxiv.org
The Unsolved Challenges of LLMs as Generalist Web Agents: A Case Study
Rim Assouel
Tom Marty
Massimo Caccia
Issam Hadj Laradji
Alexandre Drouin
Sai Rajeswar
Hector Palacios
Quentin Cappart
David Vazquez
Nicolas Chapados
Maxime Gasse
Alexandre Lacoste
2023-11-07
NeurIPS.cc/2023/Workshop/FMDM (publié)
openreview.net
openreview.net
MARCO: A Memory-Augmented Reinforcement Framework for Combinatorial Optimization
Andoni I. Garmendia
Quentin Cappart
Josu Ceberio
Alexander Mendiburu
2023-08-19
Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence (publié)
doi.org
arxiv.org
Dynamic Routing and Wavelength Assignment with Reinforcement Learning
Peyman Kafaei
Quentin Cappart
Nicolas Chapados
Hamed Pouya
Louis-Martin Rousseau
With the rapid developments in communication systems, and considering their dynamic nature, all-optical networks are becoming increasingly c… (voir plus)omplex. This study proposes a novel method based on deep reinforcement learning for the routing and wavelength assignment problem in all-optical wavelength-decision-multiplexing networks. We consider dynamic incoming requests, in which their arrival and holding times are not known in advance. The objective is to devise a strategy that minimizes the number of rejected packages due to the lack of resources in the long term. We use graph neural networks to capture crucial latent information from the graph-structured input to develop the optimal strategy. The proposed deep reinforcement learning algorithm selects a route and a wavelength simultaneously for each incoming traffic connection as they arrive. The results demonstrate that the learned agent outperforms the methods used in practice and can be generalized on network topologies that did not participate in training.
2023-06-08
INFORMS Journal on Optimization (publié)
doi.org
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse
Simon Bowly
Quentin Cappart
Jonas Charfreitag
Laurent Charlin
Didier Chételat
Antonia Chmiela
Justin Dumouchelle
Ambros Gleixner
Aleksandr Kazachkov
Elias Boutros Khalil
Paweł Lichocki
Andrea Lodi
Miles Lubin
Chris J. Maddison
Christopher Morris
D. Papageorgiou
Augustin Parjadis
Sebastian Pokutta
Antoine Prouvost … (voir 22 de plus)
Lara Scavuzzo
Giulia Zarpellon
Linxin Yangm
Sha Lai
Akang Wang
Xiaodong Luo
Xiang Zhou
Haohan Huang
Sheng Cheng Shao
Yuanming Zhu
Dong Dong Zhang
Tao Manh Quan
Zixuan Cao
Yang Xu
Zhewei Huang
Shuchang Zhou
C. Binbin
He Minggui
Haoren Ren Hao
Zhang Zhiyu
An Zhiwu
Mao Kun
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused … (voir plus)on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning as a new approach for solving combinatorial problems, either directly as solvers or by enhancing exact solvers. Based on this context, the ML4CO aims at improving state-of-the-art combinatorial optimization solvers by replacing key heuristic components. The competition featured three challenging tasks: finding the best feasible solution, producing the tightest optimality certificate, and giving an appropriate solver configuration. Three realistic datasets were considered: balanced item placement, workload apportionment, and maritime inventory routing. This last dataset was kept anonymous for the contestants.
2021-01-01
NeurIPS (Competition and Demos) (publié)
doi.org
arxiv.org