no code implementations • 23 May 2022 • Akiyoshi Sannai, Yasunari Hikima, Ken Kobayashi, Akinori Tanaka, Naoki Hamada
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.
1 code implementation • 29 Mar 2022 • Ryoji Tanabe, Youhei Akimoto, Ken Kobayashi, Hiroshi Umeki, Shinichi Shirakawa, Naoki Hamada
The first phase in TPB aims to approximate a few Pareto optimal solutions by optimizing a sequence of single-objective scalar problems.
1 code implementation • 25 Feb 2022 • Atsushi Takada, Daichi Yamazaki, Likun Liu, Yudai Yoshida, Nyamkhuu Ganbat, Takayuki Shimotomai, Taiga Yamamoto, Daisuke Sakurai, Naoki Hamada
In this article, we evaluate the generative performance of Gen\'eLive!
no code implementations • 7 Oct 2021 • Ryosuke Ota, Reiya Hagiwara, Naoki Hamada, Likun Liu, Takahiro Yamamoto, Daisuke Sakurai
In multi-objective optimization, designing good benchmark problems is an important issue for improving solvers.
no code implementations • 24 Jun 2021 • Yusuke Mizota, Naoki Hamada, Shunsuke Ichiki
The usefulness of this theorem is demonstrated in a sparse modeling application: we reformulate the elastic net as a non-differentiable multi-objective strongly convex problem and approximate its Pareto set (the set of all trained models with different hyper-parameters) and Pareto front (the set of performance metrics of the trained models) by using a B\'ezier simplex fitting method, which accelerates hyper-parameter search.
no code implementations • 10 Apr 2021 • Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada
B\'ezier simplex fitting algorithms have been recently proposed to approximate the Pareto set/front of multi-objective continuous optimization problems.
no code implementations • 17 Jun 2019 • Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada
In this paper, we analyze the asymptotic risks of those B\'ezier simplex fitting methods and derive the optimal subsample ratio for the inductive skeleton fitting.
no code implementations • 19 Apr 2018 • Naoki Hamada, Keisuke Goto
We give a theory of how to recognize the topology of the Pareto set from data and implement an algorithm to judge whether the true Pareto set may form a topological simplex or not.
no code implementations • 18 Apr 2017 • Naoki Hamada
Quite a few studies on real-world applications of multi-objective optimization reported that their Pareto sets and Pareto fronts form a topological simplex.
no code implementations • 26 Aug 2015 • Naoki Hamada, Katsumi Homma, Hiroyuki Higuchi, Hideyuki Kikuchi
The recent development of multi-agent simulations brings about a need for population synthesis.