Learning Augmented Exact Exponential Algorithms
arXiv:2606.18807v1 Announce Type: cross Abstract: The field of learning-augmented algorithms has demonstrated that machine-learned predictions can bypass worst-case lower bounds across a wide range of problems. So far, however, the focus has been almost exclusively on polynomial-time algorithms, where predictions improve competitive ratios, approximation guarantees, or running times. In this paper, we raise the question of whether predictions can push the frontier of exact exponential-time algor


![Next-Latent Prediction Transformers [R]](https://preview.redd.it/efm7zazr2t7h1.png?width=140&height=90&auto=webp&s=c1b7070ca3de62bdc276d7a185c72f6737e6f92e)
