Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Kalkanli, Cem"'
Secure ranging refers to the capability of upper-bounding the actual physical distance between two devices with reliability. This is essential in a variety of applications, including to unlock physical systems. In this work, we will look at secure ra
Externí odkaz:
http://arxiv.org/abs/2312.03964
Autor:
Kalkanli, Cem, Ozgur, Ayfer
We introduce a novel anytime Batched Thompson sampling policy for multi-armed bandits where the agent observes the rewards of her actions and adjusts her policy only at the end of a small number of batches. We show that this policy simultaneously ach
Externí odkaz:
http://arxiv.org/abs/2110.00202
Autor:
Kalkanli, Cem, Ozgur, Ayfer
Publikováno v:
IEEE International Symposium on Information Theory (ISIT), 2021, pp. 539-544
We study the asymptotic performance of the Thompson sampling algorithm in the batched multi-armed bandit setting where the time horizon $T$ is divided into batches, and the agent is not able to observe the rewards of her actions until the end of each
Externí odkaz:
http://arxiv.org/abs/2110.00158
Autor:
Kalkanli, Cem, Ozgur, Ayfer
Thompson sampling has been shown to be an effective policy across a variety of online learning tasks. Many works have analyzed the finite time performance of Thompson sampling, and proved that it achieves a sub-linear regret under a broad range of pr
Externí odkaz:
http://arxiv.org/abs/2011.03917
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.