The search functionality is under construction.

The search functionality is under construction.

We consider online linear optimization over symmetric positive semi-definite matrices, which has various applications including the online collaborative filtering. The problem is formulated as a repeated game between the algorithm and the adversary, where in each round *t* the algorithm and the adversary choose matrices X* _{t}* and L

- Publication
- IEICE TRANSACTIONS on Information Vol.E101-D No.6 pp.1511-1520

- Publication Date
- 2018/06/01

- Publicized
- 2018/03/01

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.2017EDP7317

- Type of Manuscript
- PAPER

- Category
- Fundamentals of Information Systems

Ken-ichiro MORIDOMI

Kyushu University

Kohei HATANO

Kyushu University,RIKEN AIP

Eiji TAKIMOTO

Kyushu University

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Ken-ichiro MORIDOMI, Kohei HATANO, Eiji TAKIMOTO, "Online Linear Optimization with the Log-Determinant Regularizer" in IEICE TRANSACTIONS on Information,
vol. E101-D, no. 6, pp. 1511-1520, June 2018, doi: 10.1587/transinf.2017EDP7317.

Abstract: We consider online linear optimization over symmetric positive semi-definite matrices, which has various applications including the online collaborative filtering. The problem is formulated as a repeated game between the algorithm and the adversary, where in each round *t* the algorithm and the adversary choose matrices X* _{t}* and L

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2017EDP7317/_p

Copy

@ARTICLE{e101-d_6_1511,

author={Ken-ichiro MORIDOMI, Kohei HATANO, Eiji TAKIMOTO, },

journal={IEICE TRANSACTIONS on Information},

title={Online Linear Optimization with the Log-Determinant Regularizer},

year={2018},

volume={E101-D},

number={6},

pages={1511-1520},

abstract={We consider online linear optimization over symmetric positive semi-definite matrices, which has various applications including the online collaborative filtering. The problem is formulated as a repeated game between the algorithm and the adversary, where in each round *t* the algorithm and the adversary choose matrices X* _{t}* and L

keywords={},

doi={10.1587/transinf.2017EDP7317},

ISSN={1745-1361},

month={June},}

Copy

TY - JOUR

TI - Online Linear Optimization with the Log-Determinant Regularizer

T2 - IEICE TRANSACTIONS on Information

SP - 1511

EP - 1520

AU - Ken-ichiro MORIDOMI

AU - Kohei HATANO

AU - Eiji TAKIMOTO

PY - 2018

DO - 10.1587/transinf.2017EDP7317

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E101-D

IS - 6

JA - IEICE TRANSACTIONS on Information

Y1 - June 2018

AB - We consider online linear optimization over symmetric positive semi-definite matrices, which has various applications including the online collaborative filtering. The problem is formulated as a repeated game between the algorithm and the adversary, where in each round *t* the algorithm and the adversary choose matrices X* _{t}* and L

ER -