Mixed-integer optimization solvers often find optimal solutions early in the search, yet spend the majority of computation time proving optimality. We exploit this by learning when to terminate solvers early on distributions of similar problem instances. Our method trains a neural network to estimate the true optimality gap from the solver state, then uses conformal prediction to calibrate a stopping threshold with rigorous probabilistic guarantees on solution quality. On five problem families from the distributional MIPLIB library, our method reduces solve time by over 60% while guaranteeing 0.1%- optimal solutions with 95% probability
@article{arxiv.2602.01476,
title = {Conformal Prediction for Early Stopping in Mixed Integer Optimization},
author = {Stefan Clarke and Bartolomeo Stellato},
journal= {arXiv preprint arXiv:2602.01476},
year = {2026}
}