Results 101 to 110 of about 18,568,643 (214)
Normal Bayesian two-armed bandits
The undiscounted normal two-armed bandit is examined from a Bayesian point of view for independent and singular priors on the mean vector ((theta)(,1),(theta)(,2)). Quantification is given to the well-accepted notion that an apparently inferior source needs to be sampled now and then.
openaire +3 more sources
Randomized Rules for the Two-Armed-Bandit with Finite Memory
In the "two-armed-bandit with finite memory" problem, each rule which has been proposed (see [2], [3], and [4]) can be improved by using a corresponding randomized rule. The performance of various randomized rules is computed.
openaire +3 more sources
This item contains two documents. The first document provides biographical information surrounding John Oakley-Smith and Warner Bros Music.
core
In the era of digital banking, personalized financial product recommendations play a crucial role in enhancing customer engagement and conversion rates.
Idha Kristiana +3 more
doaj +1 more source
Informational Herding and Optimal Experimentation [PDF]
We show that far from capturing a formally new phenomenon, informational herding is really a special case of single-person experimentation - and `bad herds' the typical failure of complete learning.
Lones Smith, Peter Norman Sørensen
core +2 more sources
Psilocybin increases optimistic engagement over time: computational modelling of behaviour in rats
Psilocybin has shown promise as a novel pharmacological intervention for treatment of depression, where post-acute effects of psilocybin treatment have been associated with increased positive mood and decreased pessimism.
Elizabeth L. Fisher +6 more
doaj +1 more source
A linear response bandit problem
We consider a two–armed bandit problem which involves sequentialsampling from two non-homogeneous populations. The responsein each is determined by a random covariate vector and a vector ofparameters whose values are not known a priori.The goal is to ...
Assaf Zeevi, Alexander Goldenshluger
doaj
Thompson Sampling for Non-Stationary Bandit Problems
Non-stationary multi-armed bandit (MAB) problems have recently attracted extensive attention. We focus on the abruptly changing scenario where reward distributions remain constant for a certain period and change at unknown time steps.
Han Qi, Fei Guo, Li Zhu
doaj +1 more source
On the two armed bandit with one probability known
The dynamic programming approach to the solution of the two armed bandit problem with one probability known is discussed, for a general prior distribution for the unknown probability. Properties of the objective function and of the stopping boundaries are obtained. The problem of costly observations is discussed.
openaire +2 more sources
Client Selection for Generalization in Accelerated Federated Learning: A Multi-Armed Bandit Approach
Federated learning (FL) is an emerging machine learning (ML) paradigm used to train models across multiple nodes (i.e., clients) holding local data sets, without explicitly exchanging the data.
Dan Ben Ami, Kobi Cohen, Qing Zhao
doaj +1 more source

