Timezone: »

Profiling Pareto Front With Multi-Objective Stein Variational Gradient Descent
Xingchao Liu · Xin Tong · Qiang Liu

@ None

Finding diverse and representative Pareto solutions from the Pareto front is a key challenge in multi-objective optimization (MOO). In this work, we propose a novel gradient-based algorithm for profiling Pareto front by using Stein variational gradient descent (SVGD). We also provide a counterpart of our method based on Langevin dynamics. Our methods iteratively update a set of points in a parallel fashion to push them towards the Pareto front using multiple gradient descent, while encouraging the diversity between the particles by using the repulsive force mechanism in SVGD, or diffusion noise in Langevin dynamics. Compared with existing gradient-based methods that require predefined preference functions, our method can work efficiently in high dimensional problems, and can obtain more diverse solutions evenly distributed in the Pareto front. Moreover, our methods are theoretically guaranteed to converge to the Pareto front. We demonstrate the effectiveness of our method, especially the SVGD algorithm, through extensive experiments, showing its superiority over existing gradient-based algorithms.

Author Information

Xingchao Liu (University of Texas at Austin)
Xin Tong (National University of Singapore)
Qiang Liu (Dartmouth College)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors