Amazon cover image
Image from Amazon.com
Image from Google Jackets

Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems [electronic resource] : École d’Été de Probabilités de Saint-Flour XXXVIII-2008 / by Vladimir Koltchinskii.

By: Contributor(s): Material type: TextTextSeries: École d'Été de Probabilités de Saint-Flour ; 2033Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: IX, 254 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642221477
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 519.2 23
LOC classification:
  • QA273.A1-274.9
  • QA274-274.9
Online resources: In: Springer eBooksSummary: The purpose of these lecture notes is to provide an introduction to the general theory of empirical risk minimization with an emphasis on excess risk bounds and oracle inequalities in penalized problems. In recent years, there have been new developments in this area motivated by the study of new classes of methods in machine learning such as large margin classification methods (boosting, kernel machines). The main probabilistic tools involved in the analysis of these problems are concentration and deviation inequalities by Talagrand along with other methods of empirical processes theory (symmetrization inequalities, contraction inequality for Rademacher sums, entropy and generic chaining bounds). Sparse recovery based on l_1-type penalization and low rank matrix recovery based on the nuclear norm penalization are other active areas of research, where the main problems can be stated in the framework of penalized empirical risk minimization, and concentration inequalities and empirical processes tools have proved to be very useful.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

The purpose of these lecture notes is to provide an introduction to the general theory of empirical risk minimization with an emphasis on excess risk bounds and oracle inequalities in penalized problems. In recent years, there have been new developments in this area motivated by the study of new classes of methods in machine learning such as large margin classification methods (boosting, kernel machines). The main probabilistic tools involved in the analysis of these problems are concentration and deviation inequalities by Talagrand along with other methods of empirical processes theory (symmetrization inequalities, contraction inequality for Rademacher sums, entropy and generic chaining bounds). Sparse recovery based on l_1-type penalization and low rank matrix recovery based on the nuclear norm penalization are other active areas of research, where the main problems can be stated in the framework of penalized empirical risk minimization, and concentration inequalities and empirical processes tools have proved to be very useful.

There are no comments on this title.

to post a comment.
(C) Powered by Koha

Powered by Koha