Kaitao Zheng

dblp:368/7335 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2025
0009-0004-3064-9633ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 55% Probabilistic and Bayesian machine learning · 27% Time series and sequential data · 14%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
1.722025
Learning Disentangled Representation for Multi-Modal Time-Series Sensing Signals · WWW 2025
On the Identification of Temporal Causal Representation with Instantaneous Dependence · ICLR 2025
Machine learning › Representation and self-supervised learning
causal representation learning
0.912025
On the Identification of Temporal Causal Representation with Instantaneous Dependence · ICLR 2025
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.912025
Learning Disentangled Representation for Multi-Modal Time-Series Sensing Signals · WWW 2025
Machine learning › Representation and self-supervised learning › causal representation learning
identifiability
0.912025
Causal View of Time Series Imputation: Some Identification Results on Missing Mechanism · IJCAI 2025
Machine learning › Representation and self-supervised learning › blind source separation › independent component analysis
nonlinear ICA
0.912025
Causal View of Time Series Imputation: Some Identification Results on Missing Mechanism · IJCAI 2025
Machine learning › Time series and sequential data › time series analysis
time series imputation
0.912025
Causal View of Time Series Imputation: Some Identification Results on Missing Mechanism · IJCAI 2025
Machine learning › Generative modeling
normalizing flow
0.312025
Causal View of Time Series Imputation: Some Identification Results on Missing Mechanism · IJCAI 2025

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

variational inference · 3.5identifiability analysis · 1.7sparsity regularization · 0.9normalizing flow · 0.9nonlinear ICA · 0.9
YearPublicationVenuePosition
2025 On the Identification of Temporal Causal Representation with Instantaneous Dependence
abstract
Temporally causal representation learning aims to identify the latent causal process from time series observations, but most methods require the assumption that the latent causal processes do not have instantaneous relations. Although some recent methods achieve identifiability in the instantaneous causality case, they require either interventions on the latent variables or grouping of the observations, which are in general difficult to obtain in real-world scenarios. To fill this gap, we propose an \textbf{ID}entification framework for instantane\textbf{O}us \textbf{L}atent dynamics (\textbf{IDOL}) by imposing a sparse influence constraint that the latent causal processes have sparse time-delayed and instantaneous relations. Specifically, we establish identifiability results of the latent causal process based on sufficient variability and the sparse influence constraint by employing contextual information of time series data. Based on these theories, we incorporate a temporally variational inference architecture to estimate the latent variables and a gradient-based sparsity regularization to identify the latent causal process. Experimental results on simulation datasets illustrate that our method can identify the latent causal process. Furthermore, evaluations on multiple human motion forecasting benchmarks with instantaneous dependencies indicate the effectiveness of our method in real-world settings.
Zijian Li 0001, Yifan Shen 0004, Kaitao Zheng, Ruichu Cai, Xiangchen Song, Mingming Gong, Guangyi Chen 0002, Kun Zhang 0001
ICLR3
2025 Causal View of Time Series Imputation: Some Identification Results on Missing Mechanism
abstract
Time series imputation is one of the most challenging problems and has broad applications in various fields like health care and the Internet of Things. Existing methods mainly aim to model the temporally latent dependencies and the generation process from the observed time series data. In real-world scenarios, different types of missing mechanisms, like MAR (Missing At Random) and MNAR (Missing Not At Random), can occur in time series data. However, existing methods often overlook the difference among the aforementioned missing mechanisms and use a single model for time series imputation, which can easily lead to misleading results due to mechanism mismatching. In this paper, we propose a framework for the time series imputation problem by exploring Different Missing Mechanisms (DMM in short) and tailoring solutions accordingly. Specifically, we first analyze the data generation processes with temporal latent states and missing cause variables for different mechanisms. Sequentially, we model these generation processes via variational inference and estimate prior distributions of latent variables via a normalizing flow-based neural architecture. Furthermore, we establish identifiability results under the nonlinear independent component analysis framework to show that latent variables are identifiable. Experimental results show that our method surpasses existing time series imputation techniques across various datasets with different missing mechanisms, demonstrating its effectiveness in real-world applications.
Ruichu Cai, Kaitao Zheng, Junxian Huang 0002, Zijian Li 0001, Zhengming Chen 0002, Zhifeng Hao 0004
IJCAI2
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
IJCNN5
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
WWW3
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 Networks3