Does anyone have reference to a summary of run-time analyses for common machine learning algorithms (different flavors of NN, SVMs, etc)?


2 Answers 2


Here are some superficial tables:

  • The Computational Mathematics of Statistical Data Mining. PPT

  • Table 1 in:

    Chu, C. T., Kim, S. K., Lin, Y. A., Yu, Y., Bradski, G. R., Ng, A. Y., & Olukotun, K. (2006). Mapreduce for machine learning on multicore. Neural Information Processing Systems (pp. 281–288). PDF

  • 1
    $\begingroup$ First link is dead. $\endgroup$
    – fanbondi
    Commented May 7, 2019 at 8:52
  • $\begingroup$ Fixed broken link based on google search. However, there are multiple versions of the relevant presentation online, so this might not be an exact duplicate of the original one. $\endgroup$
    – mkt
    Commented Sep 12, 2019 at 12:53

I wrote the following article: computational complexity of machine learning algorithms where I keep track of the (theoretical) complexity of learning algorithms and run time analysis based on log-log regressions.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.