Guoyu Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Guoyu Hu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Beng Chin Ooi
Zhejiang University, Hangzhou, China
3 shared publications - Alexander Sheng Ming Tan
Department of Vascular and Interventional Radiology, Singapore General Hospital, Singapore, Singapore
1 shared publication - Baofu Han
School of Cyber Science and Engineering, Southeast University, Nanjing, China
1 shared publication - Bing Li
School of Cyber Science and Engineering, Southeast University, Nanjing, China
1 shared publication - Hla Myint Htoon
Singapore Eye Research Institute
1 shared publication - Junjie Song
HuaZhong University of Science and Technology, Wuhan, Hubei, China
1 shared publication
Latest Publications
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-25
On Self-Designing Learned Indexes
Learned indexes show promising performance compared with traditional indexes. However, most existing learned index structures rely on fixed heuristics, which limit their robustness under dynamic workloads. In this paper, we present SELIX, a self-designing learned index that automatically generates and optimizes index structures tailored to different workloads. We introduce a unified index template that allows different nodes to adopt structural configurations, node layouts, conflict resolution policies, and search strategies for flexible and fine-grained structural composition. On top of this template, we formulate structural optimization as a learnable function that maps workload states to index configurations, enabling automated search for optimal structures in the vast design space. We train this function using a deep reinforcement learning paradigm enhanced with meta-learning, and propose a dedicated online update strategy, which together enable fast and stable structural adaptation under workload drift. Experimental results show that SELIX consistently outperforms state-of-the-art learned indexes (ALEX, LIPP, FITing-Tree, PGM, XIndex, and FINEdex) in both in-memory and on-disk settings, achieving significantly higher throughput across diverse and dynamic workloads.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-25
Open AccessOn Self-Designing Learned Indexes
Learned indexes show promising performance compared with traditional indexes. However, most existing learned index structures rely on fixed heuristics, which limit their robustness under dynamic workloads. In this paper, we present SELIX, a self-designing learned index that automatically generates and optimizes index structures tailored to different workloads. We introduce a unified index template that allows different nodes to adopt structural configurations, node layouts, conflict resolution policies, and search strategies for flexible and fine-grained structural composition. On top of this template, we formulate structural optimization as a learnable function that maps workload states to index configurations, enabling automated search for optimal structures in the vast design space. We train this function using a deep reinforcement learning paradigm enhanced with meta-learning, and propose a dedicated online update strategy, which together enable fast and stable structural adaptation under workload drift. Experimental results show that SELIX consistently outperforms state-of-the-art learned indexes (ALEX, LIPP, FITing-Tree, PGM, XIndex, and FINEdex) in both in-memory and on-disk settings, achieving significantly higher throughput across diverse and dynamic workloads.
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-25
FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances
Modern retrieval systems increasingly require integrating approximate nearest neighbor search (ANNS) with complex attribute filtering to handle hybrid queries in applications such as recommendation systems and retrieval-augmented generation (RAG). While HNSW-based inline-filtering methods show promise, existing approaches struggle to deliver high throughput under low-selectivity scenarios while balancing search efficiency, filtering generality, and index connectivity. To address these challenges, we propose FAVOR, an efficient filter-agnostic vector ANNS that supports arbitrary filtering conditions while maintaining stable performance across varying selectivity levels. FAVOR introduces three novel features: (1) an integrated architecture that unifies selectivity estimation and filtered ANNS execution, providing a cohesive solution for hybrid vector–attribute queries; (2) a HNSW-based inline-filtering algorithm that introduces an exclusion distance mechanism to dynamically reshape the vector distance distribution, pushing non-target vectors away from the query while promoting valid candidates toward the query, thus improving search efficiency without compromising generality or graph connectivity; and (3) a selectivity-driven search selector that estimates query selectivity and dynamically routes queries between a pre-filtering brute-force algorithm for low-selectivity cases and an optimized HNSW-based search algorithm for other scenarios, ensuring consistent performance. Extensive experiments on real-world datasets demonstrate that FAVOR achieves a 1.3–5× higher QPS at Recall@10 = 95% compared to state-of-the-art methods for arbitrary filtering conditions, while maintaining competitive performance even against tailored solutions in some filtering conditions.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-25
Open AccessFAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances
Modern retrieval systems increasingly require integrating approximate nearest neighbor search (ANNS) with complex attribute filtering to handle hybrid queries in applications such as recommendation systems and retrieval-augmented generation (RAG). While HNSW-based inline-filtering methods show promise, existing approaches struggle to deliver high throughput under low-selectivity scenarios while balancing search efficiency, filtering generality, and index connectivity. To address these challenges, we propose FAVOR, an efficient filter-agnostic vector ANNS that supports arbitrary filtering conditions while maintaining stable performance across varying selectivity levels. FAVOR introduces three novel features: (1) an integrated architecture that unifies selectivity estimation and filtered ANNS execution, providing a cohesive solution for hybrid vector–attribute queries; (2) a HNSW-based inline-filtering algorithm that introduces an exclusion distance mechanism to dynamically reshape the vector distance distribution, pushing non-target vectors away from the query while promoting valid candidates toward the query, thus improving search efficiency without compromising generality or graph connectivity; and (3) a selectivity-driven search selector that estimates query selectivity and dynamically routes queries between a pre-filtering brute-force algorithm for low-selectivity cases and an optimized HNSW-based search algorithm for other scenarios, ensuring consistent performance. Extensive experiments on real-world datasets demonstrate that FAVOR achieves a 1.3–5× higher QPS at Recall@10 = 95% compared to state-of-the-art methods for arbitrary filtering conditions, while maintaining competitive performance even against tailored solutions in some filtering conditions.
- 1 July 2025
- Published by Taylor & Francis in Orbit
- Vol. 44 (6) , 799-807
Orbital CT deep learning models in thyroid eye disease rival medical specialists’ performance in optic neuropathy prediction in a quaternary referral center and revealed impact of the bony walls
To develop and evaluate orbital CT deep learning (DL) models in optic neuropathy (ON) prediction in patients diagnosed with thyroid eye disease (TED), using partial versus entire 2D versus 3D images for input. Patients with TED ±ON diagnosed at a quaternary-level practice and who underwent orbital CT between 2002 and 2017 were included. DL models were developed using annotated CT data. The DL models were used to evaluate the hold-out test set. ON classification performances were compared between models and medical specialists, and saliency maps applied to randomized cases. 36/252 orbits in 126 TED patients (mean age, 51 years; 81 women) had clinically confirmed ON. With 2D image input for ON prediction, our models achieved (a) sensitivity 89%, AUC 0.86 on entire coronal orbital apex including bony walls, and (b) specificity 92%, AUC 0.79 on partial axial lateral orbital wall only annotations. ON classification performance was similar (p = 0.58) between DL model and medical specialists. DL models trained on 2D CT annotations rival medical specialists in ON classification, with potential to objectively enhance clinical triage for sight-saving intervention and incorporate model variants in the workflow to harness differential performance metrics.
- 1 July 2025
- Published by Taylor & Francis in Orbit
- Vol. 44 (6) , 799-807
Orbital CT deep learning models in thyroid eye disease rival medical specialists’ performance in optic neuropathy prediction in a quaternary referral center and revealed impact of the bony walls
To develop and evaluate orbital CT deep learning (DL) models in optic neuropathy (ON) prediction in patients diagnosed with thyroid eye disease (TED), using partial versus entire 2D versus 3D images for input. Patients with TED ±ON diagnosed at a quaternary-level practice and who underwent orbital CT between 2002 and 2017 were included. DL models were developed using annotated CT data. The DL models were used to evaluate the hold-out test set. ON classification performances were compared between models and medical specialists, and saliency maps applied to randomized cases. 36/252 orbits in 126 TED patients (mean age, 51 years; 81 women) had clinically confirmed ON. With 2D image input for ON prediction, our models achieved (a) sensitivity 89%, AUC 0.86 on entire coronal orbital apex including bony walls, and (b) specificity 92%, AUC 0.79 on partial axial lateral orbital wall only annotations. ON classification performance was similar (p = 0.58) between DL model and medical specialists. DL models trained on 2D CT annotations rival medical specialists in ON classification, with potential to objectively enhance clinical triage for sight-saving intervention and incorporate model variants in the workflow to harness differential performance metrics.