https://openalex.org/T12101
This cluster of papers focuses on the optimization of multi-armed bandit problems, including topics such as Bayesian optimization, contextual bandits, online learning, convex optimization, Thompson sampling, regret analysis, Gaussian process optimization, hyperparameter optimization, and adversarial multi-armed bandits.
@prefix oasubfields: <https://openalex.org/subfields/> .
@prefix openalex: <https://lambdamusic.github.io/openalex-hacks/ontology/> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
<https://openalex.org/T12101> a skos:Concept ;
rdfs:label "Optimization of Multi-Armed Bandit Problems"@en ;
rdfs:isDefinedBy openalex: ;
owl:sameAs <https://en.wikipedia.org/wiki/Multi-armed_bandit>,
<https://openalex.org/T12101> ;
skos:broader oasubfields:1803 ;
skos:definition "This cluster of papers focuses on the optimization of multi-armed bandit problems, including topics such as Bayesian optimization, contextual bandits, online learning, convex optimization, Thompson sampling, regret analysis, Gaussian process optimization, hyperparameter optimization, and adversarial multi-armed bandits."@en ;
skos:inScheme openalex: ;
skos:prefLabel "Optimization of Multi-Armed Bandit Problems"@en ;
openalex:cited_by_count 269942 ;
openalex:works_count 15072 .