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

Haiqin Huang

dblp:371/0852 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 50% Machine learning and data management · 50%
Artificial intelligence
1 paper
Representation and self-supervised learning · 62% Probabilistic and Bayesian machine learning · 19% Knowledge representation and reasoning · 19%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning
0.912025
Disentangling Long-Short Term State Under Unknown Interventions for Online Time Series Forecasting · AAAI 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
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

identification theory · 1.7disentanglement · 1.7
YearPublicationVenuePosition
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
AAAI2
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
IJCNN4