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

Zhifan Jiang

dblp:325/2694 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
10since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Computer networks · 3 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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
Representation and self-supervised learning · 51% Probabilistic and Bayesian machine learning · 33% Information extraction and text analysis · 9%
Databases, data mining, and information retrieval
1 paper
Data mining · 50% Machine learning and data management · 50%
Network and information security
1 paper
Digital forensics and information hiding · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
1.722025
Learning Disentangled Representation for Multi-Modal Time-Series Sensing Signals · WWW 2025
Disentangling Long-Short Term State Under Unknown Interventions for Online Time Series Forecasting · AAAI 2025
Digital forensics and information hiding
underground forum analysis
1.012026
Breaking Free from Ivory Tower: Evaluating and Enhancing Real-world Chinese Underground Adversarial Jargon Detection · SP 2026
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.912025
Learning Disentangled Representation for Multi-Modal Time-Series Sensing Signals · WWW 2025
Machine learning and data management › online learning
online prediction
0.912025
Disentangling Long-Short Term State Under Unknown Interventions for Online Time Series Forecasting · AAAI 2025
Data mining › time series analysis
time series forecasting
0.912025
Disentangling Long-Short Term State Under Unknown Interventions for Online Time Series Forecasting · AAAI 2025
Natural language and speech › Information extraction and text analysis
text classification
0.312026
Breaking Free from Ivory Tower: Evaluating and Enhancing Real-world Chinese Underground Adversarial Jargon Detection · SP 2026
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.312025
Disentangling Long-Short Term State Under Unknown Interventions for Online Time Series Forecasting · AAAI 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › causal reasoning
intervention
0.312025
Disentangling Long-Short Term State Under Unknown Interventions for Online Time Series Forecasting · AAAI 2025

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

language model · 2.0variational inference · 1.7identification theory · 1.7identifiability analysis · 1.7disentanglement · 1.7
YearPublicationVenuePosition
2026 Turbolearn: Harnessing Accurate and Line-Rate Deep Learning on Programmable Switches
Zhifan Jiang, Longlong Zhu, Jiashuo Yu, Linying Zheng, Chunming Wu 0001, Xiang Chen 0017
APNet1
2026 TurboLearn: Harnessing Accurate and Line-Rate Deep Learning on Programmable Switches
abstract
The intelligent data plane (IDP) embeds deep learning (DL) models on switches for line-rate traffic analysis, but hardware constraints often force simplified models, reducing accuracy, while complex models like Transformers remain undeployable. We present TurboLearn, which achieves high accuracy and line-rate performance by co-designing inference across the switch ASIC and switch OS on the same switch. TurboLearn uses three key techniques: (1) a hardware fast path for lightweight classification and a software normal path for complex models, (2) confidence-based selective inference that escalates only low-confidence packets, and (3) confidence-calibrated knowledge distillation, where the normal path teaches the fast path. On Intel Tofino2 switches across three real-world traffic tasks, TurboLearn supports models that existing IDPs cannot deploy, improves macro-F1 by up to 31.31%, and keeps over 90% of traffic on the fast path with zero throughput loss.
Zhifan Jiang, Longlong Zhu, Jiashuo Yu, Linying Zheng, Chunming Wu 0001, Xiang Chen 0017
APNet1
2026 Breaking Free from Ivory Tower: Evaluating and Enhancing Real-world Chinese Underground Adversarial Jargon Detection
Zhifan Jiang, Mingxuan Liu 0006, Baojun Liu 0002
SP1
2026 End-to-End Spatiotemporal Analysis of Color Doppler Echocardiograms: Application for Rheumatic Heart Disease Detection
abstract
Rheumatic heart disease (RHD) represents a significant global health challenge, disproportionately affecting over 40 million people in low- and middle-income countries. Early detection through color Doppler echocardiography is crucial for treating RHD, but it requires specialized physicians who are often scarce in resource-limited settings. To address this disparity, artificial intelligence (AI)-driven tools for RHD screening can provide scalable, autonomous solutions to improve access to critical healthcare services in underserved regions. This paper introduces RADAR (Rapid AI-Assisted Echocardiography Detection and Analysis of RHD), a novel and generalizable AI approach for end-to-end spatiotemporal analysis of color Doppler echocardiograms, aimed at detecting early RHD in resource-limited settings. RADAR identifies key imaging views and employs convolutional neural networks to analyze diagnostically relevant phases of the cardiac cycle. It also localizes essential anatomical regions and examines blood flow patterns. It then integrates all findings into a cohesive analytical framework. RADAR was trained and validated on 1,022 echocardiogram videos from 511 Ugandan children, acquired using standard portable ultrasound devices. An independent set of 318 cases, acquired using a handheld ultrasound device with diverse imaging characteristics, was also tested. On the validation set, RADAR outperformed existing methods, achieving an average accuracy of 0.92, sensitivity of 0.94, and specificity of 0.90. In independent testing, it maintained high, clinically acceptable performance, with an average accuracy of 0.79, sensitivity of 0.87, and specificity of 0.70. These results highlight RADAR's potential to improve RHD detection and promote health equity for vulnerable children by enhancing timely, accurate diagnoses in underserved regions.
Pooneh Roshanitabrizi, Vishwesh Nath, Kelsey Brown, Taylor Gloria Broudy, Zhifan Jiang, Abhijeet Parida, Joselyn Rwebembera, Emmy Okello, Andrea Z. Beaton, Holger Roth, Craig A. Sable, Marius George Linguraru
IEEE Trans. Medical Imaging5
2025 Disentangling Long-Short Term State Under Unknown Interventions for Online Time Series Forecasting
abstract
Current methods for time series forecasting struggle in the online scenario, since it is difficult to preserve long-term dependency while adapting short-term changes when data are arriving sequentially. Although some recent methods solve this problem by controlling the updates of latent states, they cannot disentangle the long/short-term states, leading to the inability to effectively adapt to nonstationary. To tackle this challenge, we propose a general framework to disentangle long/short-term states for online time series forecasting. Our idea is inspired by the observations where short-term changes can be led by unknown interventions like abrupt policies in the stock market. Based on this insight, we formalize a data generation process with unknown interventions on short-term states. Under mild assumptions, we further leverage the independence of short-term states led by unknown interventions to establish the identification theory to achieve the disentanglement of long/short-term states. Built on this theory, we develop a Long Short-Term Disentanglement model (LSTD) to extract the long/short-term states with long/short term encoders, respectively. Furthermore, the LSTD model incorporates a smooth constraint to preserve the long-term dependencies and an interrupted dependency constraint to enforce the forgetting of short-term dependencies, together boosting the disentanglement of long/short-term states. Experimental results on several benchmark datasets show that our LSTD model outperforms existing methods for online time series forecasting, validating its efficacy in real-world applications.
Ruichu Cai, Haiqin Huang, Zhifan Jiang, Zijian Li 0001, Changze Zhou, Yuequn Liu, Zhifeng Hao 0004
AAAI3
2025 MATOT: A Model-Agnostic Constraint for Time Series Forecasting via Optimal Transport
abstract
The conventional mean square error for time series forecasting is a point-wise loss function, which ignores the temporal dependency of forecasting data points and results in unstable predictions. Although other methods involve shape information loss functions, such as dynamic time warping, they assign the same weights to each matching pair and result in suboptimal results when a wrong matching pair is chosen. Besides, although the optimal transport can assign different weights for each matching pair, they easily suffer from false alignment due to the time lag. To solve these challenges, we propose a Model-Agnostic loss function via Temporally Sensitive Optimal Transport (MA-TOT) as a differentiable loss function for time series forecasting, which combines temporally sensitive Wasserstein distance for adaptive matching pair chosen and Gromov-Wasserstein distance for multi-level-similarity-measurement. Extensive experiments of several of the latest time series forecasting models with our loss function on seven real-world benchmark datasets reflect the effectiveness of our method.
Ruichu Cai, Zhenhui Yang, Yuguang Yan, Haiqin Huang, Kaitao Zheng, Haozhi Chen, Zhifan Jiang, Zijian Li 0001
IJCNN7
2025 Handling Data Plane Program Deployment Dynamics with High-Quality Generative Diffusion Models
abstract
Deploying data plane programs across the network is typically formulated as a mixed-integer programming task, leading to a long execution time. In response, existing studies carefully tailor heuristics for specific task properties such as objectives. However, they suffer from poor solution quality under dynamic task deployment since they overfit specific task properties. Recently, generative diffusion models have been widely adopted in network optimizations due to their strong adaptability and generalization. Accordingly, in this poster, we propose a diffusion model-based framework for data plane program deployment tasks. Our key idea is to leverage the reverse denoising process of diffusion models to react to dynamic task changes at runtime while maintaining high solution quality. Preliminary results on our testbed show that we reduce latency by 66.67% and resource overhead by 58.62% during dynamic deployment.
Longlong Zhu, Jiashuo Yu, Xiang Chen 0017, Qing Shu, Zedi Chen, Zhifan Jiang, Qun Huang 0001, Xuan Liu 0006, Dong Zhang 0010, Chunming Wu 0001
IWQoS6
2025 Synthesis of Pathological Dual-Channel Color Doppler Echocardiograms for Equitable Diagnosis of Heart Diseases
Pooneh Roshanitabrizi, Artur Arturi Aharonyan, Kelsey Brown, Taylor Gloria Broudy, Abhijeet Parida, Austin Tapp, Zhifan Jiang, Alison Tompsett, Joselyn Rwebembera, Emmy Okello, Andrea Z. Beaton, Holger Roth, Daguang Xu, Syed Muhammad Anwar, Craig A. Sable, Marius George Linguraru
MICCAI (2)8
2025 Learning Disentangled Representation for Multi-Modal Time-Series Sensing Signals
abstract
Multi-modal time series data is common in web technologies like the Internet of Things (IoT). Existing methods for multi-modal time series representation learning aim to disentangle the modality-shared and modality-specific latent variables. Although achieving notable performances on downstream tasks, they usually assume an orthogonal latent space. However, the modality-specific and modality-shared latent variables might be dependent on real-world scenarios. Therefore, we propose a general generation process, where the modality-shared and modality-specific latent variables are dependent, and further develop a Multi-modAl TEmporal Disentanglement (MATE) model. Specifically, our MATE model is built on a temporally variational inference architecture with the modality-shared and modality-specific prior networks for the disentanglement of latent variables. Furthermore, we establish identifiability results to show that the extracted representation is disentangled. More specifically, we first achieve the subspace identifiability for modality-shared and modality-specific latent variables by leveraging the pairing of multi-modal data. Then we establish the component-wise identifiability of modality-specific latent variables by employing sufficient changes of historical latent variables. Extensive experimental studies on 12 datasets show a general improvement in different downstream tasks, highlighting the effectiveness of our method in real-world scenarios.
Ruichu Cai, Zhifan Jiang, Kaitao Zheng, Zijian Li 0001, Weilin Chen 0001, Xuexin Chen, Yifan Shen 0004, Guangyi Chen 0002, Zhifeng Hao 0004, Kun Zhang 0001
WWW2
2025 Unifying invariant and variant features for graph out-of-distribution via probability of necessity and sufficiency
Xuexin Chen, Ruichu Cai, Kaitao Zheng, Zhifan Jiang, Zhengting Huang, Zhifeng Hao 0004, Zijian Li 0001
Neural Networks4