pith. sign in

arxiv: 1608.00757 · v1 · pith:36UOBNMBnew · submitted 2016-08-02 · 🧮 math.ST · stat.TH

Risk minimization by median-of-means tournaments

classification 🧮 math.ST stat.TH
keywords classicalmedian-of-meansminimizationrandomriskvariableaccuracyachieves
0
0 comments X
read the original abstract

We consider the classical statistical learning/regression problem, when the value of a real random variable Y is to be predicted based on the observation of another random variable X. Given a class of functions F and a sample of independent copies of (X, Y ), one needs to choose a function f from F such that f(X) approximates Y as well as possible, in the mean-squared sense. We introduce a new procedure, the so-called median-of-means tournament, that achieves the optimal tradeoff between accuracy and confidence under minimal assumptions, and in particular outperforms classical methods based on empirical risk minimization.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method

    math.ST 2019-07 unverdicted novelty 5.0

    Develops truncated-gradient mirror descent algorithms for robust convex stochastic optimization and establishes sub-Gaussian confidence bounds under weak noise tail assumptions in convex and strongly convex cases.