2013

Empirical entropy, minimax regret and minimax risk

Rakhlin, Alexander, Sridharan, Karthik, Tsybakov, Alexandre B.

Understand

We consider the random design regression model with square loss.

  • We propose a method that aggregates empirical minimizers (ERM) over appropriately chosen random subsets and reduces to ERM in the extreme case, and we establish sharp oracle inequalities for its risk.
  • We show that, under the $\varepsilon^{-p}$ growth of the empirical $\varepsilon$-entropy, the excess risk of the proposed method attains the rate $n^{-2/(2+p)}$ for $p\in(0,2)$ and $n^{-1/p}$ for $p>2$ where $n$ is the sample size.
  • Furthermore, for $p\in(0,2)$, the excess risk rate matches the behavior of the minimax risk of function estimation in regression problems under the well-specified model.

Reading the bibliography…