Search Results for author:
Found 3 papers, 0 papers with code
Pure exploration in multi-armed bandits with low rank structure using oblivious sampler
Then, we show the lower bound to the pure exploration in multi-armed bandits with low rank sequence.
A generalised log-determinant regularizer for online semi-definite programming and its applications
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.
Improved algorithms for online load balancing
The cost is the makespan if the norm is $L_\infty$-norm.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
