CUR Decomposition
method
ID: curdecomposition
Related Papers
Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization
AbstractEfficient k-nearest neighbor search is a fundamental task, foundational for many problems in NLP. When the similarity is measured by dot-product between dual-encoder vectors or L2-distance, there already exist many …...