Weiyu Chen

Weiyu Chen

Auto-generated profile, based on publicly available information

Weiyu Chen

Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Southern University of Science and Technology, Shenzhen, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 August 2021 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
WCWeiyu Chen
Weiyu Chen
HIHisao Ishibuchi
Hisao Ishibuchi
KSKe Shang
Ke Shang
Subset selection plays an important role in the field of evolutionary multiobjective optimization (EMO). Especially, in an EMO algorithm with an unbounded external archive (UEA), subset selection is an essential post-processing procedure to select a prespecified number of solutions as the final result. In this article, we discuss the efficiency of greedy subset selection for the hypervolume, inverted generational distance (IGD), and IGD plus (IGD+) indicators. Greedy algorithms usually efficiently handle the subset selection. However, when a large number of solutions are given (e.g., subset selection from tens of thousands of solutions in a UEA), they often become time consuming. Our idea is to use the submodular property, which is known for the hypervolume indicator, to improve their efficiency. First, we prove that the IGD and IGD+ indicators are also submodular. Next, based on the submodular property, we propose an efficient greedy inclusion algorithm for each indicator. We demonstrate through computational experiments that the proposed algorithms are much faster than the standard greedy subset selection algorithms. The proposed algorithms also help the research on performance indicators.

8 June 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
KSKe Shang
Ke Shang
WCWeiyu Chen
Weiyu Chen
WLWeiduo Liao
Weiduo Liao
HIHisao Ishibuchi
Hisao Ishibuchi
In this letter, we propose HV-Net, a new method for hypervolume approximation in evolutionary multi-objective optimization. The basic idea of HV-Net is to use DeepSets, a deep neural network with permutation invariant property, to approximate the hypervolume of a non-dominated solution set. The input of HV-Net is a non-dominated solution set in the objective space, and the output is an approximated hypervolume value of this solution set. The performance of HV-Net is evaluated through computational experiments by comparing it with two commonly-used hypervolume approximation methods (i.e., point-based method and line-based method). Our experimental results show that HV-Net outperforms the other two methods in terms of both the approximation error and the runtime, which shows the potential of using deep learning techniques for hypervolume approximation.

29 June 2021 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
KSKe Shang
Ke Shang
HIHisao Ishibuchi
Hisao Ishibuchi
WCWeiyu Chen
Weiyu Chen
YNYang Nan
Yang Nan
WLWeiduo Liao
Weiduo Liao
Hypervolume is widely used in the evolutionary multiobjective optimization (EMO) field to evaluate the quality of a solution set. For a solution set with $\mu $ solutions on a Pareto front, a larger hypervolume means a better solution set. Investigating the distribution of the solution set with the largest hypervolume is an important topic in EMO, which is the so-called hypervolume-optimal $\mu $ -distribution. Theoretical results have shown that the $\mu $ solutions are uniformly distributed on a linear Pareto front in two dimensions. However, the $\mu $ solutions are not always uniformly distributed on a single-line Pareto front in three dimensions. They are only uniform when the single-line Pareto front has one constant objective. In this article, we further investigate the hypervolume-optimal $\mu $ -distribution in three dimensions. We consider the line-based and plane-based Pareto fronts. For the line-based Pareto fronts, we extend the single-line Pareto front to two-line and three-line Pareto fronts, where each line has one constant objective. For the plane-based Pareto fronts, the linear triangular and inverted triangular Pareto fronts are considered. First, we show that the $\mu $ solutions are not always uniformly distributed on the line-based Pareto fronts. The uniformity depends on how the lines are combined. Then, we show that a uniform solution set on the plane-based Pareto front is not always optimal for hypervolume maximization. It is locally optimal with respect to a $(\mu +1)$ selection scheme. Our results can help researchers in the community to better understand and utilize the hypervolume indicator.

8 November 2022 in arXiv
Verified
Preprint
Open access
PDF file
WCWei-Yu Chen
Wei-Yu Chen
Cheng-Yang LiuCheng-Yang Liu
Cheng-Yang Liu
YHYu-Kai Hsieh
Yu-Kai Hsieh
OMOleg V. Minin
Oleg V. Minin
IMIgor V. Minin
Igor V. Minin
In this study, we propose a novel design of the triangular mesoscale Janus prisms for the generation of the long photonic hook. The numerical simulations based on the finite-difference time-domain method are used to examine the formation mechanism of the photonic hook. The electric intensity distributions near the micro-prisms are calculated for operating at different re-fractive indices and spaces of the two triangular micro-prisms. The asymmetric vortexes of in-tensity distributions result in the long photonic hook with large bending angle. The length and the bending angle of the photonic hook are efficiently modulated by changing the space be-tween the two triangular micro-prisms. Moreover, the narrow width of the photonic hook is achieved beyond the diffraction limit. The triangular Janus micro-prisms have high potential for practical applications in optical tweezers, nanoparticle sorting and manipulation and photonic circuits.