82 citations · 190 across the 16 of their papers we have counts for
20 papers
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…
Make Every Expansion Count: Learning to Search Efficiently in LLM Code Repair
Elad Sharony, Ido Greenberg, Jialin Song +3
Large language model (LLM) code-repair systems fix faulty programs by repeatedly generating and testing revisions. Each revision is costly, making the choice of which repair to pur…
COMPASS: Ordered Clustered Routing at 100K Scale
Ido Greenberg, Hugo Linsenmaier, Piotr Sielski +4
Large-scale routing often requires visiting clusters of nodes in a prescribed order, giving rise to the Ordered Clustered Traveling Salesman Problem (OCTSP). Optimizing each cluste…
Simulating clinical interventions with a generative multimodal model of human physiology
Guy Lutsker, Gal Sapir, Jordi Merino +7
Understanding how human health changes over time, and why responses to interventions vary between individuals, remains a central challenge in medicine. Here we present HealthFormer…
Accelerating Vehicle Routing via AI-Initialized Genetic Algorithms
Ido Greenberg, Piotr Sielski, Hugo Linsenmaier +5
Vehicle Routing Problems (VRP) are an extension of the Traveling Salesperson Problem and are a fundamental NP-hard challenge in combinatorial optimization. Solving VRP in real-time…
From Glucose Patterns to Health Outcomes: A Generalizable Foundation Model for Continuous Glucose Monitor Data Analysis
Guy Lutsker, Gal Sapir, Smadar Shilo +11
Recent advances in SSL enabled novel medical AI models, known as foundation models, offer great potential for better characterizing health from diverse biomedical data. CGM provide…