no code implementations • 21 Nov 2023 • Caelan Atamanchuk, Luc Devroye, Gabor Lugosi
We also show that, without any condition on the density, a consistent estimator of $d$ exists when $n r_n^d \to \infty$ and $r_n = o(1)$.
no code implementations • 2 Jun 2023 • Simon Briend, Luc Devroye, Gabor Lugosi
The parents' bits are flipped with probability $p$, and a majority vote is taken.
no code implementations • 22 Oct 2020 • Gabor Lugosi, Shahar Mendelson
We consider the problem of estimating the mean of a random vector based on $N$ independent, identically distributed observations.
no code implementations • 22 Oct 2020 • Luc Devroye, Silvio Lattanzi, Gabor Lugosi, Nikita Zhivotovskiy
We study the problem of estimating the common mean $\mu$ of $n$ independent symmetric random variables with different and unknown standard deviations $\sigma_1 \le \sigma_2 \le \cdots \le\sigma_n$.
no code implementations • 10 Jun 2019 • Gabor Lugosi, Shahar Mendelson
We dedicate a section on statistical learning problems--in particular, regression function estimation--in the presence of possibly heavy-tailed data.
no code implementations • 25 Aug 2018 • Gabor Lugosi, Abbas Mehrabian
We give the first theoretical guarantees for the second model: an algorithm with a logarithmic regret, and an algorithm with a square-root regret type that does not depend on the gaps between the means.
no code implementations • NeurIPS 2012 • Nicolò Cesa-Bianchi, Pierre Gaillard, Gabor Lugosi, Gilles Stoltz
Mirror descent with an entropic regularizer is known to achieve shifting regret bounds that are logarithmic in the dimension.