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

Yangchun Zhang

dblp:324/8512 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 5 · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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
2 papers
3D vision · 55% Reinforcement learning · 32% Deep learning architectures and training · 14%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
camera pose estimation
1.012026
Orientation-Guided Homography for Fine-Grained Cross-View Localization · IEEE Trans. Image Process. 2026
Computer vision › 3D vision › visual localization
cross-view geo-localization
1.012026
Orientation-Guided Homography for Fine-Grained Cross-View Localization · IEEE Trans. Image Process. 2026
Computer vision › 3D vision › visual localization
cross-view localization
1.012026
Orientation-Guided Homography for Fine-Grained Cross-View Localization · IEEE Trans. Image Process. 2026
Machine learning › Reinforcement learning › imitation learning › generative imitation learning
generative adversarial imitation learning
0.812024
Exploring Gradient Explosion in Generative Adversarial Imitation Learning: A Probabilistic Perspective · AAAI 2024
Machine learning › Deep learning architectures and training › training dynamics
gradient explosion
0.812024
Exploring Gradient Explosion in Generative Adversarial Imitation Learning: A Probabilistic Perspective · AAAI 2024
Machine learning › Reinforcement learning
imitation learning
0.812024
Exploring Gradient Explosion in Generative Adversarial Imitation Learning: A Probabilistic Perspective · AAAI 2024
Machine learning › Reinforcement learning › reward design
reward shaping
0.212024
Exploring Gradient Explosion in Generative Adversarial Imitation Learning: A Probabilistic Perspective · AAAI 2024

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

iterative refinement · 1.0homography estimation · 1.0bird's-eye-view transformation · 1.0reward clipping · 0.8probabilistic lower bound analysis · 0.8
YearPublicationVenuePosition
2026 Orientation-Guided Homography for Fine-Grained Cross-View Localization
abstract
Cross-view localization aims to estimate the precise position and orientation of a ground-view image by aligning it with satellite imagery. However, existing homography-based methods are typically evaluated under limited orientation noise (±45°) and exhibit limited refinement capability, as their local correlation-based refinement relies on a reasonably good initial orientation estimate. To address these limitations, we propose a fine-grained cross-view localization method based on orientation-guided homography (OGH-Net), whose core idea is to predict an initial orientation prior that explicitly guides subsequent homography refinement. Specifically, we first design a hybrid bird's-eye-view (BEV) transformation to generate BEV images with preserved central geometry and expanded coverage. Then, we introduce a lightweight orientation-prior module that provides a coarse yaw estimate across the full ±180° range. Finally, we develop a multiscale iterative homography module that progressively refines the projection matrix through hierarchical iterations across multiple feature resolutions. Under cross-area, unknown-orientation conditions, it reduces mean localization error by 11% and mean orientation error by 27% on VIGOR, and further reduces mean localization error by 27% on KITTI compared with previous state-of-the-art methods. Moreover, OGH-Net runs in real time at up to 107 FPS on a single RTX 3090 GPU, offering a favorable trade-off between accuracy and efficiency. The code and trained models will be released at https://github.com/YC-Zhang2025/OGH-Net.
Yangchun Zhang, Xudong Kang, Puhong Duan, Shutao Li 0001
IEEE Trans. Image Process.1
2024 Exploring Gradient Explosion in Generative Adversarial Imitation Learning: A Probabilistic Perspective
abstract
Generative Adversarial Imitation Learning (GAIL) stands as a cornerstone approach in imitation learning. This paper investigates the gradient explosion in two types of GAIL: GAIL with deterministic policy (DE-GAIL) and GAIL with stochastic policy (ST-GAIL). We begin with the observation that the training can be highly unstable for DE-GAIL at the beginning of the training phase and end up divergence. Conversely, the ST-GAIL training trajectory remains consistent, reliably converging. To shed light on these disparities, we provide an explanation from a theoretical perspective. By establishing a probabilistic lower bound for GAIL, we demonstrate that gradient explosion is an inevitable outcome for DE-GAIL due to occasionally large expert-imitator policy disparity, whereas ST-GAIL does not have the issue with it. To substantiate our assertion, we illustrate how modifications in the reward function can mitigate the gradient explosion challenge. Finally, we propose CREDO, a simple yet effective strategy that clips the reward function during the training phase, allowing the GAIL to enjoy high data efficiency and stable trainability.
Wanying Wang, Yichen Zhu 0001, Yirui Zhou, Chaomin Shen 0001, Jian Tang 0008, Yaxin Peng, Yangchun Zhang
AAAI8
2024 A memory pool variational autoencoder framework for cross-domain recommendation
abstract
Cross-domain recommendation (CDR) leverages knowledge from the source domain to make recommendations for the cold-start users in the target domain. On account of fully utilizing information, various relationships among users and items are taken into account, i.e., the interaction relationship between users and their corresponding items; the relationship among users or items; and the indirect relationship between the user and items related to other users. In order to process these relationships, we propose a novel framework named Memory Pool Variational AutoEncoder (MPVAE). The main advantages of the MPVAE model lie in three aspects: (1) it generates the embedding representations that incorporate more information by a memory pool mechanism in the source and target domains; (2) it involves the relationship among users or items efficiently by the similarity measurement, further, the indirect relationship can be explicitly described, which makes full use of information in the source domain; and (3) it leverages the superiority of the probability model from the perspective of the VAE structure, which ensures generation and robustness. Comprehensive experiments on three real datasets show that the proposed model achieves remarkable superiority over several competitive CDR models.
Jie Yang 0101, Jianxiang Zhu, Xiaofeng Ding 0003, Yaxin Peng, Yangchun Zhang
Expert Syst. Appl.5
2024 Generalization error for portable rewards in transfer imitation learning
Yirui Zhou, Mengxiao Lu, Jian Tang 0008, Yangchun Zhang, Yaxin Peng
Knowl. Based Syst.6
2023 Distributional generative adversarial imitation learning with reproducing kernel generalization
Yirui Zhou, Mengxiao Lu, Zhengping Che, Jian Tang 0008, Yangchun Zhang, Yan Peng 0001, Yaxin Peng
Neural Networks7
2022 Generalization and Computation for Policy Classes of Generative Adversarial Imitation Learning
Yirui Zhou, Yangchun Zhang, Wanying Wang, Zhengping Che, Jian Tang 0008, Yaxin Peng
PPSN (1)2