Chromatic PAC-Bayes Bounds for Non-IID Data

author: Liva Ralaivola, Aix-Marseille Université
published: Dec. 20, 2008,   recorded: December 2008,   views: 3097

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

Pac-Bayes bounds are among the most accurate generalization bounds for classifiers learned with \iid data, and it is particularly so for margin classifiers. However, there are many practical cases where the training data show some dependencies and where the traditional \iid assumption does not apply. Stating generalization bound for such frameworks is therefore of the utmost interest. In this work, we propose the first, to the best of our knowledge, \pac-Bayes generalization bounds for classifiers trained on data exhibiting dependencies. The approach is based on the decomposition of a so-called dependency graph of the data in sets of independent data, through the tool of fractional covers. Our bounds are very general, since being able to find an upper bound on the chromatic number of the dependency graph is sufficient for it get new bounds for specific settings. We show how our results can be used to derive bounds for bipartite ranking and windowed prediction.

See Also:

Download slides icon Download slides: wehys08_ralaivola_cpbb_01.pdf (104.3¬†KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: