Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 462 for “"bandit"”.
-
Grandpa Bandit
Grandpa Bandit tells the story of elderly Virgil Wells, an upstanding citizen who is forced to partake in criminal activities in order to be able to provide for his ailing wife, Mary. As their funds decrease and their medicare is terminated, Virgil applies for work but is overlooked. His abilities …
-
AlegAATr the Bandit
… time step during task execution, the agent, or bandit, chooses which of the N behaviors to use. Traditional bandit algorithms often (1) assume the environment is stationary, (2) focus on asymptotic performance, and (3) do not incorporate external information available to them. Each of these …
-
Information structure in bandit learning
The multi-armed bandit framework provides a mathematical model for sequential decision making under uncertainty, where a learner repeatedly selects actions with unknown stochastic rewards and aims to optimize cumulative performance. Beyond the classical setting in which only the reward of the …
-
EFFICIENT AND EFFECTIVE BANDIT ALGORITHMS
The multi-armed bandit (MAB) problem provides an elementary model for exploration-exploitation tradeoffs and finds many real applications such as medical trials \cite{thompson1933likelihood,perchet2016batched}, crowdsourcing \cite{kittur2008crowdsourcing,zhou2014optimal}, and marketing …
-
Adaptive Recommendations with Bandit Feedback
… in machine learning. We consider multi-armed bandits problems, where the goal is to design a policy to recommend arms (options) sequentially where in each round only the rewards sampled from the selected arms are available. In this thesis, we study both theoretical and practical aspects of …
-
Learning in three classic bandit strategies
In a Bandit Problem one is repeatedly asked to implement one of a set of actions each of which produce some observable long term behaviour, and one aims to achieve some objective such as maximisation of a reward stream, or consistency. The fundamental dilema one must address is when to choose to …
-
Μοντέλα multi-armed-bandit στη βιοστατιστική
Τα Multi-armed bandit προβλήματα είναι μια μορφή προβλημάτων βελτιστοποίησης, που έχουν ως στόχο την μοντελοποίηση κατανομής πόρων κάτω από αβεβαιότητα σε ένα ευρύ φάσμα θεωρητικών πλαισίων (theoretical context). Από την πρώτη κιόλας δημοσίευση, τα παραπάνω προβλήματα αποτελούν ένα πολύ ενεργό θέμα …
-
Influence maximization in bandit and adaptive settings
… as input. We adopt a combinatorial multi-armed bandit (CMAB) paradigm and formulate the above problems respectively as (i) network exploration, i.e. incrementally minimizing the error in learned edge weights and (ii) regret minimization i.e. minimizing the loss in influence from choosing …
-
Scrappy the Bandit and the Outlaw Wolf
… is neutral, quiet and waiting.Scrappy the Bandit and the Outlaw Wolf has come to encompass this type of experience: the ambiguity of being both the moment before something happens, and the tucked-away-until-next-year Long Goodbye of an event’s neatened and tissue-wrapped aftermath. And the …
-
Optimality, Scalability, and Reneging in Bandit Learning
Bandit learning has been widely applied to handle the exploration-exploitation dilemma in sequential decision problems. To solve the dilemma, a large number of bandit algorithms have been proposed. While many of these algorithms have been proved to be order-optimal with respect to regret, the …
-
AN ADVERSARIAL BANDIT FRAMEWORK FOR PERIMETER PROTECTION
… to search, the searcher applies an adversarial bandit algorithm (like EXP3), which samples from a distribution that assigns more weight to the most lucrative sector so far. Knowing this, the agents balance their goal of performing activities versus the risk of getting caught. This narrative …
-
Adaptive algorithms for stochastic optimization and bandit learning
… constraints. Finally, in Part III, we study a bandit-inspired algorithm for domain adaptation, and consider a variant of the stochastic multi-armed bandit problem where the observed feedback is adaptively biased by the algorithm's previous decisions.
-
Group-Envy Fairness in the Stochastic Bandit Setting
… group fairness-inspired stochastic multi-armed bandit problem in the pure exploration setting. We look at the discrepancy between an arm’s mean reward from a group and the highest mean reward for any arm from that group, and call this the disappointment that group suffers from that arm. We …
Page 1 of 24