Wouter Kool

CoRR, 2024

2023

A Review of the Gumbel-max Trick and its Extensions for Discrete Stochasticity in Machine Learning.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2023

2022

Deep Policy Dynamic Programming for Vehicle Routing Problems.

[BibT_eX]

[DOI]

Joaquim A. S. Gromicho

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021

Unbiased Gradient Estimation with Balanced Assignments for Mixtures of Experts.

[BibT_eX]

[DOI]

Chris J. Maddison

Andriy Mnih

CoRR, 2021

The EURO Meets NeurIPS 2022 Vehicle Routing Competition.

[BibT_eX]

[DOI]

Joaquim A. S. Gromicho

Proceedings of the NeurIPS 2022 Competition Track, 2021

2020

Ancestral Gumbel-Top-k Sampling for Sampling Without Replacement.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2020

Estimating Gradients for Discrete Random Variables by Sampling without Replacement.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

Stochastic Beams and Where To Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacement.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Buy 4 REINFORCE Samples, Get a Baseline for Free!

[BibT_eX]

[DOI]

Proceedings of the Deep Reinforcement Learning Meets Structured Prediction, 2019

Attention, Learn to Solve Routing Problems!

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Learning Representations, 2019

2018

Attention Solves Your TSP.

[BibT_eX]

[DOI]