Chaitanya K. Joshi
Chaitanya K. Joshi
Home
Publications
Blog
Contact
CV
Light
Dark
Automatic
Combinatorial Optimization
Learning the Travelling Salesperson Problem Requires Rethinking Generalization
We study zero-shot generalization to large-scale instances in neural network-driven solvers for the Travelling Salesman Problem: what architectures, inductive biases and learning paradigms enable better generalization?
(Invited submission to the Constraints Journal)
Chaitanya K. Joshi
,
Quentin Cappart
,
Louis-Martin Rousseau
,
Thomas Laurent
PDF
Cite
Code
Video
DOI
Blog
Recent Advances in Deep Learning for Routing Problems
We characterize recent advances in deep learning for routing problems via a unified Neural Combinatorial Optimization pipeline and provide new directions to stimulate future research.
(Also published at the inaugural ICLR 2022 Blog Track)
Chaitanya K. Joshi
,
Rishabh Anand
Jan 12, 2022
20 min read
Cite
Slides
Video
ICLR Blog Track
Related Paper
Tweet
Learning TSP Requires Rethinking Generalization
We study zero-shot generalization to large-scale instances in neural network-driven solvers for the Travelling Salesman Problem: what architectures, inductive biases and learning paradigms enable better generalization?
(CP 2021)
Chaitanya K. Joshi
,
Quentin Cappart
,
Louis-Martin Rousseau
,
Thomas Laurent
PDF
Cite
Code
Slides
Video
DOI
Blog
Learning TSP Requires Rethinking Generalization
This talk discusses our recent work on deep learning for TSP and the challenge of zero-shot generalization for large-scale and real-world routing problems.
Jun 8, 2021 12:00 AM
CORS 2021 (Host: Dr. Maxime Gasse)
Chaitanya K. Joshi
Slides
Video
Benchmarking Graph Neural Networks
Open-source benchmarking framework to identify scalable and powerful GNN architectures, and track the progress of graph representation learning research.
(500+ citations, 2000+ GitHub stars)
Vijay Prakash Dwivedi
,
Chaitanya K. Joshi
,
Luu Anh Tuan
,
Thomas Laurent
,
Yoshua Bengio
,
Xavier Bresson
PDF
Cite
Code
Slides
Press
JMLR
Graph Neural Networks for the Travelling Salesman Problem
This talk introduces a recent line of work using Graph Neural Networks to directly ‘learn’ good heuristics for TSP in an end-to-end manner.
Oct 22, 2019 12:00 AM
INFORMS Annual Meeting 2019 (Host: Prof. Quentin Cappart)
Chaitanya K. Joshi
Slides
On Learning Paradigms for the Travelling Salesman Problem
How do learning paradigms impact zero-shot generalization to large-scale instances in learning-driven TSP solvers?
(NeurIPS 2019 Workshop)
Chaitanya K. Joshi
,
Thomas Laurent
,
Xavier Bresson
PDF
Cite
Code
Poster
An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem
Deep Graph ConvNets paired with parallelized graph search can learn TSP up to few hundred cities, but fall short of classical solvers.
Chaitanya K. Joshi
,
Thomas Laurent
,
Xavier Bresson
PDF
Cite
Code
Slides
Neural Combinatorial Optimization
Can Neural Networks learn to solve NP-hard optimization problems in scheduling, transportation, and supply chain directly without human handcrafting?
Chaitanya K. Joshi
Last updated on Dec 24, 2021
4 min read
Graph Convolutional Neural Networks for the Travelling Salesman Problem
Combinatorial optimization problems, also called NP-hard problems, are practical constraint satisfaction problems that are impossible …
Chaitanya K. Joshi
PDF
Cite
Code
Poster
Slides
Video
DOI
»
Cite
×