An Online Learning Algorithm for Bilinear Models
Abstract
We investigate the bilinear model, which is a matrix form linear model with the rank 1 constraint. A new online learning algorithm is proposed to train the model parameters. Our algorithm runs in the manner of online mirror descent, and gradients are computed by the power iteration. To analyze it, we give a new second order approximation of the squared spectral norm, which helps us to get a regret bound. Experiments on two sequential labelling tasks give positive results.
Cite
Text
Wu and Sun. "An Online Learning Algorithm for Bilinear Models." International Conference on Machine Learning, 2015.Markdown
[Wu and Sun. "An Online Learning Algorithm for Bilinear Models." International Conference on Machine Learning, 2015.](https://mlanthology.org/icml/2015/wu2015icml-online/)BibTeX
@inproceedings{wu2015icml-online,
title = {{An Online Learning Algorithm for Bilinear Models}},
author = {Wu, Yuanbin and Sun, Shiliang},
booktitle = {International Conference on Machine Learning},
year = {2015},
pages = {890-898},
volume = {37},
url = {https://mlanthology.org/icml/2015/wu2015icml-online/}
}