Skip navigation
Skip navigation

Empirical minimization

Bartlett, Peter L; Mendelson, Shahar


We investigate the behavior of the empirical minimization algorithm using various methods. We first analyze it by comparing the empirical, random, structure and the original one on the class, either in an additive sense, via the uniform law of large numbers, or in a multiplicative sense, using isomorphic coordinate projections. We then show that a direct analysis of the empirical minimization algorithm yields a significantly better bound, and that the estimates we obtain are essentially sharp....[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
Source: Probability Theory and Related Fields
DOI: 10.1007/s00440-005-0462-3


File Description SizeFormat Image
01_Bartlett_Empirical_minimiza_2006.pdf228.9 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator