Xitong Gao

Xitong Gao

Auto-generated profile, based on publicly available information

Xitong Gao

Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
16 December 2022 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
FZFurong Zheng
Furong Zheng
JZJuanjuan Zhao
Juanjuan Zhao
JYJiexia Ye
Jiexia Ye
XGXitong Gao
Xitong Gao
KYKejiang Ye
Kejiang Ye
CXChengzhong Xu
Chengzhong Xu
Short-term Origin-Destination(OD) matrix prediction in metro systems aims to predict the number of passenger demands from one station to another during a short time period. That is crucial for dynamic traffic operations, e.g., route recommendation, metro scheduling. However, existing methods need further improvement due to that they fail to take full use of the real-time traffic information and model the complex spatiotemporal correlation of traffic flows. In this paper, a M ulti- V iew P assenger F low (MVPF) evolution trend based OD matrix prediction method is proposed. It consists of two components focusing on individual station and cross-station learning. Specifically, the individual station level part uses Gate Recurrent Unit and Extended Graph Attention Networks combined model to learn the high-level spatiotemporal-dependent representation of each station as the roles of origin and destination respectively, by considering multiple views of real-time traffic information (i.e., Inflow, destination allocation of Inflow, Outflow, origin allocations of Outflow). The cross-station part aims to learn passenger mobility pattern from each origin to destination through defining a transition matrix under spatiotemporal context. Compared with state-of-the-art solutions, MVPF increases the OD prediction performance metric of WMAPE by 2.5% on average. The experimental results demonstrate the superiority of MVPF against other competitors. The source code is available at https://github.com/zfrInSIAT/MVPF-code .

13 November 2024 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
XWXinliang Wei
Xinliang Wei
XGXitong Gao
Xitong Gao
KYKejiang Ye
Kejiang Ye
CXCheng-Zhong Xu
Cheng-Zhong Xu
YWYu Wang
Yu Wang
Mobile edge computing (MEC) has revolutionized the way computational tasks are offloaded and latency is reduced by leveraging edge servers close to end devices. Efficient resource allocation and task offloading are crucial for enhancing system performance in MEC environments. Traditional reinforcement learning (RL) approaches have shown promise in optimizing resource allocation and task offloading problems. However, they often face challenges such as high computational complexity and the need for extensive training data. Quantum reinforcement learning (QRL) emerges as a promising solution to overcome these limitations by leveraging quantum computing principles to enhance efficiency and scalability. In this paper, we propose a hybrid quantum-classical non-sequential model for joint resource allocation and task offloading in MEC systems. Our model combines the advantages of RL in handling environmental dynamics and quantum computing in reducing adjustable parameters and accelerating the training process. Extensive experiments demonstrate that our proposed algorithm can achieve higher training and inference performance under various parameter settings compared to traditional RL models and previous QRL models.

1 December 2013
Verified
Conference Paper
Closed access
XGXitong Gao
Xitong Gao
SBSamuel Bayliss
Samuel Bayliss
GCGeorge A. Constantinides
George A. Constantinides
This paper introduces SOAP, a new tool to automatically optimize the structure of arithmetic expressions for FPGA implementation as part of a high level synthesis flow, taking into account axiomatic rules derived from real arithmetic, such as distributivity, associativity and others. We explicitly target an optimized area/accuracy trade-off, allowing arithmetic expressions to be automatically re-written for this purpose. For the first time, we bring rigorous approaches from software static analysis, specifically formal semantics and abstract interpretation, to bear on source-to-source transformation for high-level synthesis. New abstract semantics are developed to generate a computable subset of equivalent expressions from an original expression. Using formal semantics, we calculate two objectives, the accuracy of computation and an estimate of resource utilization in FPGA. The optimization of these objectives produces a Pareto frontier consisting of a set of expressions. This gives the synthesis tool the flexibility to choose an implementation satisfying constraints on both accuracy and resource usage. We thus go beyond existing literature by not only optimizing the precision requirements of an implementation, but changing the structure of the implementation itself. Using our tool to optimize the structure of a variety of real world and artificially generated examples in single precision, we improve either their accuracy or the resource utilization by up to 60%.

13 October 2023 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Open access
YYYunrui Yu
Yunrui Yu
XGXitong Gao
Xitong Gao
CXCheng-Zhong Xu
Cheng-Zhong Xu
Deep convolutional neural networks (CNNs) can be easily tricked to give incorrect outputs by adding tiny perturbations to the input that are imperceptible to humans. This makes them susceptible to adversarial attacks, and poses significant security risks to deep learning systems, and presents a great challenge in making CNNs robust against such attacks. An influx of defense strategies have thus been proposed to improve the robustness of CNNs. Current attack methods, however, may fail to accurately or efficiently evaluate the robustness of defending models. In this paper, we thus propose a unified $\ell _{p}$ white-box attack strategy, LAFIT, to harness the defender's latent features in its gradient descent steps, and further employ a new loss function to normalize logits to overcome floating-point-based gradient masking. We show that not only is it more efficient, but it is also a stronger adversary than the current state-of-the-art when examined across a wide range of defense mechanisms. This suggests that adversarial attacks/defenses could be contingent on the effective use of the defender's hidden components, and robustness evaluation should no longer view models holistically.


14 December 2022
Verified
Book Chapter
Closed access
PDF file
SDShisheng Deng
Shisheng Deng
DLDongping Liao
Dongping Liao
XGXitong Gao
Xitong Gao
JZJuanjuan Zhao
Juanjuan Zhao
KYKejiang Ye
Kejiang Ye