Skip to yearly menu bar Skip to main content

In-Person Poster presentation / poster accept

Robust Scheduling with GFlowNets

David Zhang · Corrado Rainone · Markus Peschl · Roberto Bondesan

MH1-2-3-4 #52

Keywords: [ Applications ] [ GFlowNets ] [ combinatorial optimization ] [ Scheduling ]


Finding the best way to schedule operations in a computation graph is a classical NP-hard problem which is central to compiler optimization. However, evaluating the goodness of a schedule on the target hardware can be very time-consuming. Traditional approaches as well as previous machine learning ones typically optimize proxy metrics, which are fast to evaluate but can lead to bad schedules when tested on the target hardware. In this work, we propose a new approach to scheduling by sampling proportionally to the proxy metric using a novel GFlowNet method. We introduce a technique to control the trade-off between diversity and goodness of the proposed schedules at inference time and demonstrate empirically that the pure optimization baselines can lead to subpar performance with respect to our approach when tested on a target model. Furthermore, we show that conditioning the GFlowNet on the computation graph enables generalization to unseen scheduling problems for both synthetic and real-world compiler datasets.

Chat is not available.