Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sijie He

dblp:206/6245 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
6since 2021 · last 2026
0009-0000-2195-5963ORCID · reported

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

Artificial intelligence and machine learning · 4 · 3 first-author · 2 since 2021Computer networks · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1

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.

Computer networks
2 papers
Routing and switching · 46% Vehicular, aerial and satellite networks · 46% Network management and operations · 7%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Environmental and earth informatics · 100%
Network and information security
2 papers
Authentication and access control · 61% Blockchain and cryptocurrency security · 21% Network security · 18%
Artificial intelligence
2 papers
Deep learning architectures and training · 50% Probabilistic and Bayesian machine learning · 50%
Theoretical computer science
2 papers
Mathematical optimization · 100%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Environmental and earth informatics › climate science
climate informatics
1.022022
Learning and Dynamical Models for Sub-seasonal Climate Forecasting: Comparison and Collaboration · AAAI 2022
Interpretable Predictive Modeling for Climate Variables with Weighted Lasso · AAAI 2019
Routing and switching
routing
0.912025
Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning · IEEE Trans. Commun. 2025
Vehicular, aerial and satellite networks › aerial networks
UAV networks
0.912025
Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning · IEEE Trans. Commun. 2025
Authentication and access control
trust management
0.912025
Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning · IEEE Trans. Commun. 2025
Environmental and earth informatics
climate prediction
0.512021
Sub-Seasonal Climate Forecasting via Machine Learning: Challenges, Analysis, and Advances · AAAI 2021
Environmental and earth informatics › weather forecasting
subseasonal forecasting
0.512021
Sub-Seasonal Climate Forecasting via Machine Learning: Challenges, Analysis, and Advances · AAAI 2021
Mathematical optimization › statistical estimation › regression
regularized regression
0.412019
Interpretable Predictive Modeling for Climate Variables with Weighted Lasso · AAAI 2019
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.312017
High-Dimensional Dependency Structure Learning for Physical Processes · ICDM 2017
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.312017
High-Dimensional Dependency Structure Learning for Physical Processes · ICDM 2017
Mathematical optimization › continuous optimization › convex optimization › proximal methods
alternating direction method of multipliers
0.312017
High-Dimensional Dependency Structure Learning for Physical Processes · ICDM 2017
Mathematical optimization › continuous optimization
convex optimization
0.312017
High-Dimensional Dependency Structure Learning for Physical Processes · ICDM 2017
Network security › intrusion detection and prevention
intrusion detection
0.312025
Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning · IEEE Trans. Commun. 2025

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

prioritized experience replay · 2.0partially observable markov decision process · 2.0multi-agent double deep q-network · 2.0integer nonlinear programming · 2.0multi-agent deep reinforcement learning · 1.7double deep q-network · 1.7PBFT consensus · 1.7physics-based dynamical models · 1.1machine learning models · 1.1deep learning · 1.0XGBoost · 1.0weighted lasso · 0.8gradient boosted trees · 0.8deep neural network · 0.8linear programming · 0.6ADMM · 0.6
YearPublicationVenuePosition
2026 Blockchain-Enabled Routing for Zero-Trust Low-Altitude Intelligent Networks
abstract
Due to the scalability and portability, low-altitude intelligent networks (LAINs) are essential in various fields such as surveillance and disaster rescue. However, in LAINs, unmanned aerial vehicles (UAVs) are characterized by the distributed topology and high mobility, thus vulnerable to security threats, which may degrade routing performances for data transmissions. Hence, how to ensure the routing stability and security of LAINs is challenging. In this paper, we focus on the routing with multiple UAV clusters in LAINs. To minimize the damage caused by potential threats, we present the zero-trust architecture with the software-defined perimeter and blockchain techniques to manage the identify and mobility of UAVs. Besides, we formulate the routing problem to optimize the end-to-end (E2E) delay and transmission success ratio (TSR) simultaneously, which is an integer nonlinear programming problem and intractable to solve. Therefore, we reformulate the problem into a decentralized partially observable Markov decision process. We design the multi-agent double deep Q-network-based routing algorithms to solve the problem, empowered by the soft-hierarchical experience replay buffer and prioritized experience replay mechanisms. Finally, extensive simulations are conducted and the numerical results demonstrate that the proposed framework reduces the average E2E delay by 59% and improves the TSR by 29% on average compared to benchmarks, while simultaneously enabling faster and more robust identification of low-trust UAVs.
Ziye Jia, Sijie He, Ligang Yuan, Fuhui Zhou, Qihui Wu 0001, Zhu Han 0001, Dusit Niyato
IEEE J. Sel. Areas Commun.2
2025 CNN+Transformer Based Anomaly Traffic Detection in UAV Networks for Emergency Rescue
abstract
The unmanned aerial vehicle (UAV) network has gained significant attentions in recent years due to its various applications. However, the traffic security becomes the key threatening public safety issue in an emergency rescue system due to the increasing vulnerability of UAVs to cyber attacks in environments with high heterogeneities. Hence, in this paper, we propose a novel anomaly traffic detection architecture for UAV networks based on the software-defined networking (SDN) framework and blockchain technology. Specifically, SDN separates the control and data plane to enhance the network manageability and security. Meanwhile, the blockchain provides decentralized identity authentication and data security records. Beisdes, a complete security architecture requires an effective mechanism to detect the time-series based abnormal traffic. Thus, an integrated algorithm combining convolutional neural networks (CNNs) and Transformer (CNN+Transformer) for anomaly traffic detection is developed, which is called CTranATD. Finally, the simulation results show that the proposed CTranATD algorithm is effective and outperforms the individual CNN, Transformer, and LSTM algorithms for detecting anomaly traffic.
Yulu Han, Ziye Jia, Sijie He, Yu Zhang 0047, Qihui Wu 0001
VTC2025-Spring3
2025 Trusted Routing for Blockchain-Empowered UAV Networks via Multi-Agent Deep Reinforcement Learning
abstract
Due to the high flexibility and versatility, uncrewed aerial vehicles (UAVs) are leveraged in various fields including surveillance and disaster rescue. However, in UAV networks, routing is vulnerable to malicious damage due to distributed topologies and high dynamics. Hence, ensuring the routing security of UAV networks is challenging. In this paper, we characterize the routing process in a time-varying UAV network with malicious nodes. Specifically, we formulate the routing problem to minimize the total delay, which is an integer linear programming and intractable to solve. Then, to tackle the network security issue, a blockchain-based trust management mechanism (BTMM) is designed to dynamically evaluate trust values and identify low-trust UAVs. To improve traditional practical Byzantine fault tolerance algorithms in the blockchain, we propose a consensus UAV update mechanism. Besides, considering the local observability, the routing problem is reformulated into a decentralized partially observable Markov decision process. Further, a multi-agent double deep Q-network based routing algorithm is designed to minimize the total delay. Finally, simulations are conducted with attacked UAVs and numerical results show that the delay of the proposed mechanism decreases by 13.39%, 12.74%, and 16.6% than multi-agent proximal policy optimal algorithms, multi-agent deep Q-network algorithms, and methods without BTMM, respectively.
Ziye Jia, Sijie He, Qiuming Zhu, Wei Wang 0100, Qihui Wu 0001, Zhu Han 0001
IEEE Trans. Commun.2
2023 Routing Recovery for UAV Networks with Deliberate Attacks: A Reinforcement Learning based Approach
abstract
The unmanned aerial vehicle (UAV) network is popular these years due to its various applications. In the UAV network, routing is significantly affected by the distributed network topology, leading to the issue that UAVs are vulnerable to deliberate damage. Hence, this paper focuses on the routing plan and recovery for UAV networks with attacks. In detail, a deliberate attack model based on the importance of nodes is designed to represent enemy attacks. Then, a node importance ranking mechanism is presented, considering the degree of nodes and link importance. However, it is intractable to handle the routing problem by traditional methods for UAV networks, since link connections change with the UAV availability. Hence, an intelligent algorithm based on reinforcement learning is proposed to recover the routing path when UAVs are attacked. Simulations are conducted and numerical results verify the proposed mechanism performs better than other referred methods.
Sijie He, Ziye Jia, Chao Dong 0001, Wei Wang 0002, Yilu Cao, Yang Yang 0050, Qihui Wu 0001
GLOBECOM1
2022 Learning and Dynamical Models for Sub-seasonal Climate Forecasting: Comparison and Collaboration
abstract
Sub-seasonal forecasting (SSF) is the prediction of key climate variables such as temperature and precipitation on the 2-week to 2-month time horizon. Skillful SSF would have substantial societal value in areas such as agricultural productivity, hydrology and water resource management, and emergency planning for extreme events such as droughts and wildfires. Despite its societal importance, SSF has stayed a challenging problem compared to both short-term weather forecasting and long-term seasonal forecasting. Recent studies have shown the potential of machine learning (ML) models to advance SSF. In this paper, for the first time, we perform a fine-grained comparison of a suite of modern ML models with start-of-the-art physics-based dynamical models from the Subseasonal Experiment (SubX) project for SSF in the western contiguous United States. Additionally, we explore mechanisms to enhance the ML models by using forecasts from dynamical models. Empirical results illustrate that, on average, ML models outperform dynamical models while the ML models tend to generate forecasts with conservative magnitude compared to the SubX models. Further, we illustrate that ML models make forecasting errors under extreme weather conditions, e.g., cold waves due to the polar vortex, highlighting the need for separate models for extreme events. Finally, we show that suitably incorporating dynamical model forecasts as inputs to ML models can substantially improve the forecasting performance of the ML models. The SSF dataset constructed for the work and code for the ML models are released along with the paper for the benefit of the artificial intelligence community.
Sijie He, Laurie Trenary, Benjamin A. Cash, Timothy DelSole, Arindam Banerjee 0001
AAAI1
2021 Sub-Seasonal Climate Forecasting via Machine Learning: Challenges, Analysis, and Advances
abstract
Sub-seasonal forecasting (SSF) focuses on predicting key variables such as temperature and precipitation on the 2-week to 2-month time scale. Skillful SSF would have immense societal value in such areas as agricultural productivity, water resource management, and emergency planning for extreme weather events. However, SSF is considered more challenging than either weather prediction or even seasonal prediction, and is still a largely understudied problem. In this paper, we carefully investigate 10 Machine Learning (ML) approaches to sub-seasonal temperature forecasting over the contiguous U.S. on the SSF dataset we collect, including a variety of climate variables from the atmosphere, ocean, and land. Because of the complicated atmosphere-land-ocean couplings and the limited amount of good quality observational data, SSF imposes a great challenge for ML despite the recent advances in various domains. Our results indicate that suitable ML models, e.g., XGBoost, to some extent, capture the predictability on sub-seasonal time scales and can outperform the climatological baselines, while Deep Learning (DL) models barely manage to match the best results with carefully designed architecture. Besides, our analysis and exploration provide insights on important aspects to improve the quality of sub-seasonal forecasts, e.g., feature representation and model architecture. The SSF dataset and code are released with this paper for use by the broader research community.
Sijie He, Timothy DelSole, Pradeep Ravikumar, Arindam Banerjee 0001
AAAI1
2019 Interpretable Predictive Modeling for Climate Variables with Weighted Lasso
abstract
An important family of problems in climate science focus on finding predictive relationships between various climate variables. In this paper, we consider the problem of predicting monthly deseasonalized land temperature at different locations worldwide based on sea surface temperature (SST). Contrary to popular belief on the trade-off between (a) simple interpretable but inaccurate models and (b) complex accurate but uninterpretable models, we introduce a weighted Lasso model for the problem which yields interpretable results while being highly accurate. Covariate weights in the regularization of weighted Lasso are pre-determined, and proportional to the spatial distance of the covariate (sea surface location) from the target (land location). We establish finite sample estimation error bounds for weighted Lasso, and illustrate its superior empirical performance and interpretability over complex models such as deep neural networks (Deep nets) and gradient boosted trees (GBT). We also present a detailed empirical analysis of what went wrong with Deep nets here, which may serve as a helpful guideline for application of Deep nets to small sample scientific problems.
Sijie He, Vidyashankar Sivakumar, Arindam Banerjee 0001
AAAI1
2017 High-Dimensional Dependency Structure Learning for Physical Processes
abstract
In this paper, we consider the use of structure learning methods for probabilistic graphical models to identify statistical dependencies in high-dimensional physical processes. Such processes are often synthetically characterized using PDEs (partial differential equations) and are observed in a variety of natural phenomena. In this paper, we present ACLIME-ADMM, an efficient two-step algorithm for adaptive structure learning, which decides a suitable edge specific threshold in a data-driven statistically rigorous manner. Both steps of our algorithm use (inexact) ADMM to solve suitable linear programs, and all iterations can be done in closed form in an efficient block parallel manner. We compare ACLIME-ADMM with baselines on both synthetic data simulated by PDEs that model advection-diffusion processes, and real data of daily global geopotential heights to study information flow in the atmosphere. ACLIME-ADMM is shown to be efficient, stable, and competitive, usually better than the baselines especially on difficult problems. On real data, ACLIME-ADMM recovers the underlying structure of global atmospheric circulation, including switches in wind directions at the equator and tropics entirely from the data.
Jamal Golmohammadi, Imme Ebert-Uphoff, Sijie He, Yi Deng 0006, Arindam Banerjee 0001
ICDM3