71 citations · 76 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
stat.ML2020★ 2 cited
Algorithms for slate bandits with non-separable reward functions
Jason Rhuggenaath, Alp Akcay, Yingqian Zhang +1
In this paper, we study a slate bandit problem where the function that determines the slate-level reward is non-separable: the optimal value of the function cannot be determined by…
cs.LG2020★ 71 cited
Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning
Paulo R. de O. da Costa, Jason Rhuggenaath, Yingqian Zhang +1
Recent works using deep learning to solve the Traveling Salesman Problem (TSP) have focused on learning construction heuristics. Such approaches find TSP solutions of good quality…