A very common workflow is to index some data based on its embeddings and then given a new query embedding retrieve the most similar examples with k-Nearest Neighbor search. For example, you can imagine embedding a large collection of papers by their abstracts and then given a new paper of interest retrieve the most similar papers to it.
TLDR in my experience it ~always works better to use an SVM instead of kNN, if you can afford the slight computational hit
G. Mori, S. Belongie, and J. Malik. Computer Vision and Pattern Recognition, 2001. CVPR 2001. Proceedings
of the 2001 IEEE Computer Society Conf. on, 1, page I----723----I----730 vol.1. (2001)
J. Krinke. Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01), page 301--. Washington, DC, USA, IEEE Computer Society, (2001)