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

Hongliang Zhang 0002

dblp:77/10205-2 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
7since 2021 · last 2026
0000-0002-0883-2771ORCID · conflict

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

Artificial intelligence and machine learning · 6 · 5 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.

Artificial intelligence
2 papers
Optimization for machine learning · 50% 3D vision · 25% Efficient and distributed learning · 17%
Computer networks
1 paper
Edge and fog computing · 67% Content delivery and video streaming · 33%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming › caching › distributed caching
cooperative caching
1.012026
Digital Twin-Enabled Mobility-Aware Cooperative Caching in Vehicular Edge Computing · IEEE Trans. Mob. Comput. 2026
Edge and fog computing
edge caching
1.012026
Digital Twin-Enabled Mobility-Aware Cooperative Caching in Vehicular Edge Computing · IEEE Trans. Mob. Comput. 2026
Edge and fog computing › mobile edge computing
vehicular edge computing
1.012026
Digital Twin-Enabled Mobility-Aware Cooperative Caching in Vehicular Edge Computing · IEEE Trans. Mob. Comput. 2026
Machine learning › Optimization for machine learning
optimal transport
0.912025
Towards Better Spherical Sliced-Wasserstein Distance Learning with Data-Adaptive Discriminative Projection Direction · AAAI 2025
Machine learning › Optimization for machine learning › optimal transport
sliced wasserstein distance
0.912025
Towards Better Spherical Sliced-Wasserstein Distance Learning with Data-Adaptive Discriminative Projection Direction · AAAI 2025
Computer vision › 3D vision › 3d shape representation
spherical representation
0.912025
Towards Better Spherical Sliced-Wasserstein Distance Learning with Data-Adaptive Discriminative Projection Direction · AAAI 2025
Machine learning › Efficient and distributed learning › federated learning
asynchronous federated learning
0.312026
Digital Twin-Enabled Mobility-Aware Cooperative Caching in Vehicular Edge Computing · IEEE Trans. Mob. Comput. 2026
Machine learning › Efficient and distributed learning
federated learning
0.312026
Digital Twin-Enabled Mobility-Aware Cooperative Caching in Vehicular Edge Computing · IEEE Trans. Mob. Comput. 2026
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation
0.312025
Towards Better Spherical Sliced-Wasserstein Distance Learning with Data-Adaptive Discriminative Projection Direction · AAAI 2025

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

digital twin · 2.0deep reinforcement learning · 2.0client selection · 2.0GRU-VAE · 2.0spherical sliced-wasserstein distance · 0.9projected energy function · 0.9neural network-induced weighting · 0.9
YearPublicationVenuePosition
2026 POSITIVE4Rec: Incorporating the Recency Effect with Positional Inductive Bias for Sequential Recommendation
abstract
State-of-the-art attention-based models in Sequential Recommendation (SR) often struggle to accurately model the recency effect, where recent interactions disproportionately influence future behavior. Empirically, conventional learnable positional embeddings exhibit erratic fluctuations, failing to guarantee necessary influence decay over time. To address this, we propose POSITIVE4Rec, a model-agnostic framework injecting Positional Inductive Bias (PIB) directly into self-attention. A novel attention reweighting module imposes an adaptive monotonic trend on the attention distribution. Acting as a soft inductive bias rather than a rigid constraint, it prioritizes temporal proximity while retaining flexibility. This plug-and-play mechanism integrates seamlessly into diverse SR architectures. Extensive benchmark experiments show POSITIVE4Rec revitalizes state-of-the-art models with significant performance gains. Code is available at https://anonymous.4open.science/r/POSITIVE4Rec.
Po-Chih Lin, Yixuan Dong, Fang-Yi Su, Haijie Yang, Zelin Zang, Hongliang Zhang 0002, Bingo Wing-Kuen Ling, Fuji Yang
ICMR6
2026 CoMPR: Efficient point cloud dataset condensation via bidirectional matching and point recycling
Hongliang Zhang 0002, Xiaoqi An, Jiawei Lian, Lei Luo 0001, Jian Yang 0003
Pattern Recognit.1
2026 Learning multi-scale spatial-frequency features for image denoising
Xu Zhao 0001, Chen Zhao 0002, Xiantao Hu, Hongliang Zhang 0002, Ying Tai, Jian Yang 0003
Pattern Recognit.4
2026 Digital Twin-Enabled Mobility-Aware Cooperative Caching in Vehicular Edge Computing
abstract
With the advancement of vehicle-to-vehicle (V2V) ad hoc networks and wireless communication technologies, mobile edge caching has become a key enabler for enhancing network performance and user experience. However, traditional federated learning-based collaborative caching approaches in vehicular scenarios suffer from inadequate client selection mechanisms and limited prediction accuracy, which result in suboptimal cache hit ratios and increased content transmission latency. To address these challenges, we propose a Digital Twin-based Asynchronous Federated Learning-driven Predictive Edge Caching with Deep Reinforcement Learning (DAPR) framework. DAPR employs an intelligent client selection strategy based on asynchronous federated learning, which leverages mobility prediction and data quality assessment to avoid selecting highly mobile clients or clients with low-quality data, thereby significantly improving model convergence efficiency. In addition, we design a GRU-VAE prediction model that uses a Variational Autoencoder (VAE) to capture latent data distribution features and Gated Recurrent Units (GRUs) to model temporal dependencies, thereby substantially enhancing the accuracy of content request prediction. The predicted content popularities are then fed into a deep reinforcement learning-driven caching decision engine to dynamically optimize edge caching resource allocation. Extensive experiments demonstrate that DAPR achieves superior performance in terms of average reward, cache hit ratio, and transmission latency, thereby effectively improving the overall efficiency of vehicular edge caching systems.
Zhenkui Shi, Chunpei Li, Mengkai Yan, Hongliang Zhang 0002, Xiantao Hu, Xianxian Li
IEEE Trans. Mob. Comput.5
2025 Towards Better Spherical Sliced-Wasserstein Distance Learning with Data-Adaptive Discriminative Projection Direction
abstract
Spherical Sliced-Wasserstein (SSW) has recently been proposed to measure the discrepancy between spherical data distributions in various fields, such as geology, medical domains, computer vision, and deep representation learning. However, in the original SSW, all projection directions are treated equally, which is too idealistic and cannot accurately reflect the importance of different projection directions for various data distributions. To address this issue, we propose a novel data-adaptive Discriminative Spherical Sliced-Wasserstein (DSSW) distance, which utilizes a projected energy function to determine the discriminative projection direction for SSW. In our new DSSW, we introduce two types of projected energy functions to generate the weights for projection directions with complete theoretical guarantees. The first type employs a non-parametric deterministic function that transforms the projected Wasserstein distance into its corresponding weight in each projection direction. This improves the performance of the original SSW distance with negligible additional computational overhead. The second type utilizes a neural network-induced function that learns the projection direction weight through a parameterized neural network based on data projections. This further enhances the performance of the original SSW distance with less extra computational overhead. Finally, we evaluate the performance of our proposed DSSW by comparing it with several state-of-the-art methods across a variety of machine learning tasks, including gradient flows, density estimation on real earth data, and self-supervised learning.
Hongliang Zhang 0002, Shuo Chen 0003, Lei Luo 0001, Jian Yang 0003
AAAI1
2024 Few-shot learning with long-tailed labels
Hongliang Zhang 0002, Shuo Chen 0003, Lei Luo 0001
Pattern Recognit.1
2021 Ensemble mutation-driven salp swarm algorithm with restart mechanism: Framework and fundamental analysis
Hongliang Zhang 0002, Ali Asghar Heidari, Mingjing Wang, Xuehua Zhao, Guoxi Liang, Huiling Chen 0001
Expert Syst. Appl.1
2020 Advanced orthogonal moth flame optimization with Broyden-Fletcher-Goldfarb-Shanno algorithm: Framework and real-world problems
Hongliang Zhang 0002, Zhiyang Gu, Ali Asghar Heidari, Mingjing Wang, Huiling Chen 0001, Mayun Chen
Expert Syst. Appl.1