JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
High-performance KNN similarity functions in Python, optimized for sparse matrices
High-performance batched Top-K selection for CPU inference. Up to 80x faster than PyTorch, optimized for LLM sampling with AVX2 SIMD.
High performance approximate algorithms in Go (e.g. morris counter, count min, etc.)
A fast and highly accurate differentiable Top-k operator from the "Successive Halving Top-k Operator" AAAI'21 paper.
[ICML2022] Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classification
Paradise of Algorithms
Filtered Top K common words with one MapReduce
ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations [AAAI-2020]
An automated, high-performance, low-cost lightweight distributed cache and preheating framework
Backend agnostic batched radix-based GPU topK in Julia
jigsaw sketch implementation
Algorithms for traversing spatial networks and performing top-k queries.
RAG Internals, How RAG pipelines actually work under the hood - a general internal visual explanation.
A single-file, JIT-compiled CUDA batch top-k with variable k and variable sequence length per row.
LangChain vector store for TopK: hybrid (BM25 + semantic) search, built-in embeddings, metadata filters and per-tenant partitions in one query.
To associate your repository with the topk topic, visit your repo's landing page and select "manage topics."