Combinatorial bandits (Q439986): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91B06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62M20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6067738 / rank
 
Normal rank
Property / zbMATH Keywords
 
online prediction
Property / zbMATH Keywords: online prediction / rank
 
Normal rank
Property / zbMATH Keywords
 
adversarial bandit problems
Property / zbMATH Keywords: adversarial bandit problems / rank
 
Normal rank
Property / zbMATH Keywords
 
online linear optimization
Property / zbMATH Keywords: online linear optimization / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2012.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2914156981 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59538560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonstochastic Multiarmed Bandit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive routing with end-to-end feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbing the bandit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041424328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for online decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Permutations with Exponential Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability on Trees and Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial bandits
scientific article

    Statements

    Combinatorial bandits (English)
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    online prediction
    0 references
    adversarial bandit problems
    0 references
    online linear optimization
    0 references

    Identifiers