AI Dynamics

Global AI News Aggregator

SVMs Outperform k-Nearest Neighbor for Embedding Lookups

Random note on k-Nearest Neighbor lookups on embeddings: in my experience much better results can be obtained by training SVMs instead. Not too widely known. Short example: https://
github.com/karpathy/rando
mfun/blob/master/knn_vs_svm.ipynb
… Works because SVM ranking considers the unique aspects of your query w.r.t. data.

→ View original post on X — @karpathy,

Commentaires

Leave a Reply

Your email address will not be published. Required fields are marked *