8 papers
MERIT: Efficient In-Place Deletion for Dynamic Graph-Based Approximate Nearest Neighbor Indexes
Zekai Wu, Jiabao Jin, Peng Cheng +6
Graph-based indexes have become the dominant approach to approximate nearest neighbor search (ANNS) over high-dimensional data and play a crucial role in real-world applications su…
FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search
Zekai Wu, Jiabao Jin, Peng Cheng +7
As the state-of-the-art methods for high-dimensional data retrieval, Approximate Nearest Neighbor Search (ANNS) approaches with graph-based indexes have attracted increasing attent…
SINDI: An Efficient Index for Sparse Vector Approximate Maximum Inner Product Search
Ruoxuan Li, Xiaoyao Zhong, Jiabao Jin +7
Sparse vector Maximum Inner Product Search (MIPS) is crucial in multi-path retrieval for Retrieval-Augmented Generation (RAG). Recent inverted index-based and graph-based algorithm…
Approximate Nearest Neighbor Search of Large Scale Vectors on Distributed Storage
Kun Yu, Jiabao Jin, Xiaoyao Zhong +6
Approximate Nearest Neighbor Search (ANNS) in high-dimensional space is an essential operator in many online services, such as information retrieval and recommendation. Indices con…
Infinite Stream Estimation under Personalized -Event Privacy
Leilei Du, Peng Cheng, Lei Chen +3
Streaming data collection is indispensable for stream data analysis, such as event monitoring. However, publishing these data directly leads to privacy leaks. -event privacy is…
From Channel Bias to Feature Redundancy: Uncovering the "Less is More" Principle in Few-Shot Learning
Ji Zhang, Xu Luo, Lianli Gao +3
Deep neural networks often fail to adapt representations to novel tasks under distribution shifts, especially when only a few examples are available. This paper identifies a core o…