Domain adaptation of weighted majority votes via perturbed variation-based self-labeling
Emilie Morvant (LHC)

TL;DR
This paper introduces PV-MinCq, a domain adaptation method that extends MinCq by using perturbed variation-based self-labeling to improve classification across different data distributions.
Contribution
It proposes a novel framework combining perturbed variation divergence with MinCq for effective domain adaptation in classification tasks.
Findings
Promising results on synthetic rotation and translation problems.
Effective self-labeling in regions with similar source and target marginals.
Theoretical bounds support the approach's validity.
Abstract
In machine learning, the domain adaptation problem arrives when the test (target) and the train (source) data are generated from different distributions. A key applied issue is thus the design of algorithms able to generalize on a new distribution, for which we have no label information. We focus on learning classification models defined as a weighted majority vote over a set of real-val ued functions. In this context, Germain et al. (2013) have shown that a measure of disagreement between these functions is crucial to control. The core of this measure is a theoretical bound--the C-bound (Lacasse et al., 2007)--which involves the disagreement and leads to a well performing majority vote learning algorithm in usual non-adaptative supervised setting: MinCq. In this work, we propose a framework to extend MinCq to a domain adaptation scenario. This procedure takes advantage of the recent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and Algorithms · Multimodal Machine Learning Applications
