Search Results for author:
Found 6 papers, 1 papers with code
Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory
We present a conceptually simple, and efficient algorithm that needs to remember statistics of at most $M$ arms, and for any $K$-armed finite bandit instance it enjoys a $O(KM +K^{1. 5}\sqrt{T\log (T/MK)}/M)$ upper-bound on regret.
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
The problem of identifying $k > 1$ distinct arms from the best $\rho$ fraction is not always well-defined; for a special class of this problem, we present lower and upper bounds.
Lower Bounds for Policy Iteration on Multi-action MDPs
An important theoretical question is how many iterations a specified PI variant will take to terminate as a function of the number of states $n$ and the number of actions $k$ in the input MDP.
An Analysis of Frame-skipping in Reinforcement Learning
In this paper, we investigate the role of the parameter $d$ in RL; $d$ is called the "frame-skip" parameter, since states in the Atari domain are images.
PAC Mode Estimation using PPR Martingale Confidence Sequences
This problem reduces to the estimation of a single parameter when $\mathcal{P}$ has a support set of size $K = 2$.
Artificial Intelligence and Life in 2030: The One Hundred Year Study on Artificial Intelligence
In September 2016, Stanford's "One Hundred Year Study on Artificial Intelligence" project (AI100) issued the first report of its planned long-term periodic assessment of artificial intelligence (AI) and its impact on society.
