Structured adaptive and random spinners for fast machine learning computations — mentioned by stochastic_monk

Sun, 29 Oct 2017 16:59:34 GMT

Very interesting; I've ignored random forests more than I should. Thank you! I won't comment on your methods except to say that comparing classification over linear PCA against a kernel PCA in linearly unseparable data isn't exactly fair, and I think that providing an SVM performed on a different kernel PCA decomposition or a kernel SVM itself would be more illustrative. (Is your code available?) I generally think of neural networks as enormous meta-kernels. (Composites of <composites of...> kernels) This generally leads me to think of ways that kernels can be turned into neural network…

Paper and discussion history. A mention is not an endorsement.

Structured adaptive and random spinners for fast machine learning computations · HackerPapers discussions

Structured adaptive and random spinners for fast machine learning computations — mentioned by stochastic_monk