ארמין שמילוביץ

The runtime complexity of the Relevance Vector Machine (RVM) is which makes it too expensive for moderately sized machine learning problems. We propose a working set algorithm which reduces the runtime complexity to O(N²). Experiments verify the viability of the method for classification benchmark problemsץ