Wenhe Liu

Dr. Wenhe Liu

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2020 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
WLWenhe Liu
Wenhe Liu
XCXiaojun Chang
Xiaojun Chang
LCLing Chen
Ling Chen
DPDinh Phung
Dinh Phung
XZXiaoqin Zhang
Xiaoqin Zhang
AHAlexander G. Hauptmann
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.

28 October 2022
Verified
Book Chapter
Closed access
PDF file
YQYijun Qian
Yijun Qian
LYLijun Yu
Lijun Yu
WLWenhe Liu
Wenhe Liu
AHAlexander G. Hauptmann
Alexander G. Hauptmann

29 October 2018 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
PDF file
WLWenhe Liu
Wenhe Liu
XCXiaojun Chang
Xiaojun Chang
YYYan Yan
Yan Yan
YYYi Yang
Yi Yang
AHAlexander G. Hauptmann
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.

8 January 2018 in Journal of Superconductivity and Novel Magnetism
Verified
Journal Article
Closed access
PDF file
MZMingang Zhang
Mingang Zhang
WZWen Zhang
Wen Zhang
FCFenghua Chen
Fenghua Chen
YGYanping Guo
Yanping Guo
FLFan Li
Fan Li
WLWenhe Liu
Wenhe Liu

20 September 2017 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
CYCaixia Yan
Caixia Yan
MLMinnan Luo
Minnan Luo
WLWenhe Liu
Wenhe Liu
QZQinghua Zheng
Qinghua Zheng

24 September 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
WZWenxia Zheng
Wenxia Zheng
WLWenhe Liu
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.