Jianyang Gao

PhD Candidate
> College of Computing and Data Science, Nanyang Technological University (NTU)

Email: jianyang.gao [at] ntu.edu.sg
Address: Blk N4, 50 Nanyang Avenue, Singapore, 639798

[Google Scholar] [DBLP] [Github]

Biography

Jianyang is a fourth-year PhD candidate (thesis submitted) advised by Prof. Cheng Long at the College of Computing and Data Science, Nanyang Technological University. He received his bachelor's degree in Mathematics from Beijing Normal University in 2021.

Jianyang's general research interest lies in vector database systems, machine learning systems and large language models.

Blog Posts

• Quantization in The Counterintuitive High-Dimensional Space

• Extended RaBitQ: an Optimized Scalar Quantization Method

Publications (* marks co-first authors)

1. Jianyang Gao, Yutong Gou, Yuexuan Xu, Yongyi Yang, Cheng Long, Raymond Chi-Wing Wong, "Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search" arXiv preprint arXiv:2409.09913 (September, 2024). To appear in Proceedings of ACM International Conference on Management of Data (SIGMOD) 2025. [arXiv][Code]

2. Yutong Gou*, Jianyang Gao*, Yuexuan Xu, Cheng Long, "SymphonyQG: towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search", Proceedings of ACM International Conference on Management of Data (SIGMOD) 2025. [arXiv][Code]

3. Yuexuan Xu*, Jianyang Gao*, Yutong Gou, Cheng Long, Christian S Jensen, "iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search", Proceedings of ACM International Conference on Management of Data (SIGMOD) 2025. [arXiv][Code]

4. Ziqi Yin, Jianyang Gao, Pasquale Balsebre, Cong Gao, Cheng Long, "DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph", Proceedings of ACM International Conference on Management of Data (SIGMOD) 2025.

5. Jianyang Gao, Cheng Long, "RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search", Proceedings of ACM International Conference on Management of Data (SIGMOD) 2024. [arXiv][Proc.][Code]

6. Jianyang Gao, Cheng Long, "High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations", Proceedings of ACM International Conference on Management of Data (SIGMOD) 2023. [arXiv][Proc.][Code]

Selected Awards

• SIGMOD 2024, Travel Grant (2024).

• ICPC World Finals 2019, 62rd Place (2019).

Invited Talks

• From RaBitQ to the Frontiers of Vector Search at Ant Group (Jan-25); Zilliz (Jan-25)

• Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search at Huawei Data Storage Technology Planning Dept (Aug-24); Huawei Theory Lab (Sep-24); ByteDance (Sep-24)

• Approximate Nearest Neighbor Search with Reliable Distance Comparison and Estimation at Huawei Cloud Database Innovation Lab (July-24)

• Approximate Nearest Neighbor Search with Reliable Distance Comparison at ByteDance (Oct-23)

Research Service

External Reviewer

• 2024: SIGMOD, VLDB, ICDE, SDM

• 2023: SIGMOD, ICDE, TKDE

• 2022: SIGMOD(demo), VLDB, ICDE