Robust domain adaptation

Yishay Mansour; Mariano Schain

doi:10.1007/s10472-013-9391-5

Robust domain adaptation

Yishay Mansour
, Mariano Schain

School of Computer Science and AI

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

We derive a generalization bound for domain adaptation by using the properties of robust algorithms. Our new bound depends on λ-shift, a measure of prior knowledge regarding the similarity of source and target domain distributions. Based on the generalization bound, we design SVM variants for binary classification and regression domain adaptation algorithms.

Original language	English
Pages (from-to)	365-380
Number of pages	16
Journal	Annals of Mathematics and Artificial Intelligence
Volume	71
Issue number	4
DOIs	https://doi.org/10.1007/s10472-013-9391-5
State	Published - 1 Aug 2014

Keywords

Adaptation
Robustness
SVM

ASJC Scopus subject areas

Applied Mathematics
Artificial Intelligence

Access to Document

10.1007/s10472-013-9391-5

Cite this

@article{07fc3cca26a74757b12797d07feab66b,

title = "Robust domain adaptation",

abstract = "We derive a generalization bound for domain adaptation by using the properties of robust algorithms. Our new bound depends on λ-shift, a measure of prior knowledge regarding the similarity of source and target domain distributions. Based on the generalization bound, we design SVM variants for binary classification and regression domain adaptation algorithms.",

keywords = "Adaptation, Robustness, SVM",

author = "Yishay Mansour and Mariano Schain",

note = "Publisher Copyright: {\textcopyright} 2013, Springer Science+Business Media Dordrecht.",

year = "2014",

month = aug,

day = "1",

doi = "10.1007/s10472-013-9391-5",

language = "الإنجليزيّة",

volume = "71",

pages = "365--380",

journal = "Annals of Mathematics and Artificial Intelligence",

issn = "1012-2443",

publisher = "Springer Netherlands",

number = "4",

}

TY - JOUR

T1 - Robust domain adaptation

AU - Mansour, Yishay

AU - Schain, Mariano

PY - 2014/8/1

Y1 - 2014/8/1

N2 - We derive a generalization bound for domain adaptation by using the properties of robust algorithms. Our new bound depends on λ-shift, a measure of prior knowledge regarding the similarity of source and target domain distributions. Based on the generalization bound, we design SVM variants for binary classification and regression domain adaptation algorithms.

AB - We derive a generalization bound for domain adaptation by using the properties of robust algorithms. Our new bound depends on λ-shift, a measure of prior knowledge regarding the similarity of source and target domain distributions. Based on the generalization bound, we design SVM variants for binary classification and regression domain adaptation algorithms.

KW - Adaptation

KW - Robustness

KW - SVM

UR - https://www.scopus.com/pages/publications/84908066136

U2 - 10.1007/s10472-013-9391-5

DO - 10.1007/s10472-013-9391-5

M3 - مقالة

SN - 1012-2443

VL - 71

SP - 365

EP - 380

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

IS - 4

ER -

Robust domain adaptation

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this