Learning-Augmented Algorithms for Online Linear and Semidefinite Programming

We show that if the predictor is accurate, we can efficiently bypass these impossibility results and achieve a constant-factor approximation to the optimal solution, i.e., consistency.