PAC-Bayes and Domain Adaptation
Type de document :
Article dans une revue scientifique
URL permanente :
Titre :
PAC-Bayes and Domain Adaptation
Auteur(s) :
Germain, Pascal [Auteur]
Habrard, Amaury [Auteur]
Laviolette, François [Auteur]
Morvant, Emilie [Auteur]
Habrard, Amaury [Auteur]
Laviolette, François [Auteur]
Morvant, Emilie [Auteur]
Titre de la revue :
Neurocomputing
Numéro :
379
Pagination :
379-397
Éditeur :
Elsevier
Date de publication :
2020
ISSN :
0925-2312
Mot(s)-clé(s) :
PAC-Bayesian Theory
Domain Adaptation
Domain Adaptation
Discipline(s) HAL :
Statistiques [stat]/Machine Learning [stat.ML]
Résumé en anglais : [en]
We provide two main contributions in PAC-Bayesian theory for domain adaptation where the objective is to learn, from a source distribution, a well-performing majority vote on a different, but related, target distribution. ...
Lire la suite >We provide two main contributions in PAC-Bayesian theory for domain adaptation where the objective is to learn, from a source distribution, a well-performing majority vote on a different, but related, target distribution. Firstly, we propose an improvement of the previous approach we proposed in Germain et al. (2013), which relies on a novel distribution pseudodistance based on a disagreement averaging, allowing us to derive a new tighter domain adaptation bound for the target risk. While this bound stands in the spirit of common domain adaptation works, we derive a second bound (introduced in Germain et al., 2016) that brings a new perspective on domain adaptation by deriving an upper bound on the target risk where the distributions' divergence\u2014expressed as a ratio\u2014controls the trade-off between a source error measure and the target voters' disagreement. We discuss and compare both results, from which we obtain PAC-Bayesian generalization bounds. Furthermore, from the PAC-Bayesian specialization to linear classifiers, we infer two learning algorithms, and we evaluate them on real data.Lire moins >
Lire la suite >We provide two main contributions in PAC-Bayesian theory for domain adaptation where the objective is to learn, from a source distribution, a well-performing majority vote on a different, but related, target distribution. Firstly, we propose an improvement of the previous approach we proposed in Germain et al. (2013), which relies on a novel distribution pseudodistance based on a disagreement averaging, allowing us to derive a new tighter domain adaptation bound for the target risk. While this bound stands in the spirit of common domain adaptation works, we derive a second bound (introduced in Germain et al., 2016) that brings a new perspective on domain adaptation by deriving an upper bound on the target risk where the distributions' divergence\u2014expressed as a ratio\u2014controls the trade-off between a source error measure and the target voters' disagreement. We discuss and compare both results, from which we obtain PAC-Bayesian generalization bounds. Furthermore, from the PAC-Bayesian specialization to linear classifiers, we infer two learning algorithms, and we evaluate them on real data.Lire moins >
Langue :
Anglais
Audience :
Internationale
Vulgarisation :
Non
Projet Européen :
Établissement(s) :
CNRS
Université de Lille
Université de Lille
Date de dépôt :
2020-06-08T14:11:27Z
2020-06-09T09:31:02Z
2020-06-09T09:31:02Z
Fichiers
- documen
- Accès libre
- Accéder au document