Bandit online optimization over the permutahedron

DOI10.1016/J.TCS.2016.07.033zbMATH Open1359.90112OpenAlexW2477742853MaRDI QIDQ329616FDOQ329616

Authors: Nir Ailon, Kohei Hatano, Eiji Takimoto 

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.033

Recommendations

• Bandit online optimization over the permutahedron
• Online linear optimization over permutations
• Learning permutations with exponential weights
• Combinatorial bandits
• Learning Theory

zbMATH Keywords

permutationbanditcombinatorial online predictionpermutahedron

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Prediction, Learning, and Games
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• The Nonstochastic Multiarmed Bandit Problem
• The complexity of computing the permanent
• The relationship between Luce's choice axiom, Thurstone's theory of comparative judgment, and the double exponential distribution
• Combinatorial bandits
• Convex optimization: algorithms and complexity
• Learning permutations with exponential weights
• Online linear optimization over permutations
• Online Prediction under Submodular Constraints

Cited In (3)

• Learning permutations with exponential weights
• Title not available (Why is that?)
• Online linear optimization over permutations

This page was built for publication: Bandit online optimization over the permutahedron

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