Combinatorial bandits
From MaRDI portal
Publication:439986
DOI10.1016/J.JCSS.2012.01.001zbMATH Open1262.91052OpenAlexW2914156981WikidataQ59538560 ScholiaQ59538560MaRDI QIDQ439986FDOQ439986
Authors: Nicolò Cesa-Bianchi, Gábor Lugosi 
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
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: distributed learning and geometric approaches
- 10.1162/1532443041424328
- Learning Permutations with Exponential Weights
- The on-line shortest path problem under partial monitoring
- Robbing the bandit
- Title not available (Why is that?)
Cited In (41)
- Combining initial segments of lists
- Title not available (Why is that?)
- Negatively Correlated Bandits
- Per-round knapsack-constrained linear submodular bandits
- Bandit online optimization over the permutahedron
- Multi-channel transmission scheduling with hopping scheme under uncertain channel states
- Order scoring, bandit learning and order cancellations
- Learning in combinatorial optimization: what and how to explore
- Regret in online combinatorial optimization
- Batched bandit problems
- Sequential decision making with vector outcomes
- Algorithms for adversarial bandit problems with multiple plays
- 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?)
- A combinatorial metrical task system problem under the uniform metric
- Combinatorial online prediction via metarounding
- 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
- Online learning over a finite action set with limited switching
- Online prediction problems with variation
- Bandit regret scaling with the effective loss range
- Asymptotically optimal algorithms for budgeted multiple play bandits
- Regret bounds and minimax policies under partial monitoring
- 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
- Learning unknown service rates in queues: a multiarmed bandit approach
- Sequential Shortest Path Interdiction with Incomplete Information
- Multi-armed bandits with censored consumption of resources
- 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)
