Kevin Tierney - Search heuristics for solving combinatorial optimization problems with deep RL

  Рет қаралды 1,647

Discrete Optimization Talks

Discrete Optimization Talks

Күн бұрын

Part of Discrete Optimization Talks: talks.discrete...
Kevin Tierney - Universität Bielefeld
Search heuristics for solving combinatorial optimization problems with deep reinforcement learning
Speaker webpage: www.uni-bielef...
Abstract: Methods using deep reinforcement learning to learn how to solve combinatorial optimization (CO) problems are rapidly approaching the performance of traditional OR heuristics. The performance gains of these methods can be contributed to two factors, namely the quality of the deep learned models and the effectiveness of using these models within a search process. I present my lab's work with Samsung SDS on the latter challenge, for which we have developed problem-independent search methods that can be integrated with deep learned models to find high-quality solutions to difficult CO problems. First, I will discuss efficient active search, which harnesses backpropagation during search to adjust a previously learned model to the problem instance being solved. Second, I will describe simulation-guided beam search, which combines EAS with a GPU-based beam search and solution rollouts to further guide the search process. Both search methods are compared to machine learning-based and traditional OR methods on routing and scheduling problems, showing that they come close, and in some cases beat, the traditional approaches.
Bio: Kevin Tierney is a full professor for Decision and Operation Technologies at Bielefeld University in Germany. He holds a B.Sc. in Computer Science from Rochester Institute of Technology, an Sc.M. in Computer Science from Brown University, and a PhD from the IT University of Copenhagen in Denmark. He was previously an assistance professor at Paderborn University. His research interests include algorithm configuration, learning to solve optimization problems, and solving logistics problems. His work on Neural Large Neighborhood Search won the distinguished paper award at ECAI 2020.

Пікірлер: 2
@zohrenoor4176
@zohrenoor4176 Жыл бұрын
Very helpful. Thank you, Kevin.
@nathansudermann-merx4586
@nathansudermann-merx4586 Жыл бұрын
Very interesting, thank you, Kevin!
Overview of Deep Reinforcement Learning Methods
24:50
Steve Brunton
Рет қаралды 61 М.
WORLD BEST MAGIC SECRETS
00:50
MasomkaMagic
Рет қаралды 43 МЛН
Nastya and balloon challenge
00:23
Nastya
Рет қаралды 54 МЛН
2. Optimization Problems
48:04
MIT OpenCourseWare
Рет қаралды 226 М.
AI can't cross this line and we don't know why.
24:07
Welch Labs
Рет қаралды 636 М.
Adam Wagner - Finding counterexamples to conjectures via reinforcement learning - IPAM at UCLA
50:09
Institute for Pure & Applied Mathematics (IPAM)
Рет қаралды 1,3 М.
Faster MIPs Using Custom Heuristics
1:02:54
Gurobi Optimization
Рет қаралды 3,7 М.
An introduction to Policy Gradient methods - Deep Reinforcement Learning
19:50
Yatharth Dubey - Theoretical and Computational Analysis of Strong Branching
33:11
Discrete Optimization Talks
Рет қаралды 315
Xavier Bresson: "The Transformer Network for the Traveling Salesman Problem"
30:13
Institute for Pure & Applied Mathematics (IPAM)
Рет қаралды 2,3 М.