activity
20212026
most citedReinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems

3 citations · 5 across the 12 of their papers we have counts for

collaborators

14 papers

cs.CL2026

ReliableRAG: Combating Misinformation in Retrieval-Augmented Generation via Reliability-Guided Reasoning Chains

Jinpu Jiang, Xuan Wu, Wenhao Song +6

Retrieval-Augmented Generation (RAG) has emerged as a powerful architecture for Question Answering (QA) by integrating external information into Large Language Models (LLMs). Howev…

cs.LG2026

WeCon: An Efficient Weight-Conditioned Neural Solver for Multi-Objective Combinatorial Optimization Problems

Xuan Wu, Jinbiao Chen, Yang Li +7

Existing neural solvers for Multi-Objective Combinatorial Optimization Problems (MOCOPs) commonly adopt decomposition-based strategies that scalarize a MOCOP into multiple subprobl…

cs.CV2025

iPEAR: Iterative Pyramid Estimation with Attention and Residuals for Deformable Medical Image Registration

Heming Wu, Di Wang, Tai Ma +6

Existing pyramid registration networks may accumulate anatomical misalignments and lack an effective mechanism to dynamically determine the number of optimization iterations under…

cs.LG2025

Efficient Neural Combinatorial Optimization Solver for the Min-max Heterogeneous Capacitated Vehicle Routing Problem

Xuan Wu, Di Wang, Chunguo Wu +5

Numerous Neural Combinatorial Optimization (NCO) solvers have been proposed to address Vehicle Routing Problems (VRPs). However, most of these solvers focus exclusively on single-v…

cs.LG2025

Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution

Wenhao Song, Xuan Wu, Bo Yang +6

To address the weight coupling problem, certain studies introduced few-shot Neural Architecture Search (NAS) methods, which partition the supernet into multiple sub-supernets. Howe…

cs.NE2025

Efficient Heuristics Generation for Solving Combinatorial Optimization Problems Using Large Language Models

Xuan Wu, Di Wang, Chunguo Wu +4

Recent studies exploited Large Language Models (LLMs) to autonomously generate heuristics for solving Combinatorial Optimization Problems (COPs), by prompting LLMs to first provide…

cs.AI2025

GELD: A Unified Neural Model for Efficiently Solving Traveling Salesman Problems Across Different Scales

Yubin Xiao, Di Wang, Rui Cao +3

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recent advancements in neural network-based TSP solvers…

cs.LG2025★ 1 cited

An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem

Mingzhao Wang, You Zhou, Zhiguang Cao +7

Recent advances in neural models have shown considerable promise in solving Traveling Salesman Problems (TSPs) without relying on much hand-crafted engineering. However, while non-…

cs.LG2024

Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture

Yubin Xiao, Di Wang, Xuan Wu +5

Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but often fall short in generalization. Recent attempts to enhance model generalization often…

cs.AI2024

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

Xuan Wu, Di Wang, Lijie Wen +6

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted, they did not cover t…

cs.LG2024

Distilling Autoregressive Models to Obtain High-Performance Non-Autoregressive Solvers for Vehicle Routing Problems with Faster Inference Speed

Yubin Xiao, Di Wang, Boyang Li +4

Neural construction models have shown promising performance for Vehicle Routing Problems (VRPs) by adopting either the Autoregressive (AR) or Non-Autoregressive (NAR) learning appr…

cs.AI2023★ 3 cited

Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems

Yubin Xiao, Di Wang, Boyang Li +7

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recently, neural networks have gained popularity in this…

cs.CV2022★ 1 cited

Shape-Aware Fine-Grained Classification of Erythroid Cells

Ye Wang, Rui Ma, Xiaoqing Ma +4

Fine-grained classification and counting of bone marrow erythroid cells are vital for evaluating the health status and formulating therapeutic schedules for leukemia or hematopathy…

cs.NE2021

Neural Architecture Search based on Cartesian Genetic Programming Coding Method

Xuan Wu, Linhan Jia, Xiuyi Zhang +4

Neural architecture search (NAS) is a hot topic in the field of automated machine learning and outperforms humans in designing neural architectures on quite a few machine learning…