Arrow Research search

Author name cluster

Zhen Zhang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

65 papers
2 author rows

Possible papers

65

AAAI Conference 2026 Conference Paper

A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median

  • Zhen Zhang
  • Han Peng
  • Limei Liu
  • Junyu Huang
  • Xiaolong Li
  • Qilong Feng

Given a non-negative integer \ell, the k-median with outliers problem extends the standard k-median problem by allowing the removal of up to \ell points and minimizing the clustering cost over the remaining ones. Algorithmic development in this setting remains an active area of research due to its relevance in processing noisy data. In this paper, we present a sampling-based reduction from the k-median with outliers problem to its outlier-free counterpart. The reduction incurs a multiplicative overhead of (kℓ⁻¹ + ε⁻¹)^O(ℓ) in the running time: it yields (kℓ⁻¹ + ε⁻¹)^O(ℓ) outlier-free instances, a solution to one of which can be directly transformed into a solution to the original instance with an arbitrarily small loss in the approximation ratio. This improves upon the previously known reduction with an overhead of ((k + ℓ)ε⁻¹)^O(ℓ). As applications, we obtain faster fixed-parameter tractable (FPT) algorithms with tight approximation guarantees for the k-median with outliers problem under various metric spaces. Furthermore, our approach naturally generalizes to constrained variants of the problem where additional constraints are imposed on the cluster sizes, and yields similar improvements in their FPT approximations.

JBHI Journal 2026 Journal Article

A Self-Supervised Diffusion Model With Edge Prior for Unpaired LDCT Denoising

  • Zhen Zhang
  • Huizhen Zhang
  • Shaohua Zheng
  • Lin Pan
  • Mingjing Yang
  • Liqin Huang
  • Qiang Wu
  • Zhiyong Zhang

Low-dose computed tomography (LDCT) reduces health risks from radiation exposure but introduces imaging noise and artifacts. While numerous studies have employed deep learning for LDCT image denoising, the field continues to face significant challenges. Recent advancements have seen diffusion models applied to overcome issues of over-smoothness and unstable training inherent in prior deep learning approaches. However, the diffusion models face challenges in direct practical applications due to the extensive sampling steps, significant inference time required, and the need for hard-to-obtain paired data during training. To address these difficulties, this paper introduces a self-supervised diffusion model with edge prior for unpaired LDCT denoising. This method enables denoising within a lower-dimensional space, reducing computational complexity. Our proposed approach enhances denoised image clarity by applying prior edge constraints to compressed encodings; it employs a noise-conditioned encoding strategy to facilitate self-supervised image training, enabling the method to be applicable to unpaired CT data; and it utilizes compressed LDCT encoding as intermediate sampling results during the inference process, thereby accelerating sampling and reducing the time required for inference, making the method more real-time capable. Extensive validation across multiple datasets demonstrates that our method achieves competitive performance against state-of-the-art approaches in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and perceptual quality (LPIPS), while maintaining a practically acceptable inference time.

EAAI Journal 2026 Journal Article

An innovative feature clustering paradigm based on Hypergraph cooperative graph convolutional network for hyperspectral image classification

  • Zhen Zhang
  • Lehao Huang
  • Yabin Hu
  • Qingwang Wang
  • Chunxue Xu
  • Yemao Qi
  • Chenxi Liu

Hyperspectral Image Classification (HSIC) constitutes a pivotal endeavor in remote sensing, facilitating high-precision delineation of Earth's surface features. Conventional deep learning approaches, however, frequently fail to account for the irregular, non-Euclidean spatial arrangement of natural features, resulting in the aggregation of extraneous or misleading information that undermines the discriminative capacity of target classes. To surmount these limitations, this study proposes an innovative feature clustering paradigm, instantiated through a Hypergraph Cooperative Graph Convolutional Network (HCoGCN). By devising a Hypergraph Action Network (HACN) and a Hypergraph Node Feature Adaptive Aggregation Module (HNFA2M), this framework adeptly clusters and integrates features from homogeneous regions within non-Euclidean domains. Further refinement is achieved through a Pixel-level Compensation Mechanism (PCM), which synergistically incorporates Euclidean-space pixel-level features to bolster classification precision. The proposed method achieves the highest classification accuracies of 95. 49 %, 97. 66 %, and 98. 75 % on the QUH-Qingyun, QUH-Pingan, and QUH-Tangdaowan datasets, respectively, outperforming existing mainstream approaches by a significant margin. Comprehensive ablation and comparative analyses substantiate the paradigm's robustness and adaptability, underscoring its efficacy in capturing intricate spatial-spectral interrelations across Euclidean and non-Euclidean spaces. This work heralds a transformative advance in HSIC by foregrounding the potency of feature clustering as a foundational strategy.

JMLR Journal 2026 Journal Article

Identifying Weight-Variant Latent Causal Models

  • Yuhang Liu
  • Zhen Zhang
  • Dong Gong
  • Mingming Gong
  • Biwei Huang
  • Anton van den Hengel
  • Kun Zhang
  • Javen Qinfeng Shi

The task of causal representation learning aims to uncover latent higher-level causal variables that affect lower-level observations. Identifying the true latent causal variables from observed data, while allowing instantaneous causal relations among latent variables, remains a challenge, however. To this end, we start with the analysis of three intrinsic indeterminacies in identifying latent variables from observations: transitivity, permutation indeterminacy, and scaling indeterminacy. We find that transitivity acts as a key role in impeding the identifiability of latent causal variables. To address the unidentifiable issue due to transitivity, we introduce a novel identifiability condition where the underlying latent causal model satisfies a linear-Gaussian model, in which the causal coefficients and the distribution of Gaussian noise are modulated by an additional observed variable. Under certain assumptions, including the existence of a reference condition under which latent causal influences vanish, we can show that the latent causal variables can be identified up to trivial permutation and scaling, and that partial identifiability results can still be obtained when this reference condition is violated for a subset of latent variables. Furthermore, based on these theoretical results, we propose a novel method, termed Structural caUsAl Variational autoEncoder (SuaVE), which directly learns causal representations and causal relationships among them, together with the mapping from the latent causal variables to the observed ones. Experimental results on synthetic and real data demonstrate the identifiability and consistency results and the efficacy of SuaVE in learning causal representations. [abs] [ pdf ][ bib ] [ code ] &copy JMLR 2026. ( edit, beta )

AAAI Conference 2026 Conference Paper

KnowLCP: Knowledge Augmented Lane Change Prediction for Autonomous Driving

  • Yuhuan Lu
  • Pengpeng Xu
  • Wei Wang
  • Zhen Zhang
  • Han Liu
  • Xiping Hu

Lane change prediction, encompassing both intention recognition and trajectory forecasting, is essential for the safe operation of autonomous vehicles in mixed-traffic environments. Existing models predominantly follow a data-driven paradigm, learning directly from historical vehicle states through an end-to-end approach. Inspired by the emerging paradigm of enhancing model generalizability through domain knowledge, we propose KnowLCP to explicitly model and integrate driving knowledge into the lane change prediction task. Specifically, we incorporate three types of knowledge: traffic risk awareness to improve intention prediction, vehicle kinematics to ensure the physical feasibility of predicted trajectories, and intention intensity to refine trajectory forecasting. Furthermore, we introduce a novel knowledge injection strategy that enhances mutual information during integration and proves superior to the traditional parallel input mechanism, which simply feeds knowledge features alongside historical states. Extensive experiments on two real-world trajectory datasets demonstrate that KnowLCP achieves average improvements of 8.3-10.3% in intention prediction and 10.1-10.3% in trajectory prediction over the best-performing baselines.

TIST Journal 2026 Journal Article

Mutual Information-Guided Style Augmentation for Single Domain Generalization

  • Shuai Yang
  • Zhen Zhang
  • Kui Yu
  • Lichuan Gu
  • Xindong Wu

Single domain generalization aims to develop a robust model trained on a source domain to generalize well on unseen target domains. Recent progress in single domain generalization has focused on expanding the scope of training data through style (e.g., backgrounds) augmentation. However, existing methods are difficult to generate data with large style shifts due to the lack of precise correlation measures between the generated and original data, and they struggle to effectively capture the consistency between the generated and original data when learning feature representations. In this article, we propose a novel Mutual Information-guided Style Augmentation (MISA) based single domain generalization method. Specifically, MISA incorporates a style diversity module, which uses the matrix-based Rényi’s \(\alpha\) -order entropy functionals to compute an approximate mutual information value between the augmented and original data, minimizing it to guide style generator learning. Moreover, MISA combines the merits of the random convolution and affine transformation to further improve the texture diversity of the augmented data. Additionally, MISA introduces a representation learning module, which minimizes the approximate mutual information value between the prediction logits of the original sample and its corresponding residual component to capture the consistency between the generated and original data for feature representation optimization. Using five real-world datasets, the extensive experiments have demonstrated the effectiveness of MISA, in comparison with state-of-the-art methods.

I&C Journal 2026 Journal Article

Parameterized approximation schemes for fair-range clustering

  • Zhen Zhang
  • Xiaohong Chen
  • Limei Liu
  • Jie Chen
  • Junyu Huang
  • Qilong Feng

Fair-range clustering extends classical clustering formulations by associating each data point with one or more demographic labels. It imposes lower and upper bound constraints on the number of facilities opened for each label, ensuring fair representation of all demographic groups by the selected facilities. In this paper we focus on the fair-range k-median and k-means problems in Euclidean spaces. We give ( 1 + ε ) -approximation algorithms with fixed-parameter tractable running times for both problems, parameterized by the numbers of opened facilities and demographic labels. For Euclidean metrics, these are the first parameterized approximation schemes for the problems, improving upon the previously known O(1)-approximation ratios given by Thejaswi et al. (KDD 2022), later albeit applicable to general metric spaces.

NeurIPS Conference 2025 Conference Paper

Adaptive Quantization in Generative Flow Networks for Probabilistic Sequential Prediction

  • Nadhir Hassen
  • Zhen Zhang
  • Johan Verjans

Probabilistic time series forecasting, essential in domains like healthcare and neuroscience, requires models capable of capturing uncertainty and intricate temporal dependencies. While deep learning has advanced forecasting, generating calibrated probability distributions over continuous future values remains challenging. We introduce Temporal Generative Flow Networks (Temporal GFNs), adapting Generative Flow Networks (GFNs) – a powerful framework for generating compositional objects – to this sequential prediction task. GFNs learn policies to construct objects (eg. forecast trajectories) step-by-step, sampling final objects proportionally to a reward signal. However, applying GFNs directly to continuous time series necessitates addressing their inherently discrete action spaces and ensuring differentiability. Our framework tackles this by representing time series segments as states and sequentially generating future values via quantized actions chosen by a forward policy. We introduce two key innovations: (1) An adaptive, curriculum-based quantization strategy that dynamically adjusts the number of discretization bins based on reward improvement and policy entropy, balancing precision and exploration throughout training. (2) A straight-through estimator mechanism enabling the forward policy to output both discrete (hard) samples for trajectory construction and continuous (soft) samples for stable gradient propagation. Training utilizes a trajectory balance loss objective, ensuring flow consistency, augmented by an entropy regularizer. We provide rigorous theoretical bounds on the quantization error's impact and the adaptive factor's range. We demonstrate how Temporal GFNs offer a principled way to leverage the structured generation capabilities of GFNs for probabilistic forecasting in continuous domains.

ICLR Conference 2025 Conference Paper

Benchmarking Multimodal Retrieval Augmented Generation with Dynamic VQA Dataset and Self-adaptive Planning Agent

  • Yangning Li
  • Yinghui Li
  • Xinyu Wang 0013
  • Yong Jiang 0005
  • Zhen Zhang
  • Xinran Zheng
  • Hui Wang 0030
  • Hai-Tao Zheng 0002

Multimodal Retrieval Augmented Generation (mRAG) plays an important role in mitigating the “hallucination” issue inherent in multimodal large language models (MLLMs). Although promising, existing heuristic mRAGs typically predefined fixed retrieval processes, which causes two issues: (1) Non-adaptive Retrieval Queries. (2) Overloaded Retrieval Queries. However, these flaws cannot be adequately reflected by current knowledge-seeking visual question answering (VQA) datasets, since the most required knowledge can be readily obtained with a standard two-step retrieval. To bridge the dataset gap, we first construct Dyn-VQA dataset, consisting of three types of ``dynamic'' questions, which require complex knowledge retrieval strategies variable in query, tool, and time: (1) Questions with rapidly changing answers. (2) Questions requiring multi-modal knowledge. (3) Multi-hop questions. Experiments on Dyn-VQA reveal that existing heuristic mRAGs struggle to provide sufficient and precisely relevant knowledge for dynamic questions due to their rigid retrieval processes. Hence, we further propose the first self-adaptive planning agent for multimodal retrieval, **OmniSearch**. The underlying idea is to emulate the human behavior in question solution which dynamically decomposes complex multimodal questions into sub-question chains with retrieval action. Extensive experiments prove the effectiveness of our OmniSearch, also provide direction for advancing mRAG. Code and dataset will be open-sourced.

TCS Journal 2025 Journal Article

Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem

  • Zhen Zhang
  • Zhuohang Gao
  • Limei Liu
  • Yao Liu
  • Jie Chen
  • Qilong Feng

The Knapsack Median problem, defined over a set of clients and facilities in a metric space, seeks to open a subset of facilities and connect each client to an opened facility, with the goal of minimizing the sum of client-connection costs while keeping the sum of facility-opening costs within a specified budget. Solving this problem exactly in FPT time, parameterized by the maximum number of opened facilities (denoted by k), is unlikely due to its W[2]-hardness. Thus, we focus on parameterized approximation algorithms for the problem. We give a sampling-based method that reduces the solution search space, which yields a ( 3 + ε ) -approximation algorithm running in ( k ε − 1 ) O ( k ) n O ( 1 ) time in general metric spaces and a ( 1 + ε ) -approximation algorithm with similar running time in d-dimensional Euclidean space.

EAAI Journal 2025 Journal Article

Dual-phase airway segmentation: Enhancing distal bronchial identification with anatomical prior guidance

  • Zhen Zhang
  • Wen Zhang
  • Liqin Huang
  • Lin Pan
  • Shaohua Zheng
  • Zheng Liu
  • Weisheng Chen
  • Penggang Bai

Airway segmentation and reconstruction are critical for preoperative lesion localization and surgical planning in pulmonary interventions. However, this task remains challenging due to the intrinsically complex tree structure of the airway and the imbalance in branch sizes. While current deep learning methods focus on model architecture optimization, they underutilize anatomical priors such as the spatial correlation between pulmonary arteries and bronchi beyond geometric grading level III. To address this limitation, we propose a dual-decoding segmentation network (DDS-Net) integrated with a pulmonary-bronchial extension generative adversarial network (PBE-GAN), which explicitly embeds artery-bronchus adjacency priors to enhance distal bronchial identification. Experimental results demonstrate state-of-the-art performance, achieving a Dice Similarity Coefficient (DSC) of 88. 46%, Branch Detection Rate (BD) of 88. 31%, and Tree Length Detection Rate (TD) of 84. 93%, with significant improvements in detecting peripheral bronchi near pulmonary arteries. This study confirms that incorporating anatomical relationships substantially improves segmentation accuracy, particularly for fine structures. Future work should prioritize clinical validation through multi-center trials and explore integration with real-time surgical navigation systems, while extending similar anatomical synergy principles to other organ-specific segmentation tasks.

AAAI Conference 2025 Conference Paper

Dual-View Interaction-Aware Lane Change Prediction for Autonomous Driving

  • Yuhuan Lu
  • Zhen Zhang
  • Rufan Bai
  • Han Liu
  • Wei Wang

As artificial intelligence techniques evolve, we are approaching a critical moment for the widespread deployment of autonomous vehicles. Subsequently, the emergence of mixed-autonomy traffic environments presents formidable challenges to autonomous vehicles, especially for the accurate prediction of lane change intentions of their surrounding human-driven vehicles, which is crucial for ensuring the safety of autonomous vehicles. Existing lane change prediction models mainly focus on capturing the temporal variations in the movement dynamics of individual vehicles. However, the neglect to consider inter-vehicle interactions hinders their capability in complex lane change scenarios, resulting in suboptimal prediction performance. Moreover, current interaction-aware approaches for autonomous driving fail to explicitly model future interactions between vehicles, leading to unreasonable prediction results that can cause collisions between vehicles. To address the above issues, we propose to incorporate the concept of perceived safety into future interaction modeling and design a dual-view interaction-aware lane change prediction model. We evaluate the proposed model on two real-world datasets and experimental results show that the proposed model achieves average improvements of 11.7-12.4% in classification ability and 75.6-95.7% in forecast ability over the best-performing baselines across the two datasets. The ablation study and investigation into future interaction modeling demonstrate that our model has advantages in interpreting lane change scenarios from a driving safety perspective.

IROS Conference 2025 Conference Paper

Efficient Learning of A Unified Policy For Whole-body Manipulation and Locomotion Skills

  • Dianyong Hou
  • Chengrui Zhu
  • Zhen Zhang
  • Zhibin Li
  • Chuang Guo
  • Yong Liu

Equipping quadruped robots with manipulators provides unique loco-manipulation capabilities, enabling diverse practical applications. This integration creates a more complex system that has increased difficulties in modeling and control. Reinforcement learning (RL) offers a promising solution to address these challenges by learning optimal control policies through interaction. Nevertheless, RL methods often struggle with local optima when exploring large solution spaces for motion and manipulation tasks. To overcome these limitations, we propose a novel approach that integrates an explicit kinematic model of the manipulator into the RL framework. This integration provides feedback on the mapping of the body postures to the manipulator’s workspace, guiding the RL exploration process and effectively mitigating the local optima issue. Our algorithm has been successfully deployed on a DeepRobotics X20 quadruped robot equipped with a Unitree Z1 manipulator, and extensive experimental results demonstrate the superior performance of this approach. We have established a project website to showcase our experiments.

NeurIPS Conference 2025 Conference Paper

Fast Local Search Algorithms for Clustering with Adaptive Sampling and Bandit Strategies

  • Junyu Huang
  • Zhen Zhang
  • Beirong Cui
  • Jianxin Wang
  • Qilong Feng

Local search is a powerful clustering technique that provides high-quality solutions with theoretical guarantees. With distance-based sampling strategies, local search methods can achieve constant approximations for clustering with linear running time in data size. Despite their effectiveness, existing algorithms still face scalability issues as they require scanning the entire dataset for iterative center swaps. This typically leads to an O(ndk) running time, where n is the data size, d is the dimension, k is the number of clusters. To further improve the efficiency of local search algorithms, we propose new methods based on adaptive sampling and bandit strategies. Specifically, adaptive sampling can well approximate the distance-based sampling distribution without maintaining pairwise distances between data points and the centers, enabling fast and accurate sampling in sublinear time after an $\tilde{O}(nd)$ time preprocessing step. The bandit strategy models the best swap pair selection as a bandit problem, where a grouping strategy is proposed for fast identification of the optimal swap pair. With these techniques, our proposed algorithm can achieve constant approximation in expected running time $\tilde{O}(nd + k^4)$ under mild assumptions on optimal clusters and swap pair distributions. Our approach also extends naturally to the k-median objective, achieving constant approximation in expected running time $\tilde{O}(nd + \sqrt{n}k^3)$ without distributional assumptions. Empirical results demonstrate that our algorithm achieves up to 1000× speedup over existing local search methods on datasets with 100 million points, while delivering comparable clustering quality. Compared to coreset-based approaches, it provides up to around 80× speedup and consistently yields better clustering results.

TMLR Journal 2025 Journal Article

Highway Graph to Accelerate Reinforcement Learning

  • ZiDu Yin
  • Zhen Zhang
  • Dong Gong
  • Stefano V Albrecht
  • Javen Qinfeng Shi

Reinforcement Learning (RL) algorithms often struggle with low training efficiency. A common approach to address this challenge is integrating model-based planning algorithms, such as Monte Carlo Tree Search (MCTS) or Value Iteration (VI), into the environmental model. However, VI faces a significant limitation: it requires iterating over a large tensor with dimensions $|\mathcal{S}|\times |\mathcal{A}| \times |\mathcal{S}|$, where $\mathcal{S}$ and $\mathcal{A}$ represent the state and action spaces, respectively. This process updates the value of the preceding state $s_{t-1}$ based on the succeeding state $s_t$ through value propagation, resulting in computationally intensive operations. To enhance the training efficiency of RL algorithms, we propose improving the efficiency of the value learning process. In deterministic environments with discrete state and action spaces, we observe that on the sampled empirical state-transition graph, a non-branching sequence of transitions—termed a \textit{highway}—can take the agent directly from $s_0$ to $s_T$ without deviation through intermediate states. On these non-branching highways, the value-updating process can be streamlined into a single-step operation, eliminating the need for iterative, step-by-step updates. Building on this observation, we introduce a novel graph structure called the \textit{highway graph} to model state transitions. The highway graph compresses the transition model into a compact representation, where edges can encapsulate multiple state transitions, enabling value propagation across multiple time steps in a single iteration. By integrating the highway graph into RL (as a model-based off-policy RL method), the training process is significantly accelerated, particularly in the early stages of training. Experiments across four categories of environments demonstrate that our method learns significantly faster than established and state-of-the-art model-free and model-based RL algorithms (often by a factor of 10 to 150) while maintaining equal or superior expected returns. Furthermore, a deep neural network-based agent trained using the highway graph exhibits improved generalization capabilities and reduced storage costs.

TMLR Journal 2025 Journal Article

Latent Covariate Shift: Unlocking Partial Identifiability for Multi-Source Domain Adaptation

  • Yuhang Liu
  • Zhen Zhang
  • Dong Gong
  • Mingming Gong
  • Biwei Huang
  • Anton van den Hengel
  • Kun Zhang
  • Javen Qinfeng Shi

Multi-source domain adaptation (MSDA) addresses the challenge of learning a label prediction function for an unlabeled target domain by leveraging both the labeled data from multiple source domains and the unlabeled data from the target domain. Conventional MSDA approaches often rely on covariate shift or conditional shift paradigms, which assume a consistent label distribution across domains. However, this assumption proves limiting in practical scenarios where label distributions do vary across domains, diminishing its applicability in real-world settings. For example, animals from different regions exhibit diverse characteristics due to varying diets and genetics. Motivated by this, we propose a novel paradigm called latent covariate shift (LCS), which introduces significantly greater variability and adaptability across domains. Notably, it provides a theoretical assurance for recovering the latent cause of the label variable, which we refer to as the latent content variable. Within this new paradigm, we present an intricate causal generative model by introducing latent noises across domains, along with a latent content variable and a latent style variable to achieve more nuanced rendering of observational data. We demonstrate that the latent content variable can be identified up to block identifiability due to its versatile yet distinct causal structure. We anchor our theoretical insights into a novel MSDA method, which learns the label distribution conditioned on the identifiable latent content variable, thereby accommodating more substantial distribution shifts. The proposed approach showcases exceptional performance and efficacy on both simulated and real-world datasets.

ICML Conference 2025 Conference Paper

Learning Cascade Ranking as One Network

  • Yunli Wang
  • Zhen Zhang
  • Zhiqiang Wang
  • Zixuan Yang
  • Yu Li
  • Jian Yang 0003
  • Shiyang Wen
  • Peng Jiang 0002

Cascade Ranking is a prevalent architecture in large-scale top-k selection systems like recommendation and advertising platforms. Traditional training methods focus on single-stage optimization, neglecting interactions between stages. Recent advances have introduced interaction-aware training paradigms, but still struggle to 1) align training objectives with the goal of the entire cascade ranking (i. e. , end-to-end recall of ground-truth items) and 2) learn effective collaboration patterns for different stages. To address these challenges, we propose LCRON, which introduces a novel surrogate loss function derived from the lower bound probability that ground truth items are selected by cascade ranking, ensuring alignment with the overall objective of the system. According to the properties of the derived bound, we further design an auxiliary loss for each stage to drive the reduction of this bound, leading to a more robust and effective top-k selection. LCRON enables end-to-end training of the entire cascade ranking system as a unified network. Experimental results demonstrate that LCRON achieves significant improvement over existing methods on public benchmarks and industrial applications, addressing key limitations in cascade ranking training and significantly enhancing system performance.

IROS Conference 2025 Conference Paper

Learning Symmetric Legged Locomotion via State Distribution Symmetrization

  • Chengrui Zhu
  • Zhen Zhang
  • Siqi Li
  • Qingpeng Li
  • Yong Liu

Morphological symmetry is a fundamental characteristic of legged animals and robots. Most existing Deep Reinforcement Learning approaches for legged locomotion neglect to exploit this inherent symmetry, often producing unnatural and suboptimal behaviors such as dominant legs or non-periodic gaits. To address this limitation, we propose a novel learning-based framework to systematically optimize symmetry by state distribution symmetrization. First, we introduce the degree of asymmetry (DoA), a quantitative metric that measures the discrepancy between original and mirrored state distributions. Second, we develop an efficient computation method for DoA using gradient ascent with a trained discriminator network. This metric is then incorporated into a reinforcement learning framework by introducing it to the reward function, explicitly encouraging symmetry during policy training. We validate our framework with extensive experiments on quadrupedal and humanoid robots in simulated and real-world environments. Results demonstrate the efficacy of our approach for improving policy symmetry and overall locomotion performance.

IROS Conference 2025 Conference Paper

LITE: A Learning-Integrated Topological Explorer for Multi-Floor Indoor Environments

  • Junhao Chen
  • Zhen Zhang
  • Chengrui Zhu
  • Xiaojun Hou
  • Tianyang Hu
  • Huifeng Wu
  • Yong Liu

This work focuses on multi-floor indoor exploration, which remains an open area of research. Compared to traditional methods, recent learning-based explorers have demonstrated significant potential due to their robust environmental learning and modeling capabilities, but most are restricted to 2D environments. In this paper, we proposed a learning-integrated topological explorer, LITE, for multi-floor indoor environments. LITE decomposes the environment into a floor-stair topology, enabling seamless integration of learning or non-learning-based 2D exploration methods for 3D exploration. As we incrementally build floor-stair topology in exploration using YOLO11-based instance segmentation model, the agent can transition between floors through a finite state machine. Additionally, we implement an attention-based 2D exploration policy that utilizes an attention mechanism to capture spatial dependencies between different regions, thereby determining the next global goal for more efficient exploration. Extensive comparison and ablation studies conducted on the HM3D and MP3D datasets demonstrate that our proposed 2D exploration policy significantly outperforms all baseline explorers in terms of exploration efficiency. Furthermore, experiments in several 3D multi-floor environments indicate that our framework is compatible with various 2D exploration methods, facilitating effective multi-floor indoor exploration. Finally, we validate our method in the real world with a quadruped robot, highlighting its strong generalization capabilities.

ICRA Conference 2025 Conference Paper

MARF: Cooperative Multi-Agent Path Finding with Reinforcement Learning and Frenet Lattice in Dynamic Environments

  • Tianyang Hu
  • Zhen Zhang
  • Chengrui Zhu
  • Gang Xu
  • Yuchen Wu
  • Huifeng Wu
  • Yong Liu

Multi-agent path finding (MAPF) in dynamic and complex environments is a highly challenging task. Recent research has focused on the scalability of agent numbers or the complexity of the environment. Usually, they disregard the agents' physical constraints or use a differential-driven model. However, this approach fails to adequately capture the kinematic and dynamic constraints of real-world vehicles, particularly those equipped with Ackermann steering. This paper presents a novel algorithm named MARF that combines multi-agent reinforcement learning (MARL) with a Frenet lattice planner. The MARL foundation endows the algorithm with enhanced generalization capabilities while preserving computational efficiency. By incorporating Frenet lattice trajectories into the action space of the MARL framework, agents are capable of generating smooth and feasible trajectories that respect the kinematic and dynamic constraints. In addition, we adopt a centralized training and decentralized execution (CTDE) framework, where a network of shared value functions enables efficient cooperation among agents during decision-making. Simulation results and real-world experiments in different scenarios demonstrate that our method achieves superior performance in terms of success rate, average speed, extra distance of trajectory, and computing time.

ICLR Conference 2025 Conference Paper

Minimax Optimal Two-Stage Algorithm For Moment Estimation Under Covariate Shift

  • Zhen Zhang
  • Xin Liu
  • Shaoli Wang
  • Jiaye Teng

Covariate shift occurs when the distribution of input features differs between the training and testing phases. In covariate shift, estimating an unknown function's moment is a classical problem that remains under-explored, despite its common occurrence in real-world scenarios. In this paper, we investigate the minimax lower bound of the problem when the source and target distributions are known. To achieve the minimax optimal bound (up to a logarithmic factor), we propose a two-stage algorithm. Specifically, it first trains an optimal estimator for the function under the source distribution, and then uses a likelihood ratio reweighting procedure to calibrate the moment estimator. In practice, the source and target distributions are typically unknown, and estimating the likelihood ratio may be unstable. To solve this problem, we propose a truncated version of the estimator that ensures double robustness and provide the corresponding upper bound. Extensive numerical studies on synthetic examples confirm our theoretical findings and further illustrate the effectiveness of our proposed method.

JBHI Journal 2025 Journal Article

Multi-Modal Encrypted Retrieval Method with Semantic Feature Fusion towards Internet of Medical Things

  • Puning Zhang
  • Yingjie Wang
  • Jing Wang
  • Zhen Zhang

There exists a tremendous amount of multimodal data in the Internet of Medical Things (IoMT), retrieval technology can extract target data on demand from the extensive multimodal medical data space, which is crucial for aiding diagnosis and medical informatization. However, existing methods only focus on single-modal data such as medical texts, without considering the privacy protection and retrieval needs of users' multimodal data. Furthermore, these existing methods only match keywords and fail to effectively mine the semantic features of multimodal data, thereby limiting the performance of retrieval systems. To address these issues, this paper proposes a multimodal encrypted retrieval method for the IoMT based on semantic feature fusion and designs a multimodal semantic feature extraction model based on searchable encryption technology to enable encrypted retrieval of multimodal data. Specifically, an edge-cloud collaboration concept is introduced to underpin a secure semantic search architecture tailored for multimodal data, which ensures low-latency encrypted retrieval while safeguarding user privacy. Besides, a semantic-aware multimodal feature extraction method is designed, enhancing the capability of mining semantic features and replacing the traditional keyword retrieval mode with semantic feature retrieval. Moreover, a multimodal data encrypted retrieval method is proposed, employing a block idea and parallel search tree structure, which achieves rapid retrieval of semantic similarity with low-cost and privacy-preserving. Simulation results demonstrate that the proposed method significantly outperforms the latest research regarding precision, search delay, and storage overhead.

NeurIPS Conference 2025 Conference Paper

On the Value of Cross-Modal Misalignment in Multimodal Representation Learning

  • Yichao Cai
  • Yuhang Liu
  • Erdun Gao
  • Tianjiao Jiang
  • Zhen Zhang
  • Anton van den Hengel
  • Prof Javen Qinfeng Shi

Multimodal representation learning, exemplified by multimodal contrastive learning (MMCL) using image-text pairs, aims to learn powerful representations by aligning cues across modalities. This approach relies on the core assumption that the exemplar image-text pairs constitute two representations of an identical concept. However, recent research has revealed that real-world datasets often exhibit cross-modal misalignment. There are two distinct viewpoints on how to address this issue: one suggests mitigating the misalignment, and the other leveraging it. We seek here to reconcile these seemingly opposing perspectives, and to provide a practical guide for practitioners. Using latent variable models we thus formalize cross-modal misalignment by introducing two specific mechanisms: Selection bias, where some semantic variables are absent in the text, and perturbation bias, where semantic variables are altered—both leading to misalignment in data pairs. Our theoretical analysis demonstrates that, under mild assumptions, the representations learned by MMCL capture exactly the information related to the subset of the semantic variables invariant to selection and perturbation biases. This provides a unified perspective for understanding misalignment. Based on this, we further offer actionable insights into how misalignment should inform the design of real-world ML systems. We validate our theoretical findings via extensive empirical studies on both synthetic data and real image-text datasets, shedding light on the nuanced impact of cross-modal misalignment on multimodal representation learning.

NeurIPS Conference 2025 Conference Paper

SharpZO: Hybrid Sharpness-Aware Vision Language Model Prompt Tuning via Forward-Only Passes

  • Yifan Yang
  • Zhen Zhang
  • Rupak Vignesh Swaminathan
  • Jing Liu
  • Nathan Susanj
  • Zheng Zhang

Fine-tuning vision language models (VLMs) has achieved remarkable performance across various downstream tasks; yet, it requires access to model gradients through backpropagation (BP), making them unsuitable for memory-constrained, inference-only edge devices. To address this limitation, previous work has explored various BP-free fine-tuning methods. However, these approaches often rely on high-variance evolutionary strategies (ES) or zeroth-order (ZO) optimization, and often fail to achieve satisfactory performance. In this paper, we propose a hybrid Sharpness-aware Zeroth-order optimization (SharpZO) approach, specifically designed to enhance the performance of ZO VLM fine-tuning via a sharpness-aware warm-up training. SharpZO features a two-stage optimization process: a sharpness-aware ES stage that globally explores and smooths the loss landscape to construct a strong initialization, followed by a fine-grained local search via sparse ZO optimization. The entire optimization relies solely on forward passes. Detailed theoretical analysis and extensive experiments on CLIP models demonstrate that SharpZO significantly improves accuracy and convergence speed, achieving up to 7\% average gain over state-of-the-art forward-only methods.

NeurIPS Conference 2025 Conference Paper

Soft Thinking: Unlocking the Reasoning Potential of LLMs in Continuous Concept Space

  • Zhen Zhang
  • Xuehai He
  • Weixiang Yan
  • Ao Shen
  • Chenyang Zhao
  • Xin Wang

Human cognition typically involves thinking through abstract, fluid concepts rather than strictly using discrete linguistic tokens. Current Large Language Models (LLMs), however, are constrained to reasoning within the boundaries of human language, processing discrete token embeddings that represent fixed points in semantic space. This discrete constraint restricts the expressive power and upper potential of such reasoning models, often causing incomplete exploration of reasoning paths, as standard Chain-of-Thought (CoT) methods rely on sampling one token per step. In this work, we introduce Soft Thinking, a training-free method that emulates human-like ``soft'' reasoning by generating abstract concept tokens in a continuous concept space. These concept tokens are created by the probability-weighted mixture of token embeddings, which span the continuous concept space, enabling smooth transitions and richer representations that transcend traditional discrete boundaries. In essence, each generated concept token encapsulates multiple meanings from related discrete tokens, implicitly exploring various reasoning paths to converge effectively toward the correct answer. Empirical evaluations on diverse mathematical and coding benchmarks consistently demonstrate the effectiveness and efficiency of Soft Thinking, improving pass@1 accuracy by up to 2. 48 points while simultaneously reducing token usage by up to 22. 4\% compared to standard CoT. Qualitative analysis further reveals that Soft Thinking outputs remain highly interpretable and readable, highlighting the potential of Soft Thinking to break the inherent limits of discrete language-based reasoning.

NeurIPS Conference 2025 Conference Paper

Solving the Asymmetric Traveling Salesman Problem via Trace-Guided Cost Augmentation

  • Zhen Zhang
  • Prof Javen Qinfeng Shi
  • Wee Sun Lee

The Asymmetric Traveling Salesman Problem (ATSP) ranks among the most fundamental and notoriously difficult problems in combinatorial optimization. We propose a novel continuous relaxation framework for the Asymmetric Traveling Salesman Problem (ATSP) by leveraging differentiable constraints that encourage acyclic structures and valid permutations. Our approach integrates a differentiable trace-based Directed Acyclic Graph (DAG) constraint with a doubly stochastic matrix relaxation of the assignment problem, enabling gradient-based optimization over soft permutations. We develop a projected exponentiated gradient method with adaptive step size to minimize tour cost while satisfying the relaxed constraints. To recover high-quality discrete tours, we introduce a greedy post-processing procedure that iteratively corrects subtours using cost-aware cycle merging. Our method achieves state-of-the-art performance on standard asymmetric TSP benchmarks and demonstrates competitive scalability and accuracy, particularly on large or asymmetric instances where heuristic solvers such as LKH-3 struggle.

I&C Journal 2025 Journal Article

Towards a theoretical understanding of why local search works for clustering with fair-center representation

  • Zhen Zhang
  • Junfeng Yang
  • Limei Liu
  • Xuesong Xu
  • Guozhen Rong
  • Qilong Feng

The representative k-median problem generalizes the classical clustering formulations in that it partitions the data points into ℓ disjoint demographic groups and imposes a lower-bound constraint on the number of opened facilities from each group, such that all the groups are fairly represented by the opened facilities. Due to its simplicity, the local-search heuristic, which iteratively swaps a bounded number of closed facilities for the same number of opened ones to improve the solution, has been frequently used in the representative k-median problem. It is known that the local-search heuristic, when restricted to constant-size swaps, yields a constant-factor approximation if ℓ = 2, and has an unbounded approximation ratio if ℓ is super-constant. However, for any constant ℓ > 2, the existence of a constant-factor approximation under constant-size swaps remained an open question for a long time. In response to this question, we demonstrate that the local-search heuristic guarantees a ( 4 ℓ + 5 ) -approximation when up to ℓ ( ℓ + 1 ) facilities are allowed to be swapped in each iteration, thus providing an affirmative answer to the question. Our main technical contribution is a novel approach for theoretically analyzing the local-search heuristic, which bounds its approximation ratio by linearly combining the clustering cost increases induced by a set of hierarchically organized swaps. Our techniques also generalize to the k-means clustering formulation and reveal similar approximation guarantees for the local-search heuristic.

NeurIPS Conference 2025 Conference Paper

Towards Unsupervised Open-Set Graph Domain Adaptation via Dual Reprogramming

  • Zhen Zhang
  • Bingsheng He

Unsupervised Graph Domain Adaptation has become a promising paradigm for transferring knowledge from a fully labeled source graph to an unlabeled target graph. Existing graph domain adaptation models primarily focus on the closed-set setting, where the source and target domains share the same label spaces. However, this assumption might not be practical in the real-world scenarios, as the target domain might include classes that are not present in the source domain. In this paper, we investigate the problem of unsupervised open-set graph domain adaptation, where the goal is to not only correctly classify target nodes into the known classes, but also recognize previously unseen node types into the unknown class. Towards this end, we propose a novel framework called GraphRTA, which conducts reprogramming on both the graph and model sides. Specifically, we reprogram the graph by modifying target graph structure and node features, which facilitates better separation of known and unknown classes. Meanwhile, we also perform model reprogramming by pruning domain-specific parameters to reduce bias towards the source graph while preserving parameters that capture transferable patterns across graphs. Additionally, we extend the classifier with an extra dimension for the unknown class, thus eliminating the need of manually specified threshold in open-set recognition. Comprehensive experiments on several public datasets demonstrate that our proposed model can achieve satisfied performance compared with recent state-of-the-art baselines. Our source codes and datasets are publicly available at https: //github. com/cszhangzhen/GraphRTA.

EAAI Journal 2024 Journal Article

A federated transfer learning approach for surface electromyographic hand gesture recognition with emphasis on privacy preservation

  • Zhen Zhang
  • Yuewei Ming
  • Yanyu Wang

Recently, surface electromyographic (sEMG) hand gesture recognition faces a serious challenge of limited training data in various scenarios. Numerous efforts have been made to address this issue by leveraging data from other subjects. However, the utilization of sensitive sEMG data from other subjects raises the risk of privacy leakage and data security. In this study, a novel federated transfer learning approach is proposed, aiming to use data from other subjects to enhance recognition accuracy while protecting the privacy of these data. At first, a hybrid model incorporating a convolutional neural network and self-attention has been introduced, which has strong gesture recognition ability. Then, a two-stage federated transfer learning framework is proposed, including federated pre-training stage and personalized fine-tuning stage. In the first stage, a federated learning strategy is used to pre-train a knowledge-sharing hybrid model without revealing raw sEMG data from other subjects. In the second stage, a transfer learning strategy is applied to fine-tune the hybrid model according to the characteristics of the target subject. Experimental results show that the proposed method not only addresses the challenge of insufficient data by federating with other subjects while prioritizing privacy preservation, but also helps to enhance the personalized adaptation of shared knowledge to the target subject. Comparative analyses against local training and traditional federated learning reveal significant accuracy improvements of up to 238. 52% and 124. 01%, respectively, underscoring the efficacy of our proposed method.

EAAI Journal 2024 Journal Article

A quality function deployment model by social network and group decision making: Application to product design of e-commerce platforms

  • Tiantian Gai
  • Jian Wu
  • Changyong Liang
  • Mingshuo Cao
  • Zhen Zhang

Quality function deployment (QFD) is an effective method to convert customer requirements (CRs) into design requirements (DRs) by constructing house of quality (HOQ). With the rapid growth of the e-commerce market, it is a new challenge to utilize the available online reviews to facilitate the implementation of QFD. Therefore, this paper proposes a novel QFD model from the perspective of group decision making (GDM) and social network analysis (SNA), then applies the proposed model to product design under Chinese e-commerce scene. Firstly, this paper extracts CRs from online reviews on e-commerce platforms, and the initial HOQs can be constructed. Then a bilateral negotiation GDM method based on SNA is carried out to generate a consensus-based HOQ, and therefore the final priorities of DRs can be obtained. Finally, a case study is provided to illustrate the applicability, and some discussions and comparative analysis are also conducted. The result indicates that the proposed method can generate effective and stable results for QFD implementation in real-world e-commerce scenario.

EAAI Journal 2024 Journal Article

Convolutional variational autoencoder and multi-scale attention convolutional neural network based diagnostics on filament current sensors for mass spectrometers

  • Xinshuo Li
  • Wenxing Zhou
  • Jiancheng Yin
  • Zhen Zhang
  • Gang Huang
  • Yunlong Sheng
  • Pinghua Li
  • Xuye Zhuang

Fault detection of the filament current sensor of the spaceborne mass spectrometer is of great significance to the safe operation of the mass spectrometer. Neglecting sensor failures may affect the normal operation of the mass spectrometer, which in turn affects the health of the astronauts and the space missions. This paper proposes an enhanced intelligent diagnosis method based on filament current sensor for mass spectrometer via improved deep learning network, aiming to improve the accuracy and reliability of the filament current sensor when the fault samples are insufficient. The improved convolutional variational autoencoder (CVAE) model not only enhances the data for four typical sensor fault signals, namely bias, drift, missing and random, but also solves the problem of insufficient samples when spike, Precision degradation and stuck fault occur in sensors. Short-time Fourier transform (STFT) is utilized to transform one-dimensional data into two-dimensional spectrograms, which gives more fault characteristics to the data set. The improved multi-scale attention mechanism convolutional neural network (MSAM-CNN) model is constructed to perform fault diagnosis on the generated spectrogram, which solves the problem of low accuracy of fault identification in traditional convolutional neural network (CNN) models. The results of ablation and comparison experiments show that the samples generated by CVAE have smaller Mean Absolute Error (MAE), Mean Square Error (MSE), and Root Mean Square Error (RMSE), the enhanced samples improve the classification and clustering of MSAM-CNN, and compared to other diagnostic models, MSAM-CNN achieves the highest accuracy, precision, recall, and F1-score of 99. 2%, 99. 3%, 98. 8%, and 0. 991.

AAAI Conference 2024 Conference Paper

Coreference Graph Guidance for Mind-Map Generation

  • Zhuowei Zhang
  • Mengting Hu
  • Yinhao Bai
  • Zhen Zhang

Mind-map generation aims to process a document into a hierarchical structure to show its central idea and branches. Such a manner is more conducive to understanding the logic and semantics of the document than plain text. Recently, a state-of-the-art method encodes the sentences of a document sequentially and converts them to a relation graph via sequence-to-graph. Though this method is efficient to generate mind-maps in parallel, its mechanism focuses more on sequential features while hardly capturing structural information. Moreover, it's difficult to model long-range semantic relations. In this work, we propose a coreference-guided mind-map generation network (CMGN) to incorporate external structure knowledge. Specifically, we construct a coreference graph based on the coreference semantic relationship to introduce the graph structure information. Then we employ a coreference graph encoder to mine the potential governing relations between sentences. In order to exclude noise and better utilize the information of the coreference graph, we adopt a graph enhancement module in a contrastive learning manner. Experimental results demonstrate that our model outperforms all the existing methods. The case study further proves that our model can more accurately and concisely reveal the structure and semantics of a document. Code and data are available at https://github.com/Cyno2232/CMGN.

TMLR Journal 2024 Journal Article

InvariantStock: Learning Invariant Features for Mastering the Shifting Market

  • Haiyao Cao
  • Jinan Zou
  • Yuhang Liu
  • Zhen Zhang
  • Ehsan Abbasnejad
  • Anton van den Hengel
  • Javen Qinfeng Shi

Accurately predicting stock returns is crucial for effective portfolio management. However, existing methods often overlook a fundamental issue in the market, namely, distribution shifts, making them less practical for predicting future markets or newly listed stocks. This study introduces a novel approach to address this challenge by focusing on the acquisition of invariant features across various environments, thereby enhancing robustness against distribution shifts. Specifically, we present InvariantStock, a designed learning framework comprising two key modules: an environment-aware prediction module and an environment-agnostic module. Through the designed learning of these two modules, the proposed method can learn invariant features across different environments in a straightforward manner, significantly improving its ability to handle distribution shifts in diverse market settings. Our results demonstrate that the proposed InvariantStock not only delivers robust and accurate predictions but also outperforms existing baseline methods in both prediction tasks and backtesting within the dynamically changing markets of China and the United States.

EAAI Journal 2024 Journal Article

Multi-agent deep reinforcement learning with enhanced collaboration for distribution network voltage control

  • Jiapeng Huang
  • Huifeng Zhang
  • Ding Tian
  • Zhen Zhang
  • Chengqian Yu
  • Gerhard P. Hancke

Due to the increasing high penetration of Photovoltaic (PV), it brings great challenge for voltage control issue of distribution network. To address this problem, this paper presents an improved collaborative Multi-Agent Reinforcement Learning (MARL) approach for proactive voltage control, aimed at mitigating voltage violations and minimizing power losses. The self-attention mechanism is embedded into the multi-agent soft actor-critic (MASAC) algorithm to enhance the collaboration of multi-agent system, which can well improve the learning efficiency to ensure the voltage safety of Distribution Network. In addition, the proposed learning approach is implemented on IEEE 33-bus, 141-bus and 322-bus systems, and the simulation results reveal that the proposed approach can control the voltage into safety domain as well as reduce power losses.

NeurIPS Conference 2024 Conference Paper

Multi-Chain Graphs of Graphs: A New Approach to Analyzing Blockchain Datasets

  • Bingqiao Luo
  • Zhen Zhang
  • Qian Wang
  • Bingsheng He

Machine learning applied to blockchain graphs offers significant opportunities for enhanced data analysis and applications. However, the potential of this field is constrained by the lack of a large-scale, cross-chain dataset that includes hierarchical graph-level data. To address this issue, we present novel datasets that provide detailed label information at the token level and integrate interactions between tokens across multiple blockchain platforms. We model transactions within each token as local graphs and the relationships between tokens as global graphs, collectively forming a "Graphs of Graphs" (GoG) approach. This innovative approach facilitates a deeper understanding of systemic structures and hierarchical interactions, which are essential for applications such as link prediction, anomaly detection, and token classification. We conduct a series of experiments demonstrating that this dataset delivers new insights and challenges for exploring GoG within the blockchain domain. Our work promotes advancements and opens new avenues for research in both the blockchain and graph communities. Source code and datasets are available at https: //github. com/Xtra-Computing/Cryptocurrency-Graphs-of-graphs.

EAAI Journal 2024 Journal Article

Multiple adaptive over-sampling for imbalanced data evidential classification

  • Zhen Zhang
  • Hong-peng Tian
  • Jin-shuai Jin

Over-sampling approaches focus on generating samples to balance the dataset and have been widely applied in classifying imbalanced data. However, existing approaches do not take into account the uncertainty of generated samples, which may alter the data distribution and introduce uncertain information into the classification process. To tackle this issue, we propose a multiple adaptive over-sampling approach (MAO) for classifying imbalanced data based on evidence reasoning. First, we construct balanced training sets through multiple adaptive over-sampling for the minority class, which characterizes the uncertainty of over-sampling. Then, we define the intra- and inter-class inconsistency of data distribution after over-sampling to quantify the weights of different classifiers trained by various balanced subsets, weakening the negative impact of changes in data distribution on classification. Finally, we employ neighbor information to revise the results of samples that are hard to classify correctly, to avoid the risk of misclassification caused by uncertain synthetic samples to some extent. The effectiveness of MAO has been verified on several real imbalanced datasets by comparing it with other related approaches.

EAAI Journal 2024 Journal Article

Online cross session electromyographic hand gesture recognition using deep learning and transfer learning

  • Zhen Zhang
  • Shilong Liu
  • Yanyu Wang
  • Wei Song
  • Yuhui Zhang

In recent years, hand gesture recognition in human-computer interfaces is usually based on surface electromyography because the signals are non-intrusive and are not affected by the variations of light, position, and orientation of the hand. Deep learning algorithms have become increasingly more prominent in gesture recognition for the ability to automatically learn features from large amounts of data. However, delicate and complicated network structures brought by deep learning, which are elaborately designed for cross session tasks, need more computing time to be trained and tested, which can hardly be applied to the online system. In this study, an online electromyographic hand gesture recognition method using deep learning and transfer learning is proposed. The deep learning model includes a feature extractor, a label classifier, and a gesture predictor. The feature extractor is based on the temporal convolutional network, which is designed to learn high-level discriminant features from the input signals. The label classifier includes three fully connected layers, designed to classify hand gesture labels using the feature vector which is produced by the feature extractor. The gesture predictor uses a threshold voting algorithm to predict the gesture, used at the stage of testing to perform the online recognition. Transfer learning technique is used to transfer model parameters from one pre-trained model, which costs less time and can be applied for online applications. The proposed model is verified on both the Myo dataset and the public NinaPro database. The proposed transfer learning scheme is shown to systematically and significantly enhance the performance of the proposed model on the two datasets, only using no more than three sessions to retrain the label predictor can achieve the accuracy of more than 90% of that obtained though the normal training of the whole parts of the model using full training sessions.

NeurIPS Conference 2024 Conference Paper

Parameterized Approximation Schemes for Fair-Range Clustering

  • Zhen Zhang
  • Xiaohong Chen
  • Limei Liu
  • Jie Chen
  • Junyu Huang
  • Qilong Feng

Fair-range clustering extends classical clustering formulations by associating each data point with one or more demographic labels. It imposes lower and upper bound constraints on the number of facilities opened for each label, ensuring fair representation of all demographic groups by the selected facilities. In this paper we focus on the fair-range $k$-median and $k$-means problems in Euclidean spaces. We give $(1+\varepsilon)$-approximation algorithms with fixed-parameter tractable running times for both problems, parameterized by the numbers of opened facilities and demographic labels. For Euclidean metrics, these are the first parameterized approximation schemes for the problems, improving upon the previously known $O(1)$-approximation ratios given by Thejaswi et al. (KDD 2022).

EAAI Journal 2024 Journal Article

Photovoltaic power forecasting: A dual-attention gated recurrent unit framework incorporating weather clustering and transfer learning strategy

  • Yugui Tang
  • Kuo Yang
  • Shujing Zhang
  • Zhen Zhang

Accurate forecasting of photovoltaic power is essential in the integration, operation, and scheduling of hybrid energy systems. However, modeling for newly built photovoltaic sites is restricted by insufficient training data and computational burden. In this study, a weather clustering-based photovoltaic power forecasting framework incorporating attention mechanism and transfer learning strategy is proposed. By clustering historical days into multiple weather types, the gated recurrent unit-based encoder-decoders with dual-attention mechanism are designed to predict the photovoltaic power generations. The input attention and temporal attention mechanism are responsible for rebuilding input variables and context vectors of the encoder-decoder structure, respectively. Furthermore, a knowledge-transferring strategy, which focuses on establishing an alignment mapping module between the pre-trained structure and the target domain data, is designed for overcoming insufficient data of newly built sites. The data from the actual photovoltaic system are acquired to validate the proposed framework. The proposed forecasting model presents superior performance than other benchmark models, and the knowledge-transferring strategy not only addresses data shortage but also significantly accelerates the training process. With the introduction of knowledge-transferring, the maximum improvement in forecasting accuracy and training efficiency reaches 67. 40% and 59. 10%.

AAAI Conference 2024 Conference Paper

Rethinking Propagation for Unsupervised Graph Domain Adaptation

  • Meihan Liu
  • Zeyu Fang
  • Zhen Zhang
  • Ming Gu
  • Sheng Zhou
  • Xin Wang
  • Jiajun Bu

Unsupervised Graph Domain Adaptation (UGDA) aims to transfer knowledge from a labelled source graph to an unlabelled target graph in order to address the distribution shifts between graph domains. Previous works have primarily focused on aligning data from the source and target graph in the representation space learned by graph neural networks (GNNs). However, the inherent generalization capability of GNNs has been largely overlooked. Motivated by our empirical analysis, we reevaluate the role of GNNs in graph domain adaptation and uncover the pivotal role of the propagation process in GNNs for adapting to different graph domains. We provide a comprehensive theoretical analysis of UGDA and derive a generalization bound for multi-layer GNNs. By formulating GNN Lipschitz for k-layer GNNs, we show that the target risk bound can be tighter by removing propagation layers in source graph and stacking multiple propagation layers in target graph. Based on the empirical and theoretical analysis mentioned above, we propose a simple yet effective approach called A2GNN for graph domain adaptation. Through extensive experiments on real-world datasets, we demonstrate the effectiveness of our proposed A2GNN framework.

NeurIPS Conference 2024 Conference Paper

Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation

  • Meihan Liu
  • Zhen Zhang
  • Jiachen Tang
  • Jiajun Bu
  • Bingsheng He
  • Sheng Zhou

Unsupervised Graph Domain Adaptation (UGDA) involves the transfer of knowledge from a label-rich source graph to an unlabeled target graph under domain discrepancies. Despite the proliferation of methods designed for this emerging task, the lack of standard experimental settings and fair performance comparisons makes it challenging to understand which and when models perform well across different scenarios. To fill this gap, we present the first comprehensive benchmark for unsupervised graph domain adaptation named GDABench, which encompasses 16 algorithms across diverse adaptation tasks. Through extensive experiments, we observe that the performance of current UGDA models varies significantly across different datasets and adaptation scenarios. Specifically, we recognize that when the source and target graphs face significant distribution shifts, it is imperative to formulate strategies to effectively address and mitigate graph structural shifts. We also find that with appropriate neighbourhood aggregation mechanisms, simple GNN variants can even surpass state-of-the-art UGDA baselines. To facilitate reproducibility, we have developed an easy-to-use library PyGDA for training and evaluating existing UGDA methods, providing a standardized platform in this community. Our source codes and datasets can be found at https: //github. com/pygda-team/pygda.

AAAI Conference 2024 Conference Paper

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation

  • Zhen Zhang
  • Junfeng Yang
  • Limei Liu
  • Xuesong Xu
  • Guozhen Rong
  • Qilong Feng

The representative k-median problem generalizes the classical clustering formulations in that it partitions the data points into several disjoint demographic groups and poses a lower-bound constraint on the number of opened facilities from each group, such that all the groups are fairly represented by the opened facilities. Due to its simplicity, the local-search heuristic that optimizes an initial solution by iteratively swapping at most a constant number of closed facilities for the same number of opened ones (denoted by the O(1)-swap heuristic) has been frequently used in the representative k-median problem. Unfortunately, despite its good performance exhibited in experiments, whether the O(1)-swap heuristic has provable approximation guarantees for the case where the number of groups is more than 2 remains an open question for a long time. As an answer to this question, we show that the O(1)-swap heuristic (1) is guaranteed to yield a constant-factor approximation solution if the number of groups is a constant, and (2) has an unbounded approximation ratio otherwise. Our main technical contribution is a new approach for theoretically analyzing local-search heuristics, which derives the approximation ratio of the O(1)-swap heuristic via linearly combining the increased clustering costs induced by a set of hierarchically organized swaps.

JBHI Journal 2023 Journal Article

An Enhanced EEG Microstate Recognition Framework Based on Deep Neural Networks: An Application to Parkinson's Disease

  • Chunguang Chu
  • Zhen Zhang
  • Zhenxi Song
  • Zifan Xu
  • Jiang Wang
  • Fei Wang
  • Wei Liu
  • Liying Lu

Variations in brain activity patterns reveal impairments of motor and cognitive functions in the human brain. Electroencephalogram (EEG) microstates embody brain activity patterns at a microscopic time scale. However, current microstate analysis method can only recognize less than 90% of EEG signals per subject, which severely limits the characterization of dynamic brain activity. As an application to early Parkinson's disease (PD), we propose an enhanced EEG microstate recognition framework based on deep neural networks, which yields recognition rates from 90% to 99%, as accompanied by a strong anti-artifact property. Additionally, gradient-weighted class activation mapping, as a visualization technique, is employed to locate the activated functional brain regions of each microstate class. We find that each microstate class corresponds to a particular activated brain region. Finally, based on the improved identification of microstate sequences, we explore the EEG microstate characteristics and their clinical associations. We show that the decreased occurrences of a particular microstate class reflect the degree of cognitive decline in early PD, and reduced transitions between certain microstates suggest injury in motor-related brain regions. The novel EEG microstate recognition framework paves the way to revealing more effective biomarkers for early PD.

JMLR Journal 2023 Journal Article

Factor Graph Neural Networks

  • Zhen Zhang
  • Mohammed Haroon Dupty
  • Fan Wu
  • Javen Qinfeng Shi
  • Wee Sun Lee

In recent years, we have witnessed a surge of Graph Neural Networks (GNNs), most of which can learn powerful representations in an end-to-end fashion with great success in many real-world applications. They have resemblance to Probabilistic Graphical Models (PGMs), but break free from some limitations of PGMs. By aiming to provide expressive methods for representation learning instead of computing marginals or most likely configurations, GNNs provide flexibility in the choice of information flowing rules while maintaining good performance. Despite their success and inspirations, they lack efficient ways to represent and learn higher-order relations among variables/nodes. More expressive higher-order GNNs which operate on k-tuples of nodes need increased computational resources in order to process higher-order tensors. We propose Factor Graph Neural Networks (FGNNs) to effectively capture higher-order relations for inference and learning. To do so, we first derive an efficient approximate Sum-Product loopy belief propagation inference algorithm for discrete higher-order PGMs. We then neuralize the novel message passing scheme into a Factor Graph Neural Network (FGNN) module by allowing richer representations of the message update rules; this facilitates both efficient inference and powerful end-to-end learning. We further show that with a suitable choice of message aggregation operators, our FGNN is also able to represent Max-Product belief propagation, providing a single family of architecture that can represent both Max and Sum-Product loopy belief propagation. Our extensive experimental evaluation on synthetic as well as real datasets demonstrates the potential of the proposed model. [abs] [ pdf ][ bib ] [ code ] &copy JMLR 2023. ( edit, beta )

TCS Journal 2023 Journal Article

Improved approximation algorithms for solving the squared metric k-facility location problem

  • Zhen Zhang
  • Qilong Feng
  • Junyu Huang
  • Jianxin Wang

The squared metric k-facility location problem is a frequently encountered generalization of the k-means problem, where a specific cost should be paid for opening each facility. The current best approximation ratio for this problem is 44. 473 + ϵ, which was obtained using a local search algorithm. We advance the state-of-the-art for the problem by devising a Lagrangian relaxation-based algorithm that achieves an improved approximation guarantee of 36. 342 + ϵ. Our improvement comes from a new deterministic rounding approach, which exploits the properties of the squared metric.

NeurIPS Conference 2023 Conference Paper

Live Graph Lab: Towards Open, Dynamic and Real Transaction Graphs with NFT

  • Zhen Zhang
  • Bingqiao Luo
  • Shengliang Lu
  • Bingsheng He

Numerous studies have been conducted to investigate the properties of large-scale temporal graphs. Despite the ubiquity of these graphs in real-world scenarios, it's usually impractical for us to obtain the whole real-time graphs due to privacy concerns and technical limitations. In this paper, we introduce the concept of {\it Live Graph Lab} for temporal graphs, which enables open, dynamic and real transaction graphs from blockchains. Among them, Non-fungible tokens (NFTs) have become one of the most prominent parts of blockchain over the past several years. With more than \$40 billion market capitalization, this decentralized ecosystem produces massive, anonymous and real transaction activities, which naturally forms a complicated transaction network. However, there is limited understanding about the characteristics of this emerging NFT ecosystem from a temporal graph analysis perspective. To mitigate this gap, we instantiate a live graph with NFT transaction network and investigate its dynamics to provide new observations and insights. Specifically, through downloading and parsing the NFT transaction activities, we obtain a temporal graph with more than 4. 5 million nodes and 124 million edges. Then, a series of measurements are presented to understand the properties of the NFT ecosystem. Through comparisons with social, citation, and web networks, our analyses give intriguing findings and point out potential directions for future exploration. Finally, we also study machine learning models in this live graph to enrich the current datasets and provide new opportunities for the graph community. The source codes and dataset are available at https: //livegraphlab. github. io.

AAAI Conference 2023 Conference Paper

Only a Few Classes Confusing: Pixel-Wise Candidate Labels Disambiguation for Foggy Scene Understanding

  • Liang Liao
  • Wenyi Chen
  • Zhen Zhang
  • Jing Xiao
  • Yan Yang
  • Chia-Wen Lin
  • Shin'ichi Satoh

Not all semantics become confusing when deploying a semantic segmentation model for real-world scene understanding of adverse weather. The true semantics of most pixels have a high likelihood of appearing in the few top classes according to confidence ranking. In this paper, we replace the one-hot pseudo label with a candidate label set (CLS) that consists of only a few ambiguous classes and exploit its effects on self-training-based unsupervised domain adaptation. Specifically, we formulate the problem as a coarse-to-fine process. In the coarse-level process, adaptive CLS selection is proposed to pick a minimal set of confusing candidate labels based on the reliability of label predictions. Then, representation learning and label rectification are iteratively performed to facilitate feature clustering in an embedding space and to disambiguate the confusing semantics. Experimentally, our method outperforms the state-of-the-art methods on three realistic foggy benchmarks.

TCS Journal 2023 Journal Article

The family of generalized variational network of cube-connected cycles

  • Weifeng Li
  • Longxin Lin
  • Zhen Zhang
  • Shuqiang Huang

The R V C C C r is a kind of variant network of cube-connected cycle (CCC) network, which is constructed by replacing each vertex in the hypercube with a circle of length 2r, and the hypercube is r-dimensional. The R V C C C r is regular and vertex-symmetric, which makes its topological properties easy to be analyzed. However, the length of the circle in R V C C C r is fixed to 2r which makes R V C C C r is inflexible. This paper proposes the family of generalized variational CCC networks, named R V C C C ( r, k ), where r is the dimension of the underlying hypercube and the length of each cycle in R V C C C ( r, k ) is k × r. Same to R V C C C r, the R V C C C ( r, k ) is also regular and vertex-symmetry. Since the length of each circle in R V C C C ( r, k ) is k × r, the R V C C C ( r, k ) is more suitable to construct any scale interconnection network than R V C C C r. After calculating the shortest internode distance between any two vertices in the R V C C C ( r, k ), we obtained the exact diameter of this network and the optimal routing algorithm was developed.

TCS Journal 2022 Journal Article

Better guarantees for k-median with service installation costs

  • Zhen Zhang
  • Yipeng Zhou
  • Shaoqian Yu

k-median with service installation costs is a frequently encountered problem in applications involving multiple service requirements, which generalizes the standard k-median problem in that each client is associated with a specific service and can only be connected to the facilities where the service is installed. In this paper, we give a ( 13. 349 + ϵ ) -approximation algorithm for the k-median with service installation costs problem, improving upon the previous best approximation ratio of 18. We propose a new deterministic rounding approach to deal with the challenges caused by the service requirements, which is the crucial step in getting the improved ratio.

NeurIPS Conference 2022 Conference Paper

Sparse Structure Search for Delta Tuning

  • Shengding Hu
  • Zhen Zhang
  • Ning Ding
  • Yadao Wang
  • Yasheng Wang
  • Zhiyuan Liu
  • Maosong Sun

Adapting large pre-trained models (PTMs) through fine-tuning imposes prohibitive computational and storage burdens. Recent studies of delta tuning (DT), i. e. , parameter-efficient tuning, find that only optimizing a small portion of parameters conditioned on PTMs could yield on-par performance compared to conventional fine-tuning. Generally, DT methods exquisitely design delta modules (DT modules) which could be applied to arbitrary fine-grained positions inside PTMs. However, the effectiveness of these fine-grained positions largely relies on sophisticated manual designation, thereby usually producing sub-optimal results. In contrast to the manual designation, we explore constructing DT modules in an automatic manner. We automatically \textbf{S}earch for the \textbf{S}parse \textbf{S}tructure of \textbf{Delta} Tuning (S$^3$Delta). Based on a unified framework of various DT methods, S$^3$Delta conducts the differentiable DT structure search through bi-level optimization and proposes shifted global sigmoid method to explicitly control the number of trainable parameters. Extensive experiments show that S$^3$Delta surpasses manual and random structures with less trainable parameters. The searched structures preserve more than 99\% fine-tuning performance with 0. 01\% trainable parameters. Moreover, the advantage of S$^3$Delta is amplified with extremely low trainable parameters budgets (0. 0009\%$\sim$0. 01\%). The searched structures are transferable and explainable, providing suggestions and guidance for the future design of DT methods. Our codes are publicly available at \url{https: //github. com/thunlp/S3Delta}.

YNIMG Journal 2022 Journal Article

Subthalamic and pallidal stimulation in Parkinson's disease induce distinct brain topological reconstruction

  • Chunguang Chu
  • Naying He
  • Kristina Zeljic
  • Zhen Zhang
  • Jiang Wang
  • Jun Li
  • Yu Liu
  • Youmin Zhang

The subthalamic nucleus (STN) and globus pallidus internus (GPi) are the two most common and effective target brain areas for deep brain stimulation (DBS) treatment of advanced Parkinson's disease. Although DBS has been shown to restore functional neural circuits of this disorder, the changes in topological organization associated with active DBS of each target remain unknown. To investigate this, we acquired resting-state functional magnetic resonance imaging (fMRI) data from 34 medication-free patients with Parkinson's disease that had DBS electrodes implanted in either the subthalamic nucleus or internal globus pallidus (n = 17 each), in both ON and OFF DBS states. Sixteen age-matched healthy individuals were used as a control group. We evaluated the regional information processing capacity and transmission efficiency of brain networks with and without stimulation, and recorded how stimulation restructured the brain network topology of patients with Parkinson's disease. For both targets, the variation of local efficiency in motor brain regions was significantly correlated (p < 0.05) with improvement rate of the Uniform Parkinson's Disease Rating Scale-III scores, with comparable improvements in motor function for the two targets. However, non-motor brain regions showed changes in topological organization during active stimulation that were target-specific. Namely, targeting the STN decreased the information transmission of association, limbic and paralimbic regions, including the inferior frontal gyrus angle, insula, temporal pole, superior occipital gyri, and posterior cingulate, as evidenced by the simultaneous decrease of clustering coefficient and local efficiency. GPi-DBS had a similar effect on the caudate and lenticular nuclei, but enhanced information transmission in the cingulate gyrus. These effects were not present in the DBS-OFF state for GPi-DBS, but persisted for STN-DBS. Our results demonstrate that DBS to the STN and GPi induce distinct brain network topology reconstruction patterns, providing innovative theoretical evidence for deciphering the mechanism through which DBS affects disparate targets in the human brain.

NeurIPS Conference 2022 Conference Paper

Truncated Matrix Power Iteration for Differentiable DAG Learning

  • Zhen Zhang
  • Ignavier Ng
  • Dong Gong
  • Yuhang Liu
  • Ehsan Abbasnejad
  • Mingming Gong
  • Kun Zhang
  • Javen Qinfeng Shi

Recovering underlying Directed Acyclic Graph (DAG) structures from observational data is highly challenging due to the combinatorial nature of the DAG-constrained optimization problem. Recently, DAG learning has been cast as a continuous optimization problem by characterizing the DAG constraint as a smooth equality one, generally based on polynomials over adjacency matrices. Existing methods place very small coefficients on high-order polynomial terms for stabilization, since they argue that large coefficients on the higher-order terms are harmful due to numeric exploding. On the contrary, we discover that large coefficients on higher-order terms are beneficial for DAG learning, when the spectral radiuses of the adjacency matrices are small, and that larger coefficients for higher-order terms can approximate the DAG constraints much better than the small counterparts. Based on this, we propose a novel DAG learning method with efficient truncated matrix power iteration to approximate geometric series based DAG constraints. Empirically, our DAG learning method outperforms the previous state-of-the-arts in various settings, often by a factor of $3$ or more in terms of structural Hamming distance.

EAAI Journal 2021 Journal Article

A bidirectional graph neural network for traveling salesman problems on arbitrary symmetric graphs

  • Yujiao Hu
  • Zhen Zhang
  • Yuan Yao
  • Xingpeng Huyan
  • Xingshe Zhou
  • Wee Sun Lee

Deep learning has recently been shown to provide great achievement to the traveling salesman problem (TSP) on the Euclidean graphs. These methods usually fully represent the graph by a set of coordinates, and then captures graph information from the coordinates to generate the solution. The TSP on arbitrary symmetric graphs models more realistic applications where the working graphs maybe sparse, or the distance between points on the graphs may not satisfy the triangle inequality. When prior learning-based methods being applied to the TSP on arbitrary symmetric graphs, they are not capable to capture graph features that are beneficial to produce near-optimal solutions. Moreover, they suffer from serious exploration problems. This paper proposes a bidirectional graph neural network (BGNN) for the arbitrary symmetric TSP. The network learns to produce the next city to visit sequentially by imitation learning. The bidirectional message passing layer is designed as the most important component of BGNN. It is able to encode graphs based on edges and partial solutions. By this way, the proposed approach is much possible to construct near-optimal solutions for the TSP on arbitrary symmetric graphs, and it is able to be combined with informed search to further improve performance.

TCS Journal 2021 Journal Article

Fixed-parameter tractability for the Tree Assembly problem

  • Feng Shi
  • Jie You
  • Zhen Zhang
  • Jingyi Liu
  • Jianxin Wang

Calculating the “distance” between two given objects with respect to a designated “editing” operation is a hot research area in bioinformatics, where the “distance” is always defined as the minimum number of the “editing” operations required to transform one object into the other one. One of the famous problems in the area is the Minimum Common String Partition problem, which is the simplified variant of the Minimum Tree Cut/Paste Distance problem. Within the paper, we consider another simplified variant of the Minimum Tree Cut/Paste Distance problem, named Tree Assembly problem, of which the edge-deletion operations are specified. More specifically, the Tree Assembly problem aims to transform a given forest into a given tree by edge-addition operations only. In our investigations, we present a fixed-parameter algorithm with runtime 2 O ( k log ⁡ k ) n O ( 1 ) for the Tree Assembly problem, where k is the number of trees in the given forest, and n is the number of nodes in the given tree and forest. Additionally, we give a polynomial time algorithm for a restricted variant of the problem.

TCS Journal 2021 Journal Article

Improved approximation for prize-collecting red-blue median

  • Zhen Zhang
  • Yutian Guo
  • Junyu Huang
  • Jianxin Wang
  • Feng Shi

The red-blue median problem considers a set of red facilities, a set of blue facilities, and a set of clients located in some metric space. The goal is to open k r red facilities and k b blue facilities such that the sum of the distance from each client to its nearest opened facility is minimized, where k r, k b ≥ 0 are two given integers. Designing approximation algorithms for this problem remains an active area of research due to its applications in various fields. However, in many applications, the existence of noisy data poses a big challenge for the problem. In this paper, we consider the prize-collecting red-blue median problem, where the noisy data can be removed by paying a penalty cost. The current best approximation guarantee for the prize-collecting red-blue median problem is a ratio of 24, which was obtained by LP-rounding. We deal with this problem using a local search algorithm. We construct a layered structure of the swap pairs, which yields a ( 9 + ϵ ) -approximation for the prize-collecting red-blue median problem. Our techniques generalize to a more general prize-collecting τ-color median problem, where the facilities have τ different types, and give a ( 4 τ + 1 + ϵ ) -approximation for the case where τ is a constant.

NeurIPS Conference 2020 Conference Paper

Factor Graph Neural Networks

  • Zhen Zhang
  • Fan Wu
  • Wee Sun Lee

Most of the successful deep neural network architectures are structured, often consisting of elements like convolutional neural networks and gated recurrent neural networks. Recently, graph neural networks (GNNs) have been successfully applied to graph-structured data such as point cloud and molecular data. These networks often only consider pairwise dependencies, as they operate on a graph structure. We generalize the GNN into a factor graph neural network (FGNN) providing a simple way to incorporate dependencies among multiple variables. We show that FGNN is able to represent Max-Product belief propagation, an approximate inference method on probabilistic graphical models, providing a theoretical understanding on the capabilities of FGNN and related GNNs. Experiments on synthetic and real datasets demonstrate the potential of the proposed architecture.

AAAI Conference 2020 Conference Paper

Visual Relationship Detection with Low Rank Non-Negative Tensor Decomposition

  • Mohammed Haroon Dupty
  • Zhen Zhang
  • Wee Sun Lee

We address the problem of Visual Relationship Detection (VRD) which aims to describe the relationships between pairs of objects in the form of triplets of (subject, predicate, object). We observe that given a pair of bounding box proposals, objects often participate in multiple relations implying the distribution of triplets is multimodal. We leverage the strong correlations within triplets to learn the joint distribution of triplet variables conditioned on the image and the bounding box proposals, doing away with the hitherto used independent distribution of triplets. To make learning the triplet joint distribution feasible, we introduce a novel technique of learning conditional triplet distributions in the form of their normalized low rank non-negative tensor decompositions. Normalized tensor decompositions take form of mixture distributions of discrete variables and thus are able to capture multimodality. This allows us to efficiently learn higher order discrete multimodal distributions and at the same time keep the parameter size manageable. We further model the probability of selecting an object proposal pair and include a relation triplet prior in our model. We show that each part of the model improves performance and the combination outperforms stateof-the-art score on the Visual Genome (VG) and Visual Relationship Detection (VRD) datasets.

NeurIPS Conference 2019 Conference Paper

KerGM: Kernelized Graph Matching

  • Zhen Zhang
  • Yijian Xiang
  • Lingfei Wu
  • Bing Xue
  • Arye Nehorai

Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's QAP. In our paper, we provide a unifying view for these two problems by introducing new rules for array operations in Hilbert spaces. Consequently, Lawler's QAP can be considered as the Koopmans-Beckmann's alignment between two arrays in reproducing kernel Hilbert spaces (RKHS), making it possible to efficiently solve the problem without computing a huge affinity matrix. Furthermore, we develop the entropy-regularized Frank-Wolfe (EnFW) algorithm for optimizing QAPs, which has the same convergence rate as the original FW algorithm while dramatically reducing the computational burden for each outer iteration. We conduct extensive experiments to evaluate our approach, and show that our algorithm significantly outperforms the state-of-the-art in both matching accuracy and scalability.

TCS Journal 2019 Journal Article

RVCCC: A new variational network of cube-connected cycles and its topological properties

  • Zhen Zhang
  • Shu-Qiang Huang
  • Dong Guo
  • Yong-Hui Li

The CCC( r, n ) network is an extension of the hypercube which replaces each vertex with a cycle of length n, providing that the hypercube is r-dimensional. When n > r, the CCC( r, n ) network contains more vertices than that of CCC( r, r ), which makes it more useful in the construction of a large-scale interconnection network. However, the CCC( r, n ) is irregular when n > r, which makes their properties difficult to be analyzed. In this paper, we propose a new variational network of the cube-connected cycles (RVCCC). The RVCCC networks have the properties of regularity, vertex-symmetry, and low diameter. Compared with the general CCC networks, the RVCCC networks are more suitable for constructing a large-scale interconnection network. After the shortest internode distance between any two vertices in the RVCCC was determined, the exact diameter of this network was calculated and the communication algorithms, including the routing algorithm and the broadcasting algorithm, were also developed.

IJCAI Conference 2018 Conference Paper

ANRL: Attributed Network Representation Learning via Deep Neural Networks

  • Zhen Zhang
  • Hongxia Yang
  • Jiajun Bu
  • Sheng Zhou
  • Pinggang Yu
  • Jianwei Zhang
  • Martin Ester
  • Can Wang

Network representation learning (RL) aims to transform the nodes in a network into low-dimensional vector spaces while preserving the inherent properties of the network. Though network RL has been intensively studied, most existing works focus on either network structure or node attribute information. In this paper, we propose a novel framework, named ANRL, to incorporate both the network structure and node attribute information in a principled way. Specifically, we propose a neighbor enhancement autoencoder to model the node attribute information, which reconstructs its target neighbors instead of itself. To capture the network structure, attribute-aware skip-gram model is designed based on the attribute encoder to formulate the correlations between each node and its direct or indirect neighbors. We conduct extensive experiments on six real-world networks, including two social networks, two citation networks and two user behavior networks. The results empirically show that ANRL can achieve relatively significant gains in node classification and link prediction tasks.

NeurIPS Conference 2018 Conference Paper

RetGK: Graph Kernels based on Return Probabilities of Random Walks

  • Zhen Zhang
  • Mianzhi Wang
  • Yijian Xiang
  • Yan Huang
  • Arye Nehorai

Graph-structured data arise in wide applications, such as computer vision, bioinformatics, and social networks. Quantifying similarities among graphs is a fundamental problem. In this paper, we develop a framework for computing graph kernels, based on return probabilities of random walks. The advantages of our proposed kernels are that they can effectively exploit various node attributes, while being scalable to large datasets. We conduct extensive graph classification experiments to evaluate our graph kernels. The experimental results show that our graph kernels significantly outperform other state-of-the-art approaches in both accuracy and computational efficiency.

IJCAI Conference 2017 Conference Paper

Dynamic Programming Bipartite Belief Propagation For Hyper Graph Matching

  • Zhen Zhang
  • Julian McAuley
  • Yong Li
  • Wei Wei
  • Yanning Zhang
  • Qinfeng Shi

Hyper graph matching problems have drawn attention recently due to their ability to embed higher order relations between nodes. In this paper, we formulate hyper graph matching problems as constrained MAP inference problems in graphical models. Whereas previous discrete approaches introduce several global correspondence vectors, we introduce only one global correspondence vector, but several local correspondence vectors. This allows us to decompose the problem into a (linear) bipartite matching problem and several belief propagation sub-problems. Bipartite matching can be solved by traditional approaches, while the belief propagation sub-problem is further decomposed as two sub-problems with optimal substructure. Then a newly proposed dynamic programming procedure is used to solve the belief propagation sub-problem. Experiments show that the proposed methods outperform state-of-the-art techniques for hyper graph matching.

AAAI Conference 2017 Conference Paper

Solving Constrained Combinatorial Optimisation Problems via MAP Inference without High-Order Penalties

  • Zhen Zhang
  • Qinfeng Shi
  • Julian McAuley
  • Wei Wei
  • Yanning Zhang
  • Rui Yao
  • Anton van den Hengel

Solving constrained combinatorial optimization problems via MAP inference is often achieved by introducing extra potential functions for each constraint. This can result in very high order potentials, e. g. a 2nd -order objective with pairwise potentials and a quadratic constraint over all N variables would correspond to an unconstrained objective with an order-N potential. This limits the practicality of such an approach, since inference with high order potentials is tractable only for a few special classes of functions. We propose an approach which is able to solve constrained combinatorial problems using belief propagation without increasing the order. For example, in our scheme the 2nd -order problem above remains order 2 instead of order N. Experiments on applications ranging from foreground detection, image reconstruction, quadratic knapsack, and the M-best solutions problem demonstrate the effectiveness and efficiency of our method. Moreover, we show several situations in which our approach outperforms commercial solvers like CPLEX and others designed for specific constrained MAP inference problems.

ICRA Conference 2004 Conference Paper

Supervisory Control of a Mobile Robot for Agile Motion Coordination

  • Zhen Zhang
  • Nilanjan Sarkar
  • Xiaoping Yun

A novel approach to agile motion coordination for a mobile robot is presented. Agile maneuvering is represented by the ability of the mobile robot to track sharply discontinuous trajectories. A supervisory control framework is developed that orchestrates switching among multiple controllers to track nonsmooth trajectories. The stability of the individual controllers and the internal dynamics are proved. The stability of the switching scheme is analyzed using multiple Lyapunov functions. Results from a detailed computer simulation are presented to demonstrate the efficacy of this new approach.

I&C Journal 1990 Journal Article

Creating order in sequence spaces with simple machines

  • Rudolf Ahlswede
  • Jian-Ping Ye
  • Zhen Zhang

We intend to open a new research field towards, say, a theory of “creating order” under various constraints. As a prototype of problems guiding our investigations we study models involving sequence spaces. By “creating order” or equivalently “organization” we mean reducing in size the range of outputs by an “organizer” via a permuting channel (a simple machine), when it is fed by a given domain of inputs. The “creation of order” is assumed to come only from the permutation operation in these channels. Four types of “order creation” are considered depending on the structure of the knowledge of the organizer (limitations on mind) about the future input and past output sequences and the kinds of admissible permutations inside the channel (limitations on matter). In any case the organizer's goal is to produce output spaces of minimal cardinality (optimal organization). We present some strategies of ordering and some first and seemingly basic optimality results. After this more technical part of the paper we present some ideas about a general theory of ordering.

v2026.09.13