Guillaume Stempfel

  1. Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and Stationary \beta-Mixing Processes.

    Authors: Liva Ralaivola, Marie Szafranski, Guillaume Stempfel
    Subjects: Learning
    Abstract

    Pac-Bayes bounds are among the most accurate generalization bounds for
    classifiers learned from independently and identically distributed (IID) data,
    and it is particularly so for margin classifiers: there have been recent
    contributions showing how practical these bounds can be either to perform model
    selection (Ambroladze et al., 2007) or even to directly guide the learning of
    linear classifiers (Germain et al., 2009). However, there are many practical
    situations where the training data show some dependencies and where the
    traditional IID assumption does not hold.

Syndicate content