|
|
|
|
|
by delusional
374 days ago
|
|
All of modern Neural Network AI is based on GEMM which are O(n^2) algorithms. There are sub-cubic alternatives, but it's my understanding that the cache behavior of those variants mean they aren't practically faster when memory bound. n is only rarely related to "customers". As long as n doesn't grow, the asymptotic complexity doesn't actually matter. |
|