Xintong He

dblp:306/2626 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Efficient and distributed learning · 44% Probabilistic and Bayesian machine learning · 32% Graph learning · 24%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 50% Reconfigurable computing and FPGAs · 50%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 12 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA accelerator
1.012026
FPGA-Friendly Architecture of Processing Elements for Efficient and Accurate Quantized CNNs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator
1.012026
FPGA-Friendly Architecture of Processing Elements for Efficient and Accurate Quantized CNNs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Reconfigurable computing and FPGAs › coarse-grained reconfigurable architecture
processing element design
1.012026
FPGA-Friendly Architecture of Processing Elements for Efficient and Accurate Quantized CNNs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Hardware accelerators and domain-specific architectures › machine learning accelerator › neural network acceleration
quantized CNN accelerator
1.012026
FPGA-Friendly Architecture of Processing Elements for Efficient and Accurate Quantized CNNs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Machine learning › Efficient and distributed learning
federated learning
0.912025
Personalized federated few-shot node classification · Sci. China Inf. Sci. 2025
Machine learning › Graph learning › graph neural network › node classification
few-shot node classification
0.912025
Personalized federated few-shot node classification · Sci. China Inf. Sci. 2025
Machine learning › Efficient and distributed learning › federated learning
personalized federated learning
0.912025
Personalized federated few-shot node classification · Sci. China Inf. Sci. 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.812024
Federated Causality Learning with Explainable Adaptive Optimization · AAAI 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
federated causal discovery
0.812024
Federated Causality Learning with Explainable Adaptive Optimization · AAAI 2024
Security and privacy of machine learning
federated learning
0.812024
Federated Causality Learning with Explainable Adaptive Optimization · AAAI 2024
Machine learning › Efficient and distributed learning › model compression › quantization
quantization-aware training
0.312026
FPGA-Friendly Architecture of Processing Elements for Efficient and Accurate Quantized CNNs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Machine learning › Graph learning › graph neural network
node classification
0.312025
Personalized federated few-shot node classification · Sci. China Inf. Sci. 2025

Methods — techniques the papers use, named apart from their topics

weight decay · 2.0quantization-aware training · 2.0logarithmic floating-point · 2.0directed acyclic graph learning · 1.5continuous optimization · 1.5meta-learning · 0.9graph neural network · 0.9
YearPublicationVenuePosition
2026 FPGA-Friendly Architecture of Processing Elements for Efficient and Accurate Quantized CNNs
abstract
An FPGA-friendly processing element based on the small logarithmic floating-point (SLFP) format is proposed. The proposed processing elements not only support inner product but also perform various nonlinear activation functions (NAF), which consume 674× LUT6s and 7× DSPs and operate at 450MHz in a pipeline manner for Zynq-7000. In addition, as the distribution of SLFP numbers is not uniform, this brief revises the weight decay scheme in the quantization aware training process to explore the optimum quantized weights. Compared with INT8 based design, the proposed method balances the resource usage between lookup tables and digital signal processing blocks. The accuracy loss of the quantized model based on the 8-bit SLFP is also small due to the high dynamic range of SLFP format. Moreover, since the proposed method can support different NAFs, this brief improves the quantized model accuracy by selecting an appropriate NAF from Swish, GELU, Mish and PReLU. Compared to the baseline (parameters are FP32, NAF is ReLU), the accuracy of quantized ResNet-50 and MobileNet is increased by 2.65% and -0.33%.
Botao Xiong, Shize Zhang, Xingyu Shao, Xintong He, Yuchun Chang 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4
2025 Personalized federated few-shot node classification
Xintong He, Guoxian Yu, Jun Wang 0035, Yongqing Zheng, Carlotta Domeniconi
Sci. China Inf. Sci.2
2024 Federated Causality Learning with Explainable Adaptive Optimization
abstract
Discovering the causality from observational data is a crucial task in various scientific domains. With increasing awareness of privacy, data are not allowed to be exposed, and it is very hard to learn causal graphs from dispersed data, since these data may have different distributions. In this paper, we propose a federated causal discovery strategy (FedCausal) to learn the unified global causal graph from decentralized heterogeneous data. We design a global optimization formula to naturally aggregate the causal graphs from client data and constrain the acyclicity of the global graph without exposing local data. Unlike other federated causal learning algorithms, FedCausal unifies the local and global optimizations into a complete directed acyclic graph (DAG) learning process with a flexible optimization objective. We prove that this optimization objective has a high interpretability and can adaptively handle homogeneous and heterogeneous data. Experimental results on synthetic and real datasets show that FedCausal can effectively deal with non-independently and identically distributed (non-iid) data and has a superior performance.
Dezhi Yang, Xintong He, Jun Wang 0035, Guoxian Yu, Carlotta Domeniconi, Jinglin Zhang 0001
AAAI2
2021 Decision Graph and Matrix Visualization during Interdisciplinary Engineering Collaboration
abstract
Today’s mechatronic systems are becoming more and more complex as the development and design processes require collaboration across multiple engineering disciplines. The high complexity between loosely connected models results in a disconnect between these inter-disciplinary models, which may cause delays and costly rework in the long run. There is a need for an effective method to show the dependencies and risks across models for various stakeholder groups. Currently, the discussion about such methods is limited. This paper proposes and evaluates a user-friendly Decision Graph and Matrix Visualization method that combines network-based and matrix-based techniques to assist stakeholders in tracking dependencies and risks across models. The method is applied and demonstrated with a design and engineering case of a lab-scale production system, whose usability was tested formatively with experts.
Haya Elaraby, Alison Olechowski, Greg A. Jamieson, Xintong He, Minjie Zou, Dorothea Pantförder 0001, Birgit Vogel-Heuser
IECON4