English

Aggregation with Exponential Weights is Optimal in Expectation

Statistics Theory 2026-07-02 v1 Machine Learning Machine Learning

Abstract

The aggregation with exponential weights (AEW) estimator is not fully understood in the basic setting of model selection aggregation with squared loss. In particular, whether it is minimax-rate optimal in expectation for large enough fixed temperatures and under random design has been an open problem since its introduction, which was explicitly posed by Lecu\'{e} and Mendelson (2013). In this paper, we settle this problem by showing that \emph{without} requiring a Bernstein-type assumption, the AEW indeed achieves the excess risk Tlog(M)/(n+1)T \log (M) / (n+1) in expectation, whenever the temperature TT satisfies (L2/T)exp(B/T)μ/2(L^2/T)\exp(B/T)\leq \mu /2. Here, the number of dictionary elements is MM, the estimator has observed nn i.i.d. samples from any distribution, and the loss is assumed to be bounded by BB, LL-Lipschitz continuous and μ\mu-strongly convex. For squared loss, we show that T4b2T\geq 4 b^2 suffices when the predictions and labels are [0,b][0,b]-valued. Because AEW is known to be suboptimal in expectation for temperatures below some constant, this shows that AEW has a sharp phase transition when the temperature is large enough but constant, as conjectured by Lecu\'{e} and Mendelson.

Cite

@article{arxiv.2607.02247,
  title  = {Aggregation with Exponential Weights is Optimal in Expectation},
  author = {Mikael Møller Høgsgaard and Patrick Rebeschini and Tobias Wegel},
  journal= {arXiv preprint arXiv:2607.02247},
  year   = {2026}
}