most citedFrom Large to Tiny: Distilling and Refining Mathematical Expertise for Math Word Problems with Weakly Supervision

4 citations · 5 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2025

Interpretable High-order Knowledge Graph Neural Network for Predicting Synthetic Lethality in Human Cancers

Xuexin Chen, Ruichu Cai, Zhengting Huang +3

Synthetic lethality (SL) is a promising gene interaction for cancer therapy. Recent SL prediction methods integrate knowledge graphs (KGs) into graph neural networks (GNNs) and emp…

cs.LG2024

Unifying Invariant and Variant Features for Graph Out-of-Distribution via Probability of Necessity and Sufficiency

Xuexin Chen, Ruichu Cai, Kaitao Zheng +4

Graph Out-of-Distribution (OOD), requiring that models trained on biased data generalize to the unseen test data, has considerable real-world applications. One of the most mainstre…

cs.CL2024★ 4 cited

From Large to Tiny: Distilling and Refining Mathematical Expertise for Math Word Problems with Weakly Supervision

Qingwen Lin, Boyan Xu, Zhengting Huang +1

Addressing the challenge of high annotation costs in solving Math Word Problems (MWPs) through full supervision with intermediate equations, recent works have proposed weakly super…

cs.LG2024

Unifying Invariance and Spuriousity for Graph Out-of-Distribution via Probability of Necessity and Sufficiency

Xuexin Chen, Ruichu Cai, Kaitao Zheng +4

Graph Out-of-Distribution (OOD), requiring that models trained on biased data generalize to the unseen test data, has a massive of real-world applications. One of the most mainstre…

cs.LG2024★ 1 cited

Feature Attribution with Necessity and Sufficiency via Dual-stage Perturbation Test for Causal Explanation

Xuexin Chen, Ruichu Cai, Zhengting Huang +5

We investigate the problem of explainability for machine learning models, focusing on Feature Attribution Methods (FAMs) that evaluate feature importance through perturbation tests…