Na Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Na Chen has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jincheng Huang
School of Computer Science, Southwest Petroleum University, China
2 shared publications - Ping Li
School of Computer Science and Software Engineering, Southwest Petroleum University, Chengdu, China
2 shared publications - Acong Zhang
School of Computer Science and engineering, Central South University, Changsha, China
1 shared publication - Guangda Zhang
Academy of Military Sciences, Beijing, China
1 shared publication - Huiquan Wang
School of Life Sciences, Tiangong University, Tianjin, China
1 shared publication - Jun Xia
Sino-US Global Logistics Institute, Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China
1 shared publication
Latest Publications
- Open Access
- 15 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (3) , 1-23
Denoising Structure against Adversarial Attacks on Graph Representation Learning
Despite their excellent performance in graph representation learning, graph convolutional networks have been proved to be vulnerable to adversarial perturbations on the connectivity between nodes in an unnoticed manner. In this work, by looking into the impacts of adversarial attacks on graph data, we empirically find that the dominant edge-addition attacks generally increase the heterophily between connected nodes, which will fool the transductive inference models on node classification task. To defend against such attacks, we develop a Two-Stage Denoising (TSD) method that aims at removing possible malicious edges so as to mitigate the heterophily issue introduced by attacks. In particular, after a rough removal of the links that have quite low feature similarity, our method further spots the potentially heterophilous links by predicting node labels with a multi-view labeling consensus. This design is based on assumption that if the label predictions for the same node from two different views of a graph data are consistent, then we have a high chance to acquire the reliable labeling. The experiments demonstrate that by denoising a graph this way, the robustness of graph convolutional networks on node classification task is remarkably improved, compared to several strong competitive robust graph neural network models.
- 15 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 16 (3) , 1-23
Open AccessDenoising Structure against Adversarial Attacks on Graph Representation Learning
Despite their excellent performance in graph representation learning, graph convolutional networks have been proved to be vulnerable to adversarial perturbations on the connectivity between nodes in an unnoticed manner. In this work, by looking into the impacts of adversarial attacks on graph data, we empirically find that the dominant edge-addition attacks generally increase the heterophily between connected nodes, which will fool the transductive inference models on node classification task. To defend against such attacks, we develop a Two-Stage Denoising (TSD) method that aims at removing possible malicious edges so as to mitigate the heterophily issue introduced by attacks. In particular, after a rough removal of the links that have quite low feature similarity, our method further spots the potentially heterophilous links by predicting node labels with a multi-view labeling consensus. This design is based on assumption that if the label predictions for the same node from two different views of a graph data are consistent, then we have a high chance to acquire the reliable labeling. The experiments demonstrate that by denoising a graph this way, the robustness of graph convolutional networks on node classification task is remarkably improved, compared to several strong competitive robust graph neural network models.
- 24 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
A Speed Up Method towards DDR Subsystem Functional Verification in SoC
As CMOS technology is approaching atomic feature size, the complexity of SoC (System on Chip) is increasing. As a result, the SoC verification is facing increased challenges, which calls for the development of a new system-level verification methodology. En route to system-level verifications for SoCs, an efficient method for speeding up the SoC verification is the main desideratum. To this end, this paper proposes an efficient method for speeding up subsystem-level functional verification, and takes DDR subsystem in a SoC design as an example to validate the proposed method. A bypass skill is utilized in the speeding up method. Through replacing the DDR configuration interface (a DDR AHB bus connecting to CPU) with another faster designed AHB bus, the proposed speeding up technique takes advantage of a series of tasks within the designed initialization master, which are faster than the same operations which are issued from CPU. The experimental results show that our proposed speeding up approach is efficient, and the running time speed up ratios reach 7.0×, 6.8×, 11.6× for RTL-level simulations, gate-level simulations without back-annotation, and gate-level simulations with back-annotation, respectively.
- 24 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
A Speed Up Method towards DDR Subsystem Functional Verification in SoC
As CMOS technology is approaching atomic feature size, the complexity of SoC (System on Chip) is increasing. As a result, the SoC verification is facing increased challenges, which calls for the development of a new system-level verification methodology. En route to system-level verifications for SoCs, an efficient method for speeding up the SoC verification is the main desideratum. To this end, this paper proposes an efficient method for speeding up subsystem-level functional verification, and takes DDR subsystem in a SoC design as an example to validate the proposed method. A bypass skill is utilized in the speeding up method. Through replacing the DDR configuration interface (a DDR AHB bus connecting to CPU) with another faster designed AHB bus, the proposed speeding up technique takes advantage of a series of tasks within the designed initialization master, which are faster than the same operations which are issued from CPU. The experimental results show that our proposed speeding up approach is efficient, and the running time speed up ratios reach 7.0×, 6.8×, 11.6× for RTL-level simulations, gate-level simulations without back-annotation, and gate-level simulations with back-annotation, respectively.
- Open Access
- 6 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (1) , 1-17
Revisiting the Role of Heterophily in Graph Representation Learning: An Edge Classification Perspective
Graph representation learning aims at integrating node contents with graph structure to learn nodes/graph representations. Nevertheless, it is found that many existing graph learning methods do not work well on data with high heterophily level that accounts for a large proportion of edges between different class labels. Recent efforts to this problem focus on improving the message passing mechanism. However, it remains unclear whether heterophily truly does harm to the performance of graph neural networks (GNNs). The key is to unfold the relationship between a node and its immediate neighbors, e.g., are they heterophilous or homophilious? From this perspective, here we study the role of heterophily in graph representation learning before/after the relationships between connected nodes are disclosed. In particular, we propose an end-to-end framework that both learns the type of edges (i.e., heterophilous/homophilious) and leverage edge type information to improve the expressiveness of graph neural networks. We implement this framework in two different ways. Specifically, to avoid messages passing through heterophilous edges, we can optimize the graph structure to be homophilious by dropping heterophilous edges identified by an edge classifier. Alternatively, it is possible to exploit the information about the presence of heterophilous neighbors for feature learning, so a hybrid message passing approach is devised to aggregate homophilious neighbors and diversify heterophilous neighbors based on edge classification. Extensive experiments demonstrate the remarkable performance improvement of GNNs with the proposed framework on multiple datasets across the full spectrum of homophily level.
- 6 September 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (1) , 1-17
Open AccessRevisiting the Role of Heterophily in Graph Representation Learning: An Edge Classification Perspective
Graph representation learning aims at integrating node contents with graph structure to learn nodes/graph representations. Nevertheless, it is found that many existing graph learning methods do not work well on data with high heterophily level that accounts for a large proportion of edges between different class labels. Recent efforts to this problem focus on improving the message passing mechanism. However, it remains unclear whether heterophily truly does harm to the performance of graph neural networks (GNNs). The key is to unfold the relationship between a node and its immediate neighbors, e.g., are they heterophilous or homophilious? From this perspective, here we study the role of heterophily in graph representation learning before/after the relationships between connected nodes are disclosed. In particular, we propose an end-to-end framework that both learns the type of edges (i.e., heterophilous/homophilious) and leverage edge type information to improve the expressiveness of graph neural networks. We implement this framework in two different ways. Specifically, to avoid messages passing through heterophilous edges, we can optimize the graph structure to be homophilious by dropping heterophilous edges identified by an edge classifier. Alternatively, it is possible to exploit the information about the presence of heterophilous neighbors for feature learning, so a hybrid message passing approach is devised to aggregate homophilious neighbors and diversify heterophilous neighbors based on edge classification. Extensive experiments demonstrate the remarkable performance improvement of GNNs with the proposed framework on multiple datasets across the full spectrum of homophily level.