795 citations · 1.3k across the 32 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2022
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 -approximation to a solution of a computational problem for , but for $ε…
math.OC2021★ 44 cited
The extended Smale's 9th problem -- On computational barriers and paradoxes in estimation, regularisation, computer-assisted proofs and learning
Alexander Bastounis, Anders C Hansen, Verner Vlačić
Linear and semidefinite programming (LP, SDP), regularisation through basis pursuit (BP) and Lasso have seen great success in mathematics, statistics, data science, computer-assist…