mlsanityData to 14 Oct 2026

Information-Theoretic Bounds on Transfer Generalization Gap Based on Jensen-Shannon Divergence

arXiv 2010.09484 ↗First posted 13 Oct 2020cs.LG cs.IT eess.SPcited by 11

Not on the map. Why?

Abstract (arXiv)

In transfer learning, training and testing data sets are drawn from different data distributions. The transfer generalization gap is the difference between the population loss on the target data distribution and the training loss. The training data set generally includes data drawn from both source and target distributions. This work presents novel information-theoretic upper bounds on the average transfer generalization gap that capture (i) the domain shift between the target data distribution P'Z and the source distribution PZ through a two-parameter family of generalized (α1,α2)-Jensen-Shannon (JS) divergences; and (ii) the sensitivity of the transfer learner output W to each individual sample of the data set Zi via the mutual information I(W;Zi). For α1 ∈ (0,1), the (α1,α2)-JS divergence can be bounded even when the support of PZ is not included in that of P'Z. This contrasts the Kullback-Leibler (KL) divergence DKL(PZ||P'Z)-based bounds of Wu et al. [1], which are vacuous under this assumption. Moreover, the obtained bounds hold for unbounded loss functions with bounded cumulant generating functions, unlike the φ-divergence based bound of Wu et al. [1]. We also obtain new upper bounds on the average transfer excess risk in terms of the (α1,α2)-JS divergence for empirical weighted risk minimization (EWRM), which minimizes the weighted average training losses over source and target data sets. Finally, we provide a numerical example to illustrate the merits of the introduced bounds.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Oct 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 4; 2022: 3; 2023: 1; 2024: 1; 2025: 1; 2026: 1.

11 papers.