Adaptation based on generalized discrepancy

Corinna Cortes, Mehryar Mohri, Andrés Muñoz Medina

Research output: Contribution to journalArticlepeer-review


We present a new algorithm for domain adaptation improving upon a discrepancy minimization algorithm, (DM), previously shown to outperform a number of algorithms for this problem. Unlike many previously proposed solutions for domain adaptation, our algorithm does not consist of a fixed reweighting of the losses over the training sample. Instead, the reweighting depends on the hypothesis sought. The algorithm is derived from a less conservative notion of discrepancy than the DM algorithm called generalized discrepancy. We present a detailed description of our algorithm and show that it can be formulated as a convex optimization problem. We also give a detailed theoretical analysis of its learning guarantees which helps us select its parameters. Finally, we report the results of experiments demonstrating that it improves upon discrepancy minimization.

Original languageEnglish (US)
Pages (from-to)1-30
Number of pages30
JournalJournal of Machine Learning Research
StatePublished - Jan 1 2019


  • Domain adaptation
  • Learning theory

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Control and Systems Engineering
  • Statistics and Probability


Dive into the research topics of 'Adaptation based on generalized discrepancy'. Together they form a unique fingerprint.

Cite this