Combinatorial bandits

DOI10.1016/J.JCSS.2012.01.001zbMATH Open1262.91052OpenAlexW2914156981WikidataQ59538560 ScholiaQ59538560MaRDI QIDQ439986FDOQ439986

Gábor Lugosi, Nicolò Cesa-Bianchi

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.01.001

Recommendations

• Regret in online combinatorial optimization
• An Efficient Algorithm for Learning with Semi-bandit Feedback
• Online prediction problems with variation
• Algorithms for adversarial bandit problems with multiple plays
• Regret bounds and minimax policies under partial monitoring

zbMATH Keywords

online linear optimizationadversarial bandit problemsonline prediction

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Decision theory (91B06)

Cites Work

• 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
• Probability on trees and networks
• Title not available (Why is that?)
• Learning Theory
• Polynomial-Time Approximation Algorithms for the Ising Model
• Efficient algorithms for online decision problems
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Adaptive routing with end-to-end feedback
• 10.1162/1532443041424328
• Learning Permutations with Exponential Weights
• Title not available (Why is that?)
• Robbing the bandit
• Title not available (Why is that?)

Cited In (33)

• Combining initial segments of lists
• Title not available (Why is that?)
• Negatively Correlated Bandits
• Multi-channel transmission scheduling with hopping scheme under uncertain channel states
• Order scoring, bandit learning and order cancellations
• Batched bandit problems
• Online Learning over a Finite Action Set with Limited Switching
• Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach
• Adaptive policies for perimeter surveillance problems
• A penalized bandit algorithm
• A combinatorial multi-armed bandit approach to correlation clustering
• Learning Theory
• Title not available (Why is that?)
• Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
• Bandit online optimization over the permutahedron
• An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem
• Online learning in budget-constrained dynamic Colonel Blotto games
• Asymptotically optimal algorithms for budgeted multiple play bandits
• A Combinatorial Metrical Task System Problem Under the Uniform Metric
• Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
• Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits
• Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
• Sequential Shortest Path Interdiction with Incomplete Information
• Multi-armed bandits with censored consumption of resources
• Per-Round Knapsack-Constrained Linear Submodular Bandits
• Learning in Combinatorial Optimization: What and How to Explore
• Online learning of network bottlenecks via minimax paths
• Online learning of energy consumption for navigation of electric vehicles
• Variable Selection Via Thompson Sampling
• Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science
• Online team formation under different synergies
• Bounded Regret for Finitely Parameterized Multi-Armed Bandits
• Combinatorial multi-armed bandit and its extension to probabilistically triggered arms

This page was built for publication: Combinatorial bandits

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