Guolong Zheng

Dr. Guolong Zheng

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
10 October 2022
Verified
Conference Paper
Open access
SBSimón Gutiérrez Brida
Simón Gutiérrez Brida
GRGermán Regis
Germán Regis
GZGuolong Zheng
Guolong Zheng
HBHamid Bagheri
Hamid Bagheri
TNThanhvu Nguyen
Thanhvu Nguyen
MFMarcelo Frias
Marcelo Frias
Automated program repair (APR) techniques have shown great success in automatically finding fixes for programs in programming languages such as C or Java. In this work, we focus on repairing formal specifications, in particular for the Alloy specification language. As opposed to most APR tools, our approach to repair Alloy specifications, named ICEBAR, does not use test-based oracles for patch assessment. Instead, ICEBAR relies on the use of property-based oracles, commonly found in Alloy specifications as predicates and assertions. These property-based oracles define stronger conditions for patch assessment, thus reducing the notorious overfitting issue caused by using test-based oracles, typically observed in APR contexts. Moreover, as assertions and predicates are inherent to Alloy, whereas test cases are not, our tool is potentially more appealing to Alloy users than test-based Alloy repair tools. At a high level, ICEBAR is an iterative, counterexample-based process, that generates and validates repair candidates. ICEBAR receives a faulty Alloy specification with a failing property-based oracle, and uses Alloy’s counterexamples to build tests and feed ARepair, a test-based Alloy repair tool, in order to produce a repair candidate. The candidate is then checked against the property oracle for overfitting: if the candidate passes, a repair has been found; if not, further counterexamples are generated to construct tests and enhance the test suite, and the process is iterated. ICEBAR includes different mechanisms, with different degrees of reliability, to generate counterexamples from failing predicates and assertions. Our evaluation shows that ICEBAR significantly improves over ARepair, in both reducing overfitting and improving the repair rate. Moreover, ICEBAR shows that iterative refinement allows us to significantly improve a state-of-the-art tool for automated repair of Alloy specifications without any modifications to the tool.

12 December 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
HGHuijie Guo
Huijie Guo
THTao Huang
Tao Huang
ZRZhiqiang Ruan
Zhiqiang Ruan
XYXuechao Yang
Xuechao Yang
ZCzhide chen
zhide chen
CFChen Feng
Chen Feng
Functional movement screening (FMS) is a crucial testing method that evaluates fundamental movement patterns in the human body and identifies functional limitations. However, due to the inherent complexity of human movements, the automated assessment of FMS poses significant challenges. Prior methodologies have struggled to effectively capture and model critical human features in video data. To address this challenge, this paper introduces an automatic assessment approach for FMS by leveraging deep learning techniques. The proposed method harnesses an I3D network to extract spatiotemporal video features across various scales and levels. Additionally, an attention mechanism (AM) module is incorporated to enable the network to focus more on human movement characteristics, enhancing its sensitivity to diverse location features. Furthermore, the multilayer perceptron (MLP) module is employed to effectively discern intricate patterns and features within the input data, facilitating its classification into multiple categories. Experimental evaluations conducted on publicly available datasets demonstrate that the proposed approach achieves state-of-the-art performance levels. Notably, in comparison to existing state-of-the-art (SOTA) methods, this approach exhibits a marked improvement in accuracy. These results corroborate the efficacy of the I3D-AM-MLP framework, indicating its significance in extracting advanced human movement feature expressions and automating the assessment of functional movement screening.

30 April 2025 in Discover Computing
Verified
Journal Article
Open access
PDF file
THTao Huang
Tao Huang
XSXin Shi
Xin Shi
QHQingyu Huang
Qingyu Huang
ZCZiyang Chen
Ziyang Chen
LJLiang Jiang
Liang Jiang
WYWencheng Yang
Wencheng Yang
As artificial intelligence continues to drive advancements in computer vision, particularly in areas such as image analysis, object detection, and facial recognition, the ability to accurately recognize patterns in visual data has become a central focus of research. However, alongside these advances, concerns about the privacy risks associated with the training data used in AI models have also gained prominence. Deep learning models, frequently employed in computer vision tasks, can unintentionally expose sensitive information from the data they are trained on, raising the need for comprehensive research into privacy-preserving techniques. This paper explores the intersection of AI-driven pattern recognition and the privacy risks involved in training models on image data. Existing studies show that attackers can exploit the gradients from deep learning processes to reconstruct original image data, including personal and identifiable information, such as facial features. By iteratively adjusting input data, attackers can minimize the difference between the gradients of the random and stolen data, leading to the full reconstruction of private images. Current privacy protection methods fall short of explaining the relationship between an attacker’s capacity to recover visual data and the structure of the targeted model. This paper introduces a novel privacy auditing framework that directly assesses the extent to which gradient-based attacks can reconstruct sensitive data. Unlike traditional methods, which mainly focus on mitigating privacy risks through model regularization or data obfuscation, our approach provides a systematic and quantitative evaluation of gradient leakage, filling a critical gap in existing privacy protection techniques. This paper investigates the relationships among reconstructed data, model gradients, and the original input data in the context of computer vision. By formalizing the connection between gradient similarity and data similarity, we propose a novel methodology that quantifies the vulnerability of deep learning models to data reconstruction attacks. Building on these insights, we propose a novel privacy auditing method aimed at evaluating the privacy risks associated with deep learning models used in pattern recognition for image data.

9 January 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
GYge yanning
ge yanning
THTao Huang
Tao Huang
XWXiaoding Wang
Xiaoding Wang
GZGuolong Zheng
Guolong Zheng
XYXU Yang
XU Yang
In the domain of reinforcement learning (RL), deriving efficacious state representations and maintaining algorithmic stability are crucial for optimal agent performance. However, the inherent dynamism of state representations often complicates the normalization procedure. To overcome these challenges, we present an innovative RL framework that integrates state normalization techniques with residual connections and incorporates attention mechanisms into generative adversarial imitation learning (GAIL). This combination not only enhances the expressive capability of state representations, thereby improving the agent’s accuracy in state recognition, but also significantly mitigates the common issues of gradient dissipation and explosion. Compared to traditional RL algorithms, GAIL combined with the residual connection-based state normalization method empowers the agent to markedly reduce the exploration duration such that feedback concerning rewards in the current state can be provided in real time. Empirical evaluations demonstrate the superior efficacy of this methodology across various RL environments.

5 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
THTao Huang
Tao Huang
QHQingyu Huang
Qingyu Huang
XSXin Shi
Xin Shi
JMJiayang Meng
Jiayang Meng
GZGuolong Zheng
Guolong Zheng
XYXun Yi
Xun Yi
In the domain of deep learning, the challenge of protecting sensitive data while maintaining model utility is significant. Traditional Differential Privacy (DP) techniques such as Differentially Private Stochastic Gradient Descent (DP-SGD) typically employ strategies like direct or per-sample adaptive gradient clipping. These methods, however, compromise model accuracy due to their critical influence on gradient handling, particularly neglecting the significant contribution of small gradients during later training stages. In this paper, we introduce an enhanced version of DP-SGD, named Differentially Private Per-sample Adaptive Scaling Clipping (DP-PSASC). This approach replaces traditional clipping with non-monotonous adaptive gradient scaling, which alleviates the need for intensive threshold setting and rectifies the disproportionate weighting of smaller gradients. Our contribution is twofold. First, we develop a novel gradient scaling technique that effectively assigns proper weights to gradients, particularly small ones, thus improving learning under differential privacy. Second, we integrate a momentum-based method into DP-PSASC to reduce bias from stochastic sampling, enhancing convergence rates. Our theoretical and empirical analyses confirm that DP-PSASC preserves privacy and delivers superior performance across diverse datasets, setting new standards for privacy-sensitive applications.

16 November 2026 in Fractal and Fractional
Verified
Journal Article
Open access
PDF file
GZGuolong Zheng
Guolong Zheng
CHChen Hou
Chen Hou
THTao Huang
Tao Huang
Variable-order fractional partial differential equations describe heterogeneous anomalous diffusion but can be costly to solve repeatedly at scale because of nonlocal memory and irregular geometry. We propose a physics-informed variable-order graph neural operator (PI-VO-GNO) in which the neural architecture is identical to a data-only graph operator and fractional calculus enters only through a differentiable variable-order Caputo residual. Across three paired seeds, the correct variable-order physics reduces prediction error by 10.44% in distribution and 5.17–6.90% under three distribution shifts, while reducing the true-order discrete residual by 37.7–46.8%. With only 10% of the training trajectories, prediction gains increase to 27.2–29.1%. Under 10% Gaussian corruption of the 25% training subset, PI-VO-GNO retains 13.2–18.6% lower prediction error. A model trained on 128-node graphs transfers to 192- and 256-node discretizations with 8.85–14.54% lower error. The physics loss adds no trainable parameters, only 7.7% training-step overhead, and negligible inference overhead. Reference-solver refinement exhibits monotonic spatial and temporal self-convergence. Mismatched integer- and fixed-order physics instead degrade prediction. Under a severe finite-element cross-discretization shift, field-error gains become nearly neutral, although physical-consistency gains persist. An interpolation control yields 2.70% mean trajectory discrepancy between inverse-distance and piecewise-linear (P1) transfer.