Results 111 to 120 of about 12,386 (222)
This discourse which is intended to contribute to peace and security studies examined the effects of armed banditry on the people of North-western Nigeria. The paper answered these questions: Who are armed bandits?
Efemena Emmanuel ESAMAGU +1 more
doaj +1 more source
Published at Neural Information Processing Systems (NeurIPS ...
Carpentier, Alexandra, Valko, Michal
openaire +4 more sources
The stochastic multi-armed bandit problem is well understood when the reward distributions are sub-Gaussian. In this paper we examine the bandit problem under the weaker assumption that the distributions have moments of order 1+ε, for some $ε\in (0,1]$.
S. Bubeck, N. Cesa-Bianchi, G. Lugosi
openaire +4 more sources
Characterization and computation of restless bandit marginal productivity indices [PDF]
The Whittle index [P. Whittle (1988). Restless bandits: Activity allocation in a changing world. J. Appl. Probab. 25A, 287-298] yields a practical scheduling rule for the versatile yet intractable multi-armed restless bandit problem, involving the ...
Jose Nino-Mora
core
Multi-Agent Contextual Bandits for Multi-Objective Recommendation Systems [PDF]
In this work, the use of multi-agent contextual bandits to optimize multi-objective recommendation systems in resource-constrained settings is examined.
Zhu Ziwen
doaj +1 more source
Optimistic Algorithms for Safe Linear Bandits Under General Constraints
The stochastic linear bandit problem has emerged as a fundamental building-block in machine learning and control, and a realistic model for many applications.
Spencer Hutchinson +3 more
doaj +1 more source
A version of the dueling bandit problem is addressed in which a Condorcet winner may not exist. Two algorithms are proposed that instead seek to minimize regret with respect to the Copeland winner, which, unlike the Condorcet winner, is guaranteed to exist.
Zoghi, M +3 more
openaire +5 more sources
Burning the bodies of dead Mexican bandits at Columbus New ...
Horne, Walter H., 1883-1921
core +2 more sources
This paper studies the Best-of-K Bandit game: At each time the player chooses a subset S among all N-choose-K possible options and observes reward max(X(i) : i in S) where X is a random vector drawn from a joint distribution. The objective is to identify the subset that achieves the highest expected reward with high probability using as few queries as ...
Max Simchowitz +2 more
openaire +3 more sources
source: https://criminocorpus.org/fr/bibliotheque/page/112847/#page Bandits Call for papers for the journal Terrain Issue coordinated by Lucia Michelutti and David Picherit From Pablo Escobar to Phoolan Devi, expansive myths of contemporary "social ...
blogterrain
core

