44 citations · 84 across the 8 of their papers we have counts for
4 papers · 1 filter
When can you trust feature selection? -- II: On the effects of random data on condition in statistics and optimisation
Alexander Bastounis, Felipe Cucker, Anders C. Hansen
In Part I, we defined a LASSO condition number and developed an algorithm -- for computing support sets (feature selection) of the LASSO minimisation problem -- that runs in polyno…
When can you trust feature selection? -- I: A condition-based analysis of LASSO and generalised hardness of approximation
Alexander Bastounis, Felipe Cucker, Anders C. Hansen
The arrival of AI techniques in computations, with the potential for hallucinations and non-robustness, has made trustworthiness of algorithms a focal point. However, trustworthine…
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 $ε…
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…