Learning permutations with exponential weights

zbMATH Open1235.68092MaRDI QIDQ2880946FDOQ2880946

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

permutationrankingdoubly stochastic matrixon-line learninghedge algorithmrelative entropy projectionsinkhorn balancing

Mathematics Subject Classification ID

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

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)

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

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)