Skip to content

Author

Nadav Sukenik

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#machine learning Preprint Oct 2026

Expected Sample Complexity in Multi-Armed Bandits

Sample complexity is a widely used metric in sequential decision-making problems, defined as the number of suboptimal decisions during the interaction between the agent and an environment. We study the sample complexity of stochastic multi-armed bandit problems and introduce the expected sample complexity performance m...

Nadav Sukenik, Nadav Merlis · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.