Domain Adaptation Transfer Learning by SVM Subject to a Maximum-Mean-Discrepancy-like Constraint - Archive ouverte HAL Access content directly
Conference Papers Year :

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

(1) , (1)
1

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.
Not file

Dates and versions

hal-02861449 , version 1 (09-06-2020)

Identifiers

Cite

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⟩
32 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More