Qihao Cheng

Qihao Cheng

Auto-generated profile, based on publicly available information

Qihao Cheng

Tsinghua University, Beijing, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 February 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
QCQihao Cheng
Qihao Cheng
DYDa Yan
Da Yan
TWTianhao Wu
Tianhao Wu
ZHZhongyi Huang
Zhongyi Huang
QZQin Zhang
Qin Zhang
Given a graph pair (G 1 , G 2 ), graph edit distance (GED) is defined as the minimum number of edit operations converting G 1 to G 2 . GED is a fundamental operation widely used in many applications, but its exact computation is NP-hard, so the approximation of GED has gained a lot of attention. Data-driven learning-based methods have been found to provide superior results compared to classical approximate algorithms, but they directly fit the coupling relationship between a pair of vertices from their vertex features. We argue that while pairwise vertex features can capture the coupling cost (discrepancy) of a pair of vertices, the vertex coupling matrix should be derived from the vertex-pair cost matrix through a more well-established method that is aware of the global context of the graph pair, such as optimal transport. In this paper, we propose an ensemble approach that integrates a supervised learning-based method and an unsupervised method, both based on optimal transport. Our learning method, GEDIOT, is based on inverse optimal transport that leverages a learnable Sinkhorn algorithm to generate the coupling matrix. Our unsupervised method, GEDGW, models GED computation as a linear combination of optimal transport and its variant, Gromov-Wasserstein discrepancy, for node and edge operations, respectively, which can be solved efficiently without needing the ground truth. Our ensemble method, GEDHOT, combines GEDIOT and GEDGW to further boost the performance. Extensive experiments demonstrate that our methods significantly outperform the existing methods in terms of the performance of GED computation, edit path generation, and model generalizability.

1 March 2025 in Physics of Fluids
Verified
Journal Article
Closed access
BLBo Liu
Bo Liu
HHHaoshen He
Haoshen He
QCQihao Cheng
Qihao Cheng
JWJingdi Wan
Jingdi Wan
YLYang Liu
Yang Liu
High-order accuracy and high-resolution numerical schemes have been extensively utilized in computational fluid dynamics (CFD) and computational aeroacoustics (CAA) for their ability to precisely capture wave shapes. This paper introduces a novel finite difference scheme, the Neural Network Optimized Dispersion and Localized Adaptive Dissipation (NNoD-LAD) scheme, which combines a dispersion model and a dissipation model to achieve fourth-order accuracy and exceptional resolution. The NNoD-LAD's dispersion model is designed to address different wavenumber ranges effectively. For the low-intermediate wavenumber range, the dispersion coefficient is set to ensure zero dispersion error, guaranteeing accuracy. In the high wavenumber range, a fully connected neural network optimizes the coefficient to minimize dispersion error while maintaining numerical stability. The dissipation model in the NNoD-LAD scheme adjusts dissipation flexibly based on the wavenumber and solution variation. This improves simulation capabilities in the low-intermediate wavenumber range and effectively suppresses spurious oscillations in the high wavenumber range. Additionally, a new scale information recognizer has been developed to accurately compute the local wavenumber, at half-point locations. Numerical tests demonstrate that the NNoD-LAD scheme offers higher resolution compared to previous spectrally optimized schemes, making it a promising tool for CFD and CAA applications.


22 June 2025
Verified
Conference Paper
Open access
QCQihao Cheng
Qihao Cheng
FYFeng Yu
Feng Yu
XXXianghong Xu
Xianghong Xu
XHXiao He
Xiao He
TZTieying Zhang
Tieying Zhang
We successfully reproduced the key performance results that presented in Tables~3 and~4 of the original paper. The authors provided a GitHub repository. https://github.com/bytedance/plm4ndv that includes the implementation, detailed build and execution instructions, and links to the datasets used in the experiments. We appreciate the authors' assistance with environment setup and debugging.

8 September 2025
Verified
Conference Paper
Open access
TWTianhao Wu
Tianhao Wu
DYDa Yan
Da Yan
QCQihao Cheng
Qihao Cheng
LYLyuheng Yuan
Lyuheng Yuan
SDSheng Di
Sheng Di
JCJi Cheng
Ji Cheng