8 citations · 20 across the 14 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.CO2025
A note on the distinct distances problem over finite fields
Nataly Brukhim, Ariel Bruner, Orit E. Raz
We study a finite-field analogue of the Erdős distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let denote the set of Hamming dist…
cs.LG2025
On the Hardness of Bandit Learning
Nataly Brukhim, Aldo Pacchiano, Miroslav Dudik +1
We study the task of bandit learning, also known as best-arm identification, under the assumption that the true reward function f belongs to a known, but arbitrary, function class…