5 papers
A generalised log-determinant regularizer for online semi-definite programming and its applications
Yaxiong Liu, Ken-ichiro Moridomi, Kohei Hatano +1
We consider a variant of online semi-definite programming problem (OSDP): The decision space consists of semi-definite matrices with bounded -trace norm, which is a generalizati…
Improved algorithms for online load balancing
Yaxiong Liu, Kohei Hatano, Eiji Takimoto
We consider an online load balancing problem and its extensions in the framework of repeated games. On each round, the player chooses a distribution (task allocation) over serv…
Theory and Algorithms for Shapelet-based Multiple-Instance Learning
Daiki Suehiro, Kohei Hatano, Eiji Takimoto +3
We propose a new formulation of Multiple-Instance Learning (MIL), in which a unit of data consists of a set of instances called a bag. The goal is to find a good classifier of bags…
Multiple-Instance Learning by Boosting Infinitely Many Shapelet-based Classifiers
Daiki Suehiro, Kohei Hatano, Eiji Takimoto +3
We propose a new formulation of Multiple-Instance Learning (MIL). In typical MIL settings, a unit of data is given as a set of instances called a bag and the goal is to find a good…
Boosting the kernelized shapelets: Theory and algorithms for local features
Daiki Suehiro, Kohei Hatano, Eiji Takimoto +3
We consider binary classification problems using local features of objects. One of motivating applications is time-series classification, where features reflecting some local close…