Skip navigation
Skip navigation

Learning without Concentration

Mendelson, Shahar

Description

We obtain sharp bounds on the convergence rate of Empirical Risk Minimization performed in a convex class and with respect to the squared loss, without any boundedness assumptions on class members or on the target. Rather than resorting to a concentration-based argument, the method relies on a ‘small-ball’ assumption and thus holds for heavy-tailed sampling and heavy-tailed targets. Moreover, the resulting estimates scale correctly with the ‘noise level’ of the problem. When applied to the...[Show more]

CollectionsANU Research Publications
Date published: 2014
Type: Journal article
URI: http://hdl.handle.net/1885/29703
Source: JMLR: Workshop and Conference Proceedings

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator