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.

Jiexi Liu 0001

dblp:176/6110-1 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
4since 2021 · last 2026
0009-0002-8092-5355ORCID · verified

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

Artificial intelligence and machine learning · 4 · 4 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
4 papers
Representation and self-supervised learning · 43% Time series and sequential data · 31% Deep learning architectures and training · 26%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › sequence representation learning
time series representation learning
2.632026
Beyond Observations: Reconstruction Error-Guided Irregularly Sampled Time Series Representation Learning · AAAI 2026
TimeCHEAT: A Channel Harmony Strategy for Irregularly Sampled Multivariate Time Series Analysis · AAAI 2025
TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning · AAAI 2024
Machine learning › Time series and sequential data › time series modeling
irregularly sampled time series
2.022026
A gradual coarse-to-fine framework for irregularly sampled multivariate time series analysis · Sci. China Inf. Sci. 2026
Beyond Observations: Reconstruction Error-Guided Irregularly Sampled Time Series Representation Learning · AAAI 2026
Machine learning › Representation and self-supervised learning
contrastive learning
1.822026
Beyond Observations: Reconstruction Error-Guided Irregularly Sampled Time Series Representation Learning · AAAI 2026
TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning · AAAI 2024
Machine learning › Time series and sequential data
time series analysis
1.012026
A gradual coarse-to-fine framework for irregularly sampled multivariate time series analysis · Sci. China Inf. Sci. 2026
Machine learning › Representation and self-supervised learning › contrastive learning › temporal contrastive learning
time series contrastive learning
1.012026
Beyond Observations: Reconstruction Error-Guided Irregularly Sampled Time Series Representation Learning · AAAI 2026
Machine learning › Time series and sequential data › time series analysis
irregular multivariate time series
0.912025
TimeCHEAT: A Channel Harmony Strategy for Irregularly Sampled Multivariate Time Series Analysis · AAAI 2025
Machine learning › Deep learning architectures and training › transformer › temporal transformer
time series transformer
0.912025
TimeCHEAT: A Channel Harmony Strategy for Irregularly Sampled Multivariate Time Series Analysis · AAAI 2025
Machine learning › Deep learning architectures and training
transformer
0.912025
TimeCHEAT: A Channel Harmony Strategy for Irregularly Sampled Multivariate Time Series Analysis · AAAI 2025
Machine learning › Deep learning architectures and training
data augmentation
0.812024
TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning · AAAI 2024
Machine learning › Deep learning architectures and training › data augmentation
time series data augmentation
0.812024
TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning · AAAI 2024

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

wasserstein metric · 1.0reconstruction error modeling · 1.0mixup · 1.0coarse-to-fine framework · 1.0channel harmony strategy · 0.9bipartite graph embedding · 0.9time reconstruction · 0.8contrastive learning · 0.8
YearPublicationVenuePosition
2026 Beyond Observations: Reconstruction Error-Guided Irregularly Sampled Time Series Representation Learning
abstract
Irregularly sampled time series (ISTS), characterized by non-uniform time intervals with natural missingness, are prevalent in real-world applications. Existing approaches for ISTS modeling primarily rely on observed values to impute unobserved ones or infer latent dynamics. However, these methods overlook a critical source of learning signal: the reconstruction error inherently produced during model training. Such error implicitly reflects how well a model captures the underlying data structure and can serve as an informative proxy for unobserved values. To exploit this insight, we propose iTimER, a simple yet effective self-supervised pre-training framework for ISTS representation learning. iTimER models the distribution of reconstruction errors over observed values and generates pseudo-observations for unobserved timestamps through a mixup strategy between sampled errors and the last available observations. This transforms unobserved timestamps into noise-aware training targets, enabling meaningful reconstruction signals. A Wasserstein metric aligns reconstruction error distributions between observed and pseudo-observed regions, while a contrastive learning objective enhances the discriminability of learned representations. Extensive experiments on classification, interpolation, and forecasting tasks demonstrate that iTimER consistently outperforms state-of-the-art methods under the ISTS setting.
Jiexi Liu 0001, Meng Cao 0005, Songcan Chen
AAAI1
2026 A gradual coarse-to-fine framework for irregularly sampled multivariate time series analysis
Jiexi Liu 0001, Meng Cao 0005, Songcan Chen
Sci. China Inf. Sci.1
2025 TimeCHEAT: A Channel Harmony Strategy for Irregularly Sampled Multivariate Time Series Analysis
abstract
Irregularly sampled multivariate time series (ISMTS) are prevalent in reality. Due to their non-uniform intervals between successive observations and varying sampling rates among series, the channel-independent (CI) strategy, which has been demonstrated more desirable for complete multivariate time series forecasting in recent studies, has failed. This failure can be further attributed to the sampling sparsity, which provides insufficient information for effective CI learning, thereby reducing its capacity. When we resort to the channel-dependent (CD) strategy, even higher capacity cannot mitigate the potential loss of diversity in learning similar embedding patterns across different channels. We find that existing work considers CI and CD strategies to be mutually exclusive, primarily because they apply these strategies to the global channel. However, we hold the view that channel strategies do not necessarily have to be used globally. Instead, by appropriately applying them locally and globally, we can create an opportunity to take full advantage of both strategies. This leads us to introduce the Channel Harmony ISMTS Transformer (TimeCHEAT), which utilizes the CD strategy locally and the CI strategy globally. Specifically, we segment the ISMTS into sub-series level patches. Locally, the CD strategy aggregates information within each patch for time embedding learning, maximizing the use of relevant observations while reducing long-range irrelevant interference. Here, we enhance generality by transforming embedding learning into an edge weight prediction task using bipartite graphs, eliminating the need for special prior knowledge. Globally, the CI strategy is applied across patches, allowing the Transformer to learn individualized attention patterns for each channel. Experimental results indicate our proposed TimeCHEAT demonstrates competitive state-of-the-art performance across three mainstream tasks including classification, forecasting and interpolation.
Jiexi Liu 0001, Meng Cao 0005, Songcan Chen
AAAI1
2024 TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning
abstract
Learning universal time series representations applicable to various types of downstream tasks is challenging but valuable in real applications. Recently, researchers have attempted to leverage the success of self-supervised contrastive learning (SSCL) in Computer Vision(CV) and Natural Language Processing(NLP) to tackle time series representation. Nevertheless, due to the special temporal characteristics, relying solely on empirical guidance from other domains may be ineffective for time series and difficult to adapt to multiple downstream tasks. To this end, we review three parts involved in SSCL including 1) designing augmentation methods for positive pairs, 2) constructing (hard) negative pairs, and 3) designing SSCL loss. For 1) and 2), we find that unsuitable positive and negative pair construction may introduce inappropriate inductive biases, which neither preserve temporal properties nor provide sufficient discriminative features. For 3), just exploring segment- or instance-level semantics information is not enough for learning universal representation. To remedy the above issues, we propose a novel self-supervised framework named TimesURL. Specifically, we first introduce a frequency-temporal-based augmentation to keep the temporal property unchanged. And then, we construct double Universums as a special kind of hard negative to guide better contrastive learning. Additionally, we introduce time reconstruction as a joint optimization objective with contrastive learning to capture both segment-level and instance-level information. As a result, TimesURL can learn high-quality universal representations and achieve state-of-the-art performance in 6 different downstream tasks, including short- and long-term forecasting, imputation, classification, anomaly detection and transfer learning.
Jiexi Liu 0001, Songcan Chen
AAAI1
2019 Non-stationary Multivariate Time Series Prediction with Selective Recurrent Neural Networks
Jiexi Liu 0001, Songcan Chen
PRICAI (3)1