Skip to Main content Skip to Navigation
Conference papers

Domain Adaptation Transfer Learning by SVM Subject to a Maximum-Mean-Discrepancy-like Constraint

Abstract : This paper is a contribution to solving the domain adaptation problem where no labeled target data is available. A new SVM approach is proposed by imposing a zero-valued Maximum Mean Discrepancy-like constraint. This heuristic allows us to expect a good similarity between source and target data, after projection onto an efficient subspace of a Reproducing Kernel Hilbert Space. Accordingly, the classifier will perform well on source and target data. We show that this constraint does not modify the quadratic nature of the optimization problem encountered in classic SVM, so standard quadratic optimization tools can be used. Experimental results demonstrate the competitiveness and efficiency of our method.
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02861449
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Tuesday, June 9, 2020 - 7:54:29 AM
Last modification on : Wednesday, June 10, 2020 - 5:35:03 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Xiaoyi Chen, Régis Lengellé. Domain Adaptation Transfer Learning by SVM Subject to a Maximum-Mean-Discrepancy-like Constraint. 6th International Conference on Pattern Recognition Applications and Methods, Feb 2017, Porto, Portugal. pp.89-95, ⟨10.5220/0006119900890095⟩. ⟨hal-02861449⟩

Share

Metrics

Record views

13