B'ezier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a strategy to construct a multi-objective optimization algorithm from a single-objective optimization algorithm by using the B'ezier simplex model. Also, we extend the stability of optimization algorithms in the sense of Probability Approximately Correct (PAC) learning and define the PAC stability. We prove that it leads to an upper bound on the generalization with high probability. Furthermore, we show that multi-objective optimization algorithms derived from a gradient descent-based single-objective optimization algorithm are PAC stable. We conducted numerical experiments and demonstrated that our method achieved lower generalization errors than the existing multi-objective optimization algorithm.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 33 references that are in the map. First posted on arXiv 23 May 2022.
Builds on
9 of 33 references.
References · 9
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2015Predictive Entropy Search for Multi-objective Bayesian Optimizationcited by 88
- 2019jMetalPy: a Python Framework for Multi-Objective Optimization with Metaheuristicscited by 14
- 2018Bezier Simplex Fitting: Describing Pareto Fronts of Simplicial Problems with Small Samples in Multi-objective Optimizationcited by 5
- 2019Topology of Pareto sets of strongly convex problemscited by 4
- 2019Asymptotic Risk of Bezier Simplex Fittingcited by 3
- 2019Simpliciality of strongly convex problemscited by 2
- 2020Ensuring smoothly navigable approximation sets by Bezier curve parameterizations in evolutionary bi-objective optimization -- applied to brachytherapy treatment planning for prostate cancercited by 1
- 2021All unconstrained strongly convex problems are weakly simplicialcited by 1
Built on by
Not cited yet.