activity
20232026
most citedHigh-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations

6 citations · 14 across the 10 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

cs.DB2026

RaBitQ-SSD: Split Codes and Pipelined I/O for SSD-Resident Vector Search

Yuexuan Xu, Jianyang Gao, Michael Norris +5

SSD-resident approximate nearest-neighbor search is essential when vector collections exceed DRAM capacity. The challenge is to reduce SSD reads and hide I/O latency through concur…

cs.LG2026

LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention

Ziqi Yin, Jianyang Gao, Peiqi Yin +2

Indexer-TopK, which computes scores and selects the top- candidates, is a key primitive in long-context sparse attention for large language models and vector retrieval for recom…

cs.LG2026

Revisiting RaBitQ and TurboQuant: A Symmetric Comparison of Methods, Theory, and Experiments

Jianyang Gao, Yutong Gou, Yuexuan Xu +5

This technical note revisits the relationship between RaBitQ and TurboQuant under a unified comparison framework. We compare the two methods in terms of methodology, theoretical gu…

cs.DB2026

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search

Jifan Shi, Jianyang Gao, James Xia +2

Approximate nearest neighbor search (ANNS) on GPUs is gaining increasing popularity for modern retrieval and recommendation workloads that operate over massive high-dimensional vec…

cs.LG2026

mHC-lite: You Don't Need 20 Sinkhorn-Knopp Iterations

Yongyi Yang, Jianyang Gao

Hyper-Connections (HC) generalizes residual connections by introducing dynamic residual matrices that mix information across multiple residual streams, accelerating convergence in…