472 citations · 1.2k across the 60 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Size Generalization for Diffusion Routing Solvers
Barak Itzchak Davidovitch, Eli Meirom, Ethan Fetaya +1
Routing problems, like the Traveling Salesman Problem (TSP) and the Capacitated Vehicle Routing Problem (CVRP), are NP-hard and slow to solve for large instances. Diffusion-based s…
cs.AI2021★ 1 cited
Improve Agents without Retraining: Parallel Tree Search with Off-Policy Correction
Assaf Hallak, Gal Dalal, Steven Dalton +3
Tree Search (TS) is crucial to some of the most influential successes in reinforcement learning. Here, we tackle two major challenges with TS that limit its usability: \textit{dist…