Learning permutations with exponential weights

MaRDI QIDQ2880946zbMATH OpenFDO

Authors David P. Helmbold, Manfred K. Warmuth

Publication date 17 April 2012

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://www.jmlr.org/papers/v10/helmbold09a.html

zbMATH Keywords

doubly stochastic matrixhedge algorithmon-line learningpermutationrankingrelative entropy projectionsinkhorn balancing

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning Permutations with Exponential Weights
• Online linear optimization over permutations
• Bandit online optimization over the permutahedron
• Bandit online optimization over the permutahedron
• How to better use expert advice

Cited in

(13)

• Learning rotations with little regret
• Scale-free online learning
• Online Linear Optimization for Job Scheduling Under Precedence Constraints
• Bandit online optimization over the permutahedron
• Online linear optimization over permutations
• Bandit online optimization over the permutahedron
• Combining initial segments of lists
• Online variance minimization
• scientific article; zbMATH DE number 7255066 (Why is no real title available?)
• Online learning over a finite action set with limited switching
• scientific article; zbMATH DE number 7626715 (Why is no real title available?)
• Learning Permutations with Exponential Weights
• Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning

This page was built for publication: Learning permutations with exponential weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880946)