Learning rotations with little regret

DOI10.1007/S10994-016-5548-XzbMath1454.68192OpenAlexW2325363087MaRDI QIDQ1689555

Satyen Kale, Manfred K. Warmuth, Elad Hazan

Publication date: 12 January 2018

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-016-5548-x

zbMATH Keywords

rotationsminimaxonline learningBregman projectionregret bounds

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Learning rotations with little regret

Uses Software

• AdaBoost.MH

Cites Work

• Unnamed Item
• Unnamed Item
• Online variance minimization
• Exponentiated gradient versus gradient descent for linear predictors
• A decision-theoretic generalization of on-line learning and an application to boosting
• Learning rotations with little regret
• A generalized solution of the orthogonal Procrustes problem
• 10.1162/153244301753683726
• Combining Initial Segments of Lists
• Lie groups as spin groups
• The best constants in the Khintchine inequality
• Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint
• Computer Algebra and Geometric Algebra with Applications

This page was built for publication: Learning rotations with little regret