WLWenhe Liu

Wenhe Liu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Wenhe Liu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Symmetry-Aware Transformers for Asymmetric Causal Discovery in Financial Time Series

    by Wenxia Zheng, Wenhe Liu

    Financial markets exhibit fundamental asymmetries in temporal causality, where policy interventions create asymmetric transmission patterns that traditional symmetric modeling approaches fail to capture. This work introduces a mathematical framework that exploits the inherent symmetries of transformer architectures while preserving essential asymmetric temporal relationships in financial causal inference. We develop CausalFormer, a symmetry-aware neural architecture that maintains the permutation equivariance properties of self-attention mechanisms while enforcing strict temporal asymmetry constraints for causal discovery. The framework incorporates three mathematically principled components: (1) a symmetric attention matrix construction with asymmetric temporal masking that preserves the mathematical elegance of transformer operations while ensuring causal consistency, (2) a multi-scale convolution module with symmetric kernel initialization but asymmetric temporal receptive fields that captures policy transmission effects across heterogeneous time horizons, and (3) enhanced Nelson–Siegel decomposition that maintains the symmetric factor structure while modeling the evolution dynamics of asymmetric factors. Our mathematical formulation establishes the formal symmetry properties of the attention mechanism under temporal transformations while proving asymmetric convergence behaviors in policy transmission scenarios. The integration of symmetric optimization landscapes with asymmetric causal constraints enables simultaneous achievement of mathematical elegance and economic interpretability. Comprehensive experiments on monetary policy datasets demonstrate that the symmetry-aware design achieves a 15.3% improvement in the accuracy of causal effect estimations and a 12.7% enhancement in the predictive performance compared to those for existing methods while maintaining 91.2% causal consistency scores. The framework successfully identifies asymmetric policy transmission mechanisms, revealing that monetary tightening exhibits 40% faster propagation than easing policies, establishing new mathematical insights into the temporal asymmetries in financial systems. This work demonstrates how principled exploitation of architectural symmetries combined with domain-specific asymmetric constraints opens up new directions for mathematically rigorous yet economically interpretable deep learning in financial econometrics, with broad applications spanning computational finance, economic forecasting, and policy analysis.


  • Open Access

    Training-free Monocular 3D Event Detection System for Traffic Surveillance

    by Lijun Yu, Peng Chen, Wenhe Liu, Guoliang Kang, Alexander G. Hauptmann

    We focus on the problem of detecting traffic events in a surveillance scenario, including the detection of both vehicle actions and traffic collisions. Existing event detection systems are mostly learning-based and have achieved convincing performance when a large amount of training data is available. However, in real-world scenarios, collecting sufficient labeled training data is expensive and sometimes impossible (e.g. for traffic collision detection). Moreover, the conventional 2D representation of surveillance views is easily affected by occlusions and different camera views in nature. To deal with the aforementioned problems, in this paper, we propose a training-free monocular 3D event detection system for traffic surveillance. Our system firstly projects the vehicles into the 3D Euclidean space and estimates their kinematic states. Then we develop multiple simple yet effective ways to identify the events based on the kinematic patterns, which need no further training. Consequently, our system is robust to the occlusions and the viewpoint changes. Exclusive experiments report the superior result of our method on large-scale real-world surveillance datasets, which validates the effectiveness of our proposed system.

  • Open Access

    Pair-based Uncertainty and Diversity Promoting Early Active Learning for Person Re-identification

    by Wenhe Liu, Xiaojun Chang, Ling Chen, Dinh Phung, Xiaoqin Zhang, Yi Yang, Alexander G. Hauptmann

    The effective training of supervised Person Re-identification (Re-ID) models requires sufficient pairwise labeled data. However, when there is limited annotation resource, it is difficult to collect pairwise labeled data. We consider a challenging and practical problem called Early Active Learning, which is applied to the early stage of experiments when there is no pre-labeled sample available as references for human annotating. Previous early active learning methods suffer from two limitations for Re-ID. First, these instance-based algorithms select instances rather than pairs, which can result in missing optimal pairs for Re-ID. Second, most of these methods only consider the representativeness of instances, which can result in selecting less diverse and less informative pairs. To overcome these limitations, we propose a novel pair-based active learning for Re-ID. Our algorithm selects pairs instead of instances from the entire dataset for annotation. Besides representativeness, we further take into account the uncertainty and the diversity in terms of pairwise relations. Therefore, our algorithm can produce the most representative, informative, and diverse pairs for Re-ID data annotation. Extensive experimental results on five benchmark Re-ID datasets have demonstrated the superiority of the proposed pair-based early active learning algorithm.


  • Learning Distilled Graph for Large-Scale Social Network Data Clustering

    by Wenhe Liu, Dong Gong, Mingkui Tan, Javen Qinfeng Shi, Yi Yang, Alexander G. Hauptmann

    Spectral analysis is critical in social network analysis. As a vital step of the spectral analysis, the graph construction in many existing works utilizes content data only. Unfortunately, the content data often consists of noisy, sparse, and redundant features, which makes the resulting graph unstable and unreliable. In practice, besides the content data, social networks also contain link information, which provides additional information for graph construction. Some of previous works utilize the link data. However, the link data is often incomplete, which makes the resulting graph incomplete. To address these issues, we propose a Distilled Graph Clustering (DGC) method. It pursuits a distilled graph based on both the content data and the link data. The proposed algorithm alternates between two steps: in the feature selection step, it finds the most representative feature subset w.r.t. an intermediate graph initialized with link data; in graph distillation step, the proposed method updates and refines the graph based on only the selected features. The final resulting graph, which is referred to as the distilled graph, is then utilized for spectral clustering on the large-scale social network data. Extensive experiments demonstrate the superiority of the proposed method.


  • Open Access

    Few-Shot Text and Image Classification via Analogical Transfer Learning

    by Wenhe Liu, Xiaojun Chang, Yan Yan, Yi Yang, Alexander G. Hauptmann

    Learning from very few samples is a challenge for machine learning tasks, such as text and image classification. Performance of such task can be enhanced via transfer of helpful knowledge from related domains, which is referred to as transfer learning. In previous transfer learning works, instance transfer learning algorithms mostly focus on selecting the source domain instances similar to the target domain instances for transfer. However, the selected instances usually do not directly contribute to the learning performance in the target domain. Hypothesis transfer learning algorithms focus on the model/parameter level transfer. They treat the source hypotheses as well-trained and transfer their knowledge in terms of parameters to learn the target hypothesis. Such algorithms directly optimize the target hypothesis by the observable performance improvements. However, they fail to consider the problem that instances that contribute to the source hypotheses may be harmful for the target hypothesis, as instance transfer learning analyzed. To relieve the aforementioned problems, we propose a novel transfer learning algorithm, which follows an analogical strategy. Particularly, the proposed algorithm first learns a revised source hypothesis with only instances contributing to the target hypothesis. Then, the proposed algorithm transfers both the revised source hypothesis and the target hypothesis (only trained with a few samples) to learn an analogical hypothesis. We denote our algorithm as Analogical Transfer Learning. Extensive experiments on one synthetic dataset and three real-world benchmark datasets demonstrate the superior performance of the proposed algorithm.