About

I am a second-year Ph.D. student at the University of Edinburgh, School of Informatics, supervised by He Sun and Yang Cao. My research is centered on theory of machine learning. Recently, I am looking for an internship in modern AI.

Graph Theory & Spectral Clustering Combinatorial Optimization Machine Learning Theory Clustering Algorithms Metric Algorithms

News

Sep 25, 2026
Our paper “Constrained Spectral Clustering with Theoretical Guarantee” has been accepted by NeurIPS 2026. See you in Sydney~
Sep 6, 2025
I have joined the University of Edinburgh to pursue my Ph.D~

Education

Ph.D. in Informatics (fully funded)
University of Edinburgh, School of Informatics
Sep 2025 – Present  ·  Supervisors: He Sun, Yang Cao
Master of Computer Science & Engineering
University of Science and Technology of China (USTC)
Sep 2022 – Jun 2025  ·  Supervisor: Hu Ding
Bachelor of Information Security & Engineering
Nanjing University of Aeronautics and Astronautics (NUAA)
Sep 2018 – Jun 2022  ·  GPA: 4.1 / 5.0

Publications

ICLR 2027 (Under Review)
Fully Dynamic Hierarchical Clustering for Well-Clustered Graphs
Shihong Song, He Sun
We proposed an O(1)-approximation fully dynamic algorithm for the Dasgupta hierarchical clustering problem in well-clustered graphs.
Preprint 2026
A (3 + ε)-Approximation for Fair k-Means and a Matching Lower Bound
Kangke Cheng, Guanlin Mo, Shihong Song, Hu Ding
We improved the approximation ratio to 3 + ε for fair k-means and proved a matching lower bound.
NeurIPS 2026
Constrained Spectral Clustering with Theoretical Guarantee
Shihong Song, He Sun
We proposed a constant approximate algorithm for constrained clustering.
ICLR 2025
Relax and Merge: A Simple Yet Effective Framework for Solving Fair k-Means and k-sparse Wasserstein Barycenter Problems
Shihong Song, Guanlin Mo, Hu Ding
We improved the approximation ratio to 5 + ε for fair k-means.
SIGMOD 2024
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms
Guanlin Mo, Shihong Song (co-first author), Hu Ding
We proposed a faster DBSCAN algorithm on general metric space.
AAAI 2026
Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High Dimensions
Kangke Cheng, Shihong Song, Guanlin Mo, Hu Ding
We achieved a better approximation ratio for k-means objective under learning augmented setting.
ICLR 2025
To Tackle Adversarial Transferability: A Novel Ensemble Training Method with Fourier Transformation
Wanlin Zhang, Weichen Lin, Ruomin Huang, Shihong Song, Hu Ding
A better robust training method against adversarial transferability.

Scholarships & Awards

Edinburgh Doctoral College Scholarship — only one in School of Informatics per year Sep 2025
Outstanding Graduate Award of USTC Apr 2025
China National Scholarship for Master Student Oct 2024
Postgraduate Academic Scholarship of USTC Oct 2023
Honorable Mention of Accomplished Student Scholarship of NUAA Mar 2022
China National Scholarship for Undergraduate Student Oct 2021
Scholarship for Outstanding Students of NUAA Dec 2021
Honorable Mention — 45th ACM-ICPC International Collegiate Programming Contest 2021
Meritorious Winner — Mathematical Contest in Modeling (MCM) Mar 2021
Second Award (Team) — China Collegiate Computer Contest Mar 2021
First Class Award — National College Student Mathematics Competition (China) Oct 2020
First Class Academic Scholarship of NUAA Apr 2019, Apr 2020

Services & Certificates

(Sub) Reviewer — STOC 2026 2025
Reviewer — AAAI, ICML, NeurIPS 2025 – present
11th Heidelberg Laureate Forum (HLF) Alumni — ≈200 students selected per year Sep 2024
Coursera: Reinforcement Learning (University of Alberta) Mar 2026
Coursera: Neural Networks and Deep Learning — deeplearning.ai (Grade: 98.43) Mar 2022
Coursera: Machine Learning — Stanford University (Grade: 93.16%) Jan 2022