Arrow Research search

Author name cluster

Lixin Wei

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.

2 papers
1 author row

Possible papers

2

EAAI Journal 2026 Journal Article

A zero-shot tree-structured multi-objective evolutionary Neural Architecture Search

  • Yan Dai
  • Lixin Wei
  • Ziyu Hu
  • Hao Sun
  • Qianao Xu
  • Kexin Zhang
  • Boya Zhao

Neural Architecture Search (NAS) enables the automated design of high-performance neural networks; however, its practical application is often constrained by substantial computational costs, the limited reliability of single-objective proxy metrics, and insufficient modeling of architectural information flow. To address these limitations, we propose Tree-structured Evolutionary Neural Architecture Search (TreeNAS). The method integrates three components: (1) a tree-structured encoding with refinement to preserve backbone information paths under mutation; (2) a zero-cost multi-objective evaluation that jointly assesses trainability, generalization, and complexity, thereby mitigating instability from single-objective proxy; and (3) a Pareto-dominance-guided evolutionary search to encourage diverse, balanced architectures across objectives. On the standard Neural Architecture Search Benchmark 101 (NAS-Bench-101) and Neural Architecture Search Benchmark 201 (NAS-Bench-201) datasets, TreeNAS achieves state-of-the-art accuracy with a 40 × reduction in search cost. On the ImageNet dataset under strict floating-point operation (FLOPs) budgets, TreeNAS achieves accuracy comparable to training-based NAS methods while keeping the search cost to 0. 45 Graphics Processing Unit (GPU) days. Additionally, TreeNAS generalizes across modalities, from two-dimensional images to medical signals and volumetric imaging, demonstrating its potential in practical medical imaging applications.

EAAI Journal 2025 Journal Article

Sparse large-scale multi-objective optimization algorithm based on impact factor assistance

  • Ziyu Hu
  • Xuetao Nie
  • Hao Sun
  • Lixin Wei
  • Jinlu Zhang
  • Cong Wang

In the real world, there exists a special category of multi-objective optimization problems with more than 1000 decision variables. However, only a few decision variables play a crucial role in optimizing the objective functions. Such problems are defined as sparse large-scale multi-objective optimization problems (SLSMOPs). Due to the difficulty in effectively identifying the non-zero positions of decision variables, traditional evolutionary optimization algorithms suffer from slow convergence speed and poor convergence effect, which means it is unable to efficiently obtain the Pareto optimal solution set. To address this challenge, the Impact Factor Assisted Algorithm (IFA) is proposed, which adopts a novel initial population strategy to generate sparse populations. Meanwhile, the impact factor of each decision variable is calculated, serving as a key basis for measuring the importance of each decision variable. During the algorithm’s operation, the impact factors are iteratively updated to rationally group decision variables and guide population evolution. This approach can accurately identify the positions of non-zero decision variables. The experimental results on eight benchmark and real-world problems indicate that the algorithm outperforms several existing sparse large-scale multi-objective optimization algorithms (SLSMOEAs).