Generalised hardness of approximation and the SCI hierarchy -- On determining the boundaries of training algorithms in AI

Luca Eva Gazdag, Alexander Bastounis, Anders C. Hansen

Generalised hardness of approximation (GHA) is the phenomenon that one can easily compute an $\epsilon$-approximation to a solution of a computational problem for $\epsilon >{\epsilon }_1>0$, but for $ε…