Renqiang Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Renqiang Luo has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Feng Xia
School of Computing Technologies, RMIT University
8 shared publications - Ziqi Xu
RMIT University, Melbourne, Australia
6 shared publications - Shuo Yu
School of Computer Science and Technology, Dalian University of Technology
5 shared publications - Huafei Huang
Adelaide University
4 shared publications - Mingliang Hou
Guangdong Institute of Smart Education, Jinan University, Guangzhou, China
3 shared publications - Dacheng Tao
Nanyang technological university, Singapore, Singapore
2 shared publications
Latest Publications
- Open Access
- 13 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (8) , 1-37
MoC-KT: Mixture of Convolutions for Knowledge Tracing
Knowledge Tracing (KT) aims to predict learners’ mastery levels of Knowledge Components (KCs) or test items based on their interaction records with educational content. Despite significant advancements in KT models, such as RNN-based sequence models and Transformer-based attention models, a critical limitation persists: the inability to account for the heterogeneity in learners’ cognitive behavior data. This limitation leads to the “cognitive mirage” phenomenon, where seemingly similar historical interaction sequences result in divergent future outcomes, hindering prediction accuracy. To address this challenge, we propose a novel framework, Mixture of Convolutions for KT (MoC-KT). The framework introduces multi-scale causal convolutional kernels and adaptive segmentation to disentangle learners’ long-term stable progression from short-term fluctuations, such as guessing or fatigue. Additionally, the Kerple-enhanced attention mechanism incorporates a distance-sensitive decay function to prioritize local dependencies while suppressing irrelevant distant interactions. This mechanism effectively balances attention between capturing local short-term fluctuations and preserving global long-term progression, thereby mitigating the cognitive mirage problem caused by learner data heterogeneity. Experimental results on 4 real-world datasets show that MoC-KT consistently outperforms 26 state-of-the-art KT models, offering higher predictive accuracy and more robust handling of complex learning data. The source code of MoC-KT is available at https://pykt.org/ .
- 13 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 44 (8) , 1-37
Open AccessMoC-KT: Mixture of Convolutions for Knowledge Tracing
Knowledge Tracing (KT) aims to predict learners’ mastery levels of Knowledge Components (KCs) or test items based on their interaction records with educational content. Despite significant advancements in KT models, such as RNN-based sequence models and Transformer-based attention models, a critical limitation persists: the inability to account for the heterogeneity in learners’ cognitive behavior data. This limitation leads to the “cognitive mirage” phenomenon, where seemingly similar historical interaction sequences result in divergent future outcomes, hindering prediction accuracy. To address this challenge, we propose a novel framework, Mixture of Convolutions for KT (MoC-KT). The framework introduces multi-scale causal convolutional kernels and adaptive segmentation to disentangle learners’ long-term stable progression from short-term fluctuations, such as guessing or fatigue. Additionally, the Kerple-enhanced attention mechanism incorporates a distance-sensitive decay function to prioritize local dependencies while suppressing irrelevant distant interactions. This mechanism effectively balances attention between capturing local short-term fluctuations and preserving global long-term progression, thereby mitigating the cognitive mirage problem caused by learner data heterogeneity. Experimental results on 4 real-world datasets show that MoC-KT consistently outperforms 26 state-of-the-art KT models, offering higher predictive accuracy and more robust handling of complex learning data. The source code of MoC-KT is available at https://pykt.org/ .
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (11) , 13685-13703
Artificial Intelligence in Autonomous Vehicles: A Survey From a Fairness Perspective
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (11) , 13685-13703
Artificial Intelligence in Autonomous Vehicles: A Survey From a Fairness Perspective
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 6586-6603
Fairness in Augmented Graph Learning: A Survey
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 6586-6603
Fairness in Augmented Graph Learning: A Survey
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 10126-10137
Investigating Reasoning in Large Language Models with Counterfactual Knowledge Graphs
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 10126-10137
Open AccessInvestigating Reasoning in Large Language Models with Counterfactual Knowledge Graphs
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 6512-6523
One Rounding Fits All: Memory-Efficient Approximation Algorithms for Partition-Constrained Influence Maximization
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 6512-6523
Open AccessOne Rounding Fits All: Memory-Efficient Approximation Algorithms for Partition-Constrained Influence Maximization
- 30 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. PP (01628828) , 1-17
Utility-Preserving Federated Graph Learning with Dual-Perspective Fairness
Fairness-aware federated graph neural networks (FedGNNs) necessitate consideration of both the server and the clients. However, fairness-aware methods struggle to enhance dual-perspective (i.e., server and clients) fairness without sacrificing utility due to the distributed learning framework. As a consequence, the utility sacrifices of fairness-aware graph learning methods are even exacerbated in federated frameworks. In this work we propose F3GL, a dual-perspective fairness federated graph learning method that enhances both global (for the server) and local fairness (for clients) while preserving utility. Through theoretical analysis, we delineate the similarity between original sensitive features and those after convolution under different spectra. Our findings reveal that only the principal eigenvalue contributes to enhancing this similarity. Moreover, our theoretical analysis applies universally to both clients and servers. Specifically, employing a specialized eigenvalue selection strategy allows for effective optimization of both local and global fairness. Drawing on these insights, we improve dual-perspective fairness through the lens of spectral graph theory without sacrificing utility. Experimental results on two real-world datasets show the superiority of F3GL over existing baselines.
- 30 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. PP (01628828) , 1-17
Utility-Preserving Federated Graph Learning with Dual-Perspective Fairness
Fairness-aware federated graph neural networks (FedGNNs) necessitate consideration of both the server and the clients. However, fairness-aware methods struggle to enhance dual-perspective (i.e., server and clients) fairness without sacrificing utility due to the distributed learning framework. As a consequence, the utility sacrifices of fairness-aware graph learning methods are even exacerbated in federated frameworks. In this work we propose F3GL, a dual-perspective fairness federated graph learning method that enhances both global (for the server) and local fairness (for clients) while preserving utility. Through theoretical analysis, we delineate the similarity between original sensitive features and those after convolution under different spectra. Our findings reveal that only the principal eigenvalue contributes to enhancing this similarity. Moreover, our theoretical analysis applies universally to both clients and servers. Specifically, employing a specialized eigenvalue selection strategy allows for effective optimization of both local and global fairness. Drawing on these insights, we improve dual-perspective fairness through the lens of spectral graph theory without sacrificing utility. Experimental results on two real-world datasets show the superiority of F3GL over existing baselines.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 4541-4552
FairGE: Fairness-Aware Graph Encoding in Incomplete Social Networks
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 4541-4552
Open AccessFairGE: Fairness-Aware Graph Encoding in Incomplete Social Networks
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3656-3665
Bridging Semantic Understanding and Popularity Bias with LLMs
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 3656-3665
Open AccessBridging Semantic Understanding and Popularity Bias with LLMs
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 9275-9285
When to Invoke: Refining LLM Fairness with Toxicity Assessment
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 9275-9285
Open AccessWhen to Invoke: Refining LLM Fairness with Toxicity Assessment
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8840-8850
Energy-Efficient Training-Free Zero-Inflation Correction for Rainfall Forecasting with Time-Series Foundation Models
Accurate rainfall forecasting is essential for climate and disaster management, but precipitation exhibits extreme zero inflation that modern time-series Foundation Models (TSFMs) fundamentally cannot represent due to their continuous regression outputs. This structural mismatch causes pervasive drizzle-like false alarms, miscalibrated nonzero intensities, and severely underdetected extremes, while retraining large TSFMs is computationally prohibitive and environmentally unsustainable for most regions. We present a training-free wrapper that corrects zero inflation for frozen TSFMs without updating any parameters. Our method restores discrete zero mass using empirical occurrence statistics, aligns positive-value distributions via probability-integral transforms, and applies Generalized Pareto tail mapping for extreme-value consistency. Experiments on South Australian rainfall show substantial gains with negligible overhead (<5,ms per forecast, compared to hundreds of GPU-hours for retraining). The proposed wrapper enables carbon-neutral, globally deployable climate services and directly advances the goals of UN SDG~13 (Climate Action).
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8840-8850
Open AccessEnergy-Efficient Training-Free Zero-Inflation Correction for Rainfall Forecasting with Time-Series Foundation Models
Accurate rainfall forecasting is essential for climate and disaster management, but precipitation exhibits extreme zero inflation that modern time-series Foundation Models (TSFMs) fundamentally cannot represent due to their continuous regression outputs. This structural mismatch causes pervasive drizzle-like false alarms, miscalibrated nonzero intensities, and severely underdetected extremes, while retraining large TSFMs is computationally prohibitive and environmentally unsustainable for most regions. We present a training-free wrapper that corrects zero inflation for frozen TSFMs without updating any parameters. Our method restores discrete zero mass using empirical occurrence statistics, aligns positive-value distributions via probability-integral transforms, and applies Generalized Pareto tail mapping for extreme-value consistency. Experiments on South Australian rainfall show substantial gains with negligible overhead (<5,ms per forecast, compared to hundreds of GPU-hours for retraining). The proposed wrapper enables carbon-neutral, globally deployable climate services and directly advances the goals of UN SDG~13 (Climate Action).