Minimax Algorithm for Learning Rotations
Abstract
It is unknown what is the most suitable regularization for rotation matrices and how to maintain uncertainty over rotations in an online setting. We propose to address these questions by studying the minimax algorithm for rotations and begin by working out the 2-dimensional case.
Cite
Text
Kotłowski and Warmuth. "Minimax Algorithm for Learning Rotations." Proceedings of the 24th Annual Conference on Learning Theory, 2011.Markdown
[Kotłowski and Warmuth. "Minimax Algorithm for Learning Rotations." Proceedings of the 24th Annual Conference on Learning Theory, 2011.](https://mlanthology.org/colt/2011/kotowski2011colt-minimax/)BibTeX
@inproceedings{kotowski2011colt-minimax,
title = {{Minimax Algorithm for Learning Rotations}},
author = {Kotłowski, Wojciech and Warmuth, Manfred K.},
booktitle = {Proceedings of the 24th Annual Conference on Learning Theory},
year = {2011},
pages = {821-824},
volume = {19},
url = {https://mlanthology.org/colt/2011/kotowski2011colt-minimax/}
}