no code implementations • 28 Jun 2023 • Yaxiong Liu, Atsuyoshi Nakamura, Kohei Hatano, Eiji Takimoto
Then, we show the lower bound to the pure exploration in multi-armed bandits with low rank sequence.
no code implementations • 10 Dec 2020 • Yaxiong Liu, Ken-ichiro Moridomi, Kohei Hatano, Eiji Takimoto
We consider a variant of online semi-definite programming problem (OSDP): The decision space consists of semi-definite matrices with bounded $\Gamma$-trace norm, which is a generalization of trace norm defined by a positive definite matrix $\Gamma.$ To solve this problem, we utilise the follow-the-regularized-leader algorithm with a $\Gamma$-dependent log-determinant regularizer.
no code implementations • 15 Jul 2020 • Yaxiong Liu, Kohei Hatano, Eiji Takimoto
The cost is the makespan if the norm is $L_\infty$-norm.