Skip to content
conftrace_
2011 COLT COLT 2011

Minimax Algorithm for Learning Rotations

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.

🚀 Conference Pioneer - COLT 2011
📈 Trend Setter - Reasoning
🐣 Hot Topic Early Bird - uncertainty quantification

More from COLT 2011

All COLT 2011 papers →