Bohang Zhang
Also known as 张博航
Bohang Zhang is a machine-learning researcher whose papers study how graph neural networks represent graph structure. He earned a computer-science B.S. at Xi’an Jiaotong University and completed doctoral study at Peking University. His papers examined certified robustness for Lipschitz networks, graph biconnectivity, quantitative GNN expressiveness, and spectral-invariant graph networks. ICLR gave his biconnectivity paper a 2023 Outstanding Paper Award and named his 2024 GNN framework an Honorable Mention. As of October 2026, his research focuses on the foundations of machine learning.
- Works
- 9
- Citations
- 44
- h-index
- 3
Publication numbers from OpenAlex, as of 19 October 2026.
Timeline
-
2013–2019
Studying computer science
He earns a B.S. in computer science at Xi’an Jiaotong University’s School of the Gifted Young in 2019.
-
2019–2024
A Ph.D. at Peking
He pursues doctoral study in Peking University’s School of Electronic Engineering and Computer Science from 2019 to 2024 and is a Ph.D. graduate at the university.
-
2022
Certified robustness for neural nets
He coauthors a NeurIPS 2022 paper that studies certified ℓ∞ robustness through Boolean-function representations.
-
2023
A GNN paper on biconnectivity
He coauthors “Rethinking the Expressive Power of GNNs via Graph Biconnectivity,” which introduces Generalized Distance Weisfeiler-Lehman as a method for biconnectivity metrics. ICLR gives the paper an Outstanding Paper Award in 2023.
-
2024
Quantifying GNN expressiveness
He coauthors “Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness,” which uses homomorphism expressivity to measure how GNNs count graphs. ICLR names the paper an Honorable Mention in its 2024 Outstanding Paper awards.
-
2025
Spectral invariant graph networks
He coauthors “Homomorphism Expressivity of Spectral Invariant Graph Neural Networks,” showing that spectral-invariant GNNs can count a class of tree-like graphs. The work appears at ICLR 2025.
-
As of October 2026
Machine-learning foundations
As of October 2026, his main research area is the foundations of machine learning.
Career
Education
- 2024Peking UniversityPhD
- 2019Xi'an Jiaotong UniversityB.S.
Most-cited works
- Rethinking the Expressive Power of GNNs via Graph Biconnectivity
- Can Graph Learning Improve Planning in LLM-based Agents?
- A Complete Expressiveness Hierarchy for Subgraph GNNs via Subgraph Weisfeiler-Lehman Tests
- Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
- How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern ComprehensionWith Jiliang Tang
Sources and credits
Photo: We have no published photo of Bohang Zhang yet. Send us a free-licensed photo.
- CV - Bohang Zhang’s Homepage (张博航)
- About Me - Bohang Zhang’s Homepage (张博航)
- Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspective
- Rethinking the Expressive Power of GNNs via Graph Biconnectivity
- About Me - Di He (贺笛)
- Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
- Jingchu Gai
- Homomorphism Expressivity of Spectral Invariant Graph Neural Networks


