Toward Compiler World Models: Learning Latent Dynamics for Efficient Tensor Program Search

arXiv:2606.09312v1 Announce Type: new Abstract: Tensor program optimization is essential for modern machine learning systems, but its search space is enormous. Existing auto-schedulers reduce measurement cost with learned cost models, yet they usually evaluate each candidate as a static code snapshot, ignoring the schedule trajectory that produced it. This makes them insensitive to action dependencies and vulnerable to superficial code variations. We propose a world-model-inspired evaluator that models schedule evaluation as action-conditioned latent dynamics over program states. Starting from the initial program, it rolls out scheduling actions in a continuous latent space with a lightweight transition model, avoiding expensive AST mutation and repeated code encoding. The final dynamic representation is combined with action and hardware features to rank candidates. Implemented in TVM AutoScheduler, our method improves representative-subgraph latency over Ansor by 1.37imes on GPU and 1.54imes on CPU under the same 64-trial budget. It also matches Ansor-10K within 2.2% geometric mean using 10imes fewer measurements, and accelerates full-model inference over PyTorch/PyTorch-opt(cuDNN) by 4.61imes/3.67imes geometric mean.

Source: arXiv cs.LG | 2026-06-09