Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Improve NNDescent speed #286

Open
msluszniak opened this issue Jun 24, 2024 · 0 comments
Open

Improve NNDescent speed #286

msluszniak opened this issue Jun 24, 2024 · 0 comments

Comments

@msluszniak
Copy link
Contributor

Currently, NNDescent runs slower than it is supposed to. Currently, the bottlenecks are functions generate_graph_updates and sample_candidates. In both implementations that I used to implement NNDescent namely Python implementation and C++ implementation these functions are implemented with technologies that enable parallel/concurrent computations (OMP and Numba). I wasn't able to implement this using vectorisation. For now, I don't have any other ideas to drastically improve NNDescent's runtime.

@josevalim josevalim changed the title Ideas to improve NNDescent speed Improve NNDescent speed Jun 24, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant