Recently, the anchor acceleration, an acceleration mechanism distinct from Nes-terov's, has been discovered for minimax optimization and fixed-point problems,
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.