3 papers
cs.DB2026
TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search
Jiuqi Wei, Zhenyu Liao, Ruoyu Han +3
Approximate Nearest Neighbor Search (ANNS) in high-dimensional Euclidean spaces is a fundamental problem with broad applications. Subspace Collision is a newly proposed ANNS framew…
cs.DB2025
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
Jiuqi Wei, Xiaodong Lee, Zhenyu Liao +2
Approximate Nearest Neighbor (ANN) search in high-dimensional Euclidean spaces is a fundamental problem with a wide range of applications. However, there is currently no ANN method…
cs.LG2024
Robust and Communication-Efficient Federated Domain Adaptation via Random Features
Zhanbo Feng, Yuanjie Wang, Jie Li +5
Modern machine learning (ML) models have grown to a scale where training them on a single machine becomes impractical. As a result, there is a growing trend to leverage federated l…