Search Results for author:
Found 7 papers, 2 papers with code
An Anytime Algorithm for Good Arm Identification
Second, when APGAI is combined with a stopping rule, we prove upper bounds on the expected sampling complexity, holding at any confidence level.
Dealing with Unknown Variances in Best-Arm Identification
The problem of identifying the best arm among a collection of items having Gaussian rewards distribution is well understood when the variances are known.
Top Two Algorithms Revisited
Top Two algorithms arose as an adaptation of Thompson sampling to best arm identification in multi-armed bandit models (Russo, 2016), for parametric families of arms.
Choosing Answers in $\varepsilon$-Best-Answer Identification for Linear Bandits
In pure-exploration problems, information is gathered sequentially to answer a question on the stochastic environment.
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback
Combinatorial bandits with semi-bandit feedback generalize multi-armed bandits, where the agent chooses sets of arms and observes a noisy reward for each arm contained in the chosen set.
A Probabilistic Model of the Bitcoin Blockchain
The Bitcoin transaction graph is a public data structure organized as transactions between addresses, each associated with a logical entity.
Characterizing Entities in the Bitcoin Blockchain
Bitcoin has created a new exchange paradigm within which financial transactions can be trusted without an intermediary.
