What is hipVS?#
2025-11-10
3 min read time
hipVS is an API providing GPU-accelerated vector search functions. Vector search is an information retrieval method that has been growing in use over the past few years, partly because of the rising importance of multimedia embeddings created from unstructured data and the need to perform semantic search on the embeddings to find items which are semantically similar to each other. Vector search is also used in data mining and machine learning tasks.
It comprises an important step in many clustering and visualization algorithms like UMAP, t-SNE, K-means, and HDBSCAN. Faster vector search enables interactions between dense vectors and graphs. Converting a pile of dense vectors into nearest neighbors graphs unlocks graph analysis algorithms, such as those found in GraphBLAS.
Below are some common use-cases for vector search:
Semantic search
Generative AI & Retrieval-Augmented Generation (RAG)
Recommender systems
Computer vision
Image search
Text search
Audio search
Molecular search
Model training
Data mining
Clustering algorithms
Visualization algorithms
Sampling algorithms
Class balancing
Ensemble methods
k-NN graph construction
Benefits of hipVS#
Following are some benefits of using hipVS for AMD GPU-accelerated vector search:
Fast index build
Latency critical and high throughput search
Parameter tuning
Cost savings
Interoperability (build on GPU, deploy on CPU)
Multiple language support
Building blocks for composing new or accelerating existing algorithms
Highlights#
Approximate & exact nearest-neighbor search – HNSW, IVF-PQ, brute force and more
C++, C, Rust, and Python interfaces – integrate in low-latency services or rapid prototyping notebooks
API-compatible with cuVS – drop-in replacement for existing cuVS workflows on AMD GPUs
Limitations#
Multi-GPU and Multinode functionality is experimental.
References#
Many of the accelerated implementations in hipVS are also based on research papers which provide additional background. You are encouraged to cite the corresponding algorithms by referencing them in your own research.