Corey J. Nolet
Corey J. Nolet
We have code example projects with drop-in project templates for C, C++, and Rust. We should do the same w/ Python examples.
Recently, there were several updates made to the nn-descent algorithm in RAFT which need to be migrated over to cuVS. This includes: 1. Ability to compute mutual reachability distance by...
The current developer guide was moved over almost directly from RAFT and many of the concepts are different, just plain wrong, or no longer apply to cuVS. We should build...
The filtering code has been migrated and is internal to cuVS. It needs to be exposed through the public APIs and the gtests added/migrated.
RBC is the final algorithm that relies on FAISS' k-selection routines, even though we now have new routines right in cuVS for doing warp- and block-level k-selection. The FAISS routines...
Mutual reachability distance is an important post-processing data mining computation that unfortunately needs to be computed during the distance computation. Because RAFT is header only, we exposed this capability as...
Many of the extended APIs need better test coverage (e.g. C, Rust, etc...). Right now we are relying on pytests for the C-layer tests but we're also seeing that's not...
Since the dendrogram is a binary tree, the current implementation of `AgglomerativeClustering` cuts the dendrogram at a particular level based on a user-provided parameter `n_clusters`. This can be useful when...
Release 24.12 brings with it a new and improved lanczos solver, but there are some gtests which are failing because the expected results have been hardcoded while other tests use...