no code implementations • 17 Oct 2023 • Yasunari Hikima
We also extend the result for the case where the loss functions are strongly convex and show that both regret and constraint violation bounds can be further reduced.
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.