## Abstract

We study the performance of empirical risk minimization (ERM), with respect to the quadratic risk, in the context of convex aggregation, in which one wants to construct a procedure whose risk is as close as possible to the best function in the convex hull of an arbitrary finite class F. We show that ERM performed in the convex hull of F is an optimal aggregation procedure for the convex aggregation problem. We also show that if this procedure is used for the problem of model selection aggregation, in which one wants to mimic the performance of the best function in F itself, then its rate is the same as the one achieved for the convex aggregation problem, and thus is far from optimal. These results are obtained in deviation and are sharp up to logarithmic factors.

Original language | English |
---|---|

Pages (from-to) | 288-306 |

Number of pages | 19 |

Journal | Annales de l'institut Henri Poincare (B) Probability and Statistics |

Volume | 49 |

Issue number | 1 |

DOIs | |

Publication status | Published - Feb 2013 |

Externally published | Yes |