How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Distribution shift and domain adaptation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Prediction problems, risks, and empirical minimization
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Logical flowchart
3 · Definitions, theorems and proofs
Source and target joint laws, risks, and covariate shift
Definition
Let , , and be nonempty measurable spaces. A source/target pair of joint laws consists of probability measures and on . For , its input marginal is the probability measure on defined by . If is measurable and is product-measurable, then is measurable: the preimage of a measurable rectangle is , and such rectangles generate the product sigma-algebra. Taking preimages once more shows that is measurable. The domain risk is the extended nonnegative integral
A conditional label kernel for is a specified probability kernel from to such that, for every nonnegative product-measurable , The pair is under covariate shift when conditional label kernels are supplied, there is a measurable set with such that as probability measures for every , and . No existence of conditional kernels is asserted by this definition.
Definition references
Supervised prediction problems: gives the measurable spaces, joint probability law, predictor class, and measurable loss convention.
Population and empirical risk: defines domain risk as an extended nonnegative integral.
A measurable function between measurable spaces: a map is measurable when preimages of measurable sets are measurable.
The product sigma-algebra and its finite iterates: the product sigma-algebra is generated by measurable rectangles.
Measure kernel and probability kernel: a probability kernel assigns a probability measure to each input and has measurable event evaluations.
Absolute continuity of a signed or complex measure with respect to a positive measure: means every -null measurable set is -null.
Measurability of integration against a kernel: for a probability kernel and a nonnegative product-measurable function, the section integral is measurable.
Shalev-Shwartz and Ben-David, §3.2.1–3.2.2, PDF pp. 45–48: joint domain/label laws, marginal input law, classification risk, general loss, and expected risk.
Ben-David et al., §§3–4, printed pp. 154–158: source and target input distributions and labeling functions, their risks, and the joint-labeling error convention.
Mansour, Mohri, and Rostamizadeh, §§2–3, arXiv version 3, pp. 2–4: domain risks and distribution-dependent losses for arbitrary measurable function classes.
Sugiyama, §2, book pp. 928–930: training and test input laws, a shared conditional label law, and target generalization risk.
H-delta-H divergence
Definition
Let be a measurable space, equip with its discrete sigma-algebra, let and be probability measures on , and let be a nonempty class of measurable classifiers . For , define their measurable disagreement set by The divergence of the two input laws is
Definition references
Source and target joint laws, risks, and covariate shift: supplies the source and target input marginals and .
A measurable function between measurable spaces: measurability means measurable preimages, so the displayed finite union of intersections is measurable.
Ben-David et al., Definition 3, Lemma 3, printed pp. 156–157: the symmetric-difference hypothesis class and the disagreement-probability bound.
Mansour, Mohri, and Rostamizadeh, Definition 3 and §3, arXiv version 3, pp. 3–4: the distance with for binary classification.
Loss discrepancy between domains
Definition
Let and be measurable spaces, let and be probability measures on (in particular, source and target input marginals), and let be a nonempty class of measurable functions . Let be product-measurable. For , the map is measurable because the preimage of each measurable rectangle is and such rectangles generate the product sigma-algebra; composing with shows that is measurable. Assume that, for every , the two integrals below are finite, and define The -discrepancy between and over is the extended nonnegative number The supremum need not be attained.
Definition references
Source and target joint laws, risks, and covariate shift: supplies the source and target input marginals and their common measurable input space.
A measurable function between measurable spaces: a map is measurable when preimages of measurable sets are measurable.
The product sigma-algebra and its finite iterates: the product sigma-algebra is generated by measurable rectangles.
Mansour, Mohri, and Rostamizadeh, Definition 4 and Theorem 8, arXiv version 3, pp. 4–6: the discrepancy distance for a general loss and its domain-adaptation bound.
Sugiyama, §2 and §3.1, book pp. 928–931: generalization risk under distinct input laws and loss reweighting under a shared conditional label law.
Covariate shift gives a joint-law density
Statement
Assume AC. Let be source and target joint laws with input marginals and specified conditional label kernels as in the definition of source/target distributions. Suppose and there is a -null set outside of which . Let be any nonnegative measurable representative of . Then for every product-measurable set , Consequently and is a representative of the likelihood-ratio density of with respect to .
Statement references
Sugiyama, §3.1, book pp. 930–931: the density-based covariate-shift identity that this lemma establishes for general measurable spaces using supplied conditional kernels.
Facts & Assumptions
Given: AC; source and target joint probability laws on the common product measurable space; their input marginals and conditional label kernels; ; and a nonnegative representative of .
The Axiom of Choice: AC is assumed for the Radon-Nikodym density selection used below.
Source and target joint laws, risks, and covariate shift: for every nonnegative product-measurable , .
Likelihood densities and Likelihood ratio as a Radon–Nikodym derivative: for the two-law experiment with parameter set dominated by , AC supplies a finite-valued nonnegative representative of the Radon–Nikodym density class of with respect to ; every other representative of that class agrees with -almost everywhere. Since these are probability measures, the constant sequence is a common finite-measure exhaustion.
Likelihood-ratio change of measure: if , then for every nonnegative measurable .
The measure with density relative to : a nonnegative measurable density relative to a measure defines the measure by .
A measurable function between measurable spaces: a map is measurable when preimages of measurable sets are measurable.
Closure properties of measurable functions used by the integral: if is measurable and is measurable, then is measurable.
Pi-systems and The product sigma-algebra and its finite iterates: measurable rectangles form a -system generating .
Finite measures agreeing on a generating pi-system and on the whole space are equal: finite measures with equal total mass that agree on a generating -system agree on the generated sigma-algebra.
Source and target joint laws, risks, and covariate shift: under covariate shift, the specified kernels agree as probability measures outside a -null set.
Measure kernel and probability kernel: for each measurable , is measurable.
Measure kernel and probability kernel: a probability kernel satisfies for every .
A nonnegative integral over a null set vanishes: the integral of a nonnegative measurable function over a measurable null set is zero.
Monotonicity and nonnegative homogeneity of the nonnegative integral: multiplication by a finite nonnegative scalar is homogeneous for the nonnegative integral; the zero scalar case gives integral zero.
Source and target joint laws, risks, and covariate shift: the input marginal satisfies for every .
Proof
Let . For each , , so is measurable by [F5] and [F7]. For every Borel , is product-measurable. Define ; [F4] makes a measure. Since by [F11], [F1] and [F13] give . Applying [F3] to yields . Thus and are finite measures of equal total mass.
For and , the function is nonnegative and product-measurable by [F5]–[F7]. By [F10], is measurable, and by [F6] the function is measurable. Since is finite, [F13] pulls this scalar through the section integral in [F1]. Applying [F3] to gives The middle equality uses the -almost-everywhere equality of the specified kernels, and the last equality uses their target disintegration [F1].
The measurable rectangles form the generating -system in [F7], so [F8] and steps 1.1–1.2 give on the entire product sigma-algebra. Since [F2] identifies as a representative of , the setwise equality makes a Radon–Nikodym representative of with respect to .
Let be the arbitrary representative in the Statement. The same preimage argument as in step 1.1, using [F5] and [F7], shows is measurable. By [F2], there is a measurable with outside of which . By [F14], . For each measurable , the two density integrands agree on , and both integrals over vanish by [F12]. Hence . In particular, if , [F12] gives , so .
Importance weighting under covariate shift
Statement
Assume AC. Let be source and target joint laws under covariate shift, with input marginals and common conditional label kernel . Let be a nonnegative measurable representative of . For any measurable predictor and nonnegative product-measurable loss , if the weighted source loss is integrable, then
Statement references
Sugiyama, §3.1, book pp. 930–931: the importance-weighting identity for a shared conditional label law.
Mansour, Mohri, and Rostamizadeh, §2, arXiv version 3, pp. 2–3: domain risks and arbitrary measurable loss notation.
Facts & Assumptions
Given: AC; source and target joint laws under covariate shift; a measurable predictor ; a nonnegative product-measurable loss ; and .
The Axiom of Choice: AC is assumed for the Radon-Nikodym representatives used by the likelihood-density and change-of-measure suppliers.
Source and target joint laws, risks, and covariate shift: under covariate shift, and the source and target conditional label kernels agree -almost everywhere.
Likelihood densities: in the two-law experiment dominated by , AC supplies a nonnegative measurable representative of .
Covariate shift gives a joint-law density: , with nonnegative likelihood-ratio representative on the joint space.
Population and empirical risks are measurable: in a supervised prediction problem, a measurable predictor in the predictor class induces a product-measurable loss function.
Likelihood-ratio change of measure: under AC and absolute continuity, for every nonnegative measurable .
Proof
Set . For each , the given measurable spaces, joint law , measurable predictor , and product-measurable loss form a supervised prediction problem with predictor class . Since , the hypotheses of [F4] hold and is product-measurable. It is nonnegative, so both integrals in the claim are defined as extended nonnegative integrals.
By [F1] and [F2], the covariate-shift hypotheses hold and is an available input-marginal density. The joint-law lemma [F3] identifies the joint density as . Apply [F5] to to obtain . The assumed integrability makes this common value finite, proving the stated identity.
Target risk bound by source risk, H-delta-H divergence, and joint error
Statement
Let be a measurable space, equip with its discrete sigma-algebra, and let be joint probability laws on with input marginals . Let be a nonempty class of measurable classifiers . Define the source and target risks by for and define the joint-labeling error . Then every satisfies
Statement references
Ben-David et al., Definitions 2–3, Lemma 3, and complete Theorem 2 proof, printed pp. 156–158: the ideal joint error, symmetric-difference divergence, and the source/target triangle argument.
Mansour, Mohri, and Rostamizadeh, §3 and §4.1, arXiv version 3, pp. 3–5: the disagreement distance and the separate finite-sample complexity bounds.
Facts & Assumptions
Given: Source and target joint probability laws on , their input marginals, a nonempty class of measurable binary classifiers, and the definitions of and in the Statement.
Source and target joint laws, risks, and covariate shift: are probability laws on the common input-label product, and are their input marginals.
H-delta-H divergence: for every , .
Supervised prediction problems: each classifier is measurable, so its binary disagreement and error events are measurable in the product sigma-algebra.
Additivity of the nonnegative Lebesgue integral: the nonnegative integral is additive for sums of nonnegative measurable functions.
Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone.
The nonnegative integral agrees with the simple integral on simple functions: the integral of each indicator function equals the measure of its set, since an indicator is a nonnegative simple function.
Proof
Fix . Their disagreement set is measurable since . The error event for is measurable since it is , and likewise for . Pointwise, if then either or ; hence . Monotonicity and additivity of the nonnegative integral, the indicator-integral identity [F6], and the marginal identity in [F1] give .
If , then at least one of and differs from , so . Integrating this inequality under using [F4]–[F6] and the marginal identity in [F1] gives . By [F2], , so step 1.1 yields .
Let . Since is nonempty and is the infimum of its finite joint-error values, there exists with . Substituting this choice into step 2.1 gives .
The inequality in step 3.1 holds for every ; letting decrease to zero gives the stated bound. The proof requires no attained joint-risk minimizer.
Remarks
This is a population inequality. It does not bound empirical source risk or an empirical estimate of the divergence; finite-sample substitution requires a separate bounded-loss and complexity theorem. Even when the input divergence is small, a large joint-labeling error can leave the target-risk bound large.
Remarks references
Ben-David et al., Theorem 2 and its complete proof, printed pp. 157–158: the finite-sample target bound adds VC-complexity terms to the population inequality.
Mansour, Mohri, and Rostamizadeh, §3 and Theorem 9, arXiv version 3, pp. 4–7: empirical discrepancy bounds require Rademacher-complexity controls and bounded-loss assumptions.
Loss-discrepancy domain-adaptation bound
Statement
Let be the source and target input marginals on a common measurable space . Let be a measurable output space, a nonempty class of measurable functions , and measurable labeling functions. Let be product-measurable, symmetric, and satisfy the triangle inequality. Define Assume that every pairwise integral in this discrepancy definition is finite and that source and target minimizers and exist. Then every satisfies The supremum defining may be infinite, in which case the inequality is interpreted in the extended nonnegative reals.
Statement references
Mansour, Mohri, and Rostamizadeh, Definition 4 and Theorem 8, arXiv version 3, §§3–4.1, pp. 3–6: the discrepancy definition and the bound with the minimum of both cross-domain terms (Theorem 8, Eq. (11)); its proof gives both triangle-inequality routes.
Facts & Assumptions
Given: Probability input marginals ; a nonempty measurable hypothesis class ; measurable labeling functions ; a measurable symmetric loss satisfying the triangle inequality; finite pairwise risks for the discrepancy; and attained source and target minima. Labeling risks may be extended nonnegative values.
Source and target joint laws, risks, and covariate shift: the input marginals are probability measures on the common measurable input space.
Loss discrepancy between domains: every pair has finite , and .
A measurable function between measurable spaces: a map is measurable when preimages of measurable sets are measurable.
The product sigma-algebra and its finite iterates: the product sigma-algebra on is generated by measurable rectangles.
Additivity of the nonnegative Lebesgue integral: the nonnegative integral is additive for sums of nonnegative measurable functions.
Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone.
Proof
For measurable , let . For each measurable rectangle , , so is measurable into by [F3] and [F4]. For each Borel , ; hence all displayed loss integrands are measurable. Pairwise integrals with both arguments in are finite by [F2], while integrals involving or are defined extended nonnegative values.
Fix . Applying the triangle inequality twice pointwise and then using monotonicity and additivity of the nonnegative integral [F5, F6] under gives .
A second triangle inequality, integrated under using monotonicity and additivity of the nonnegative integral [F5, F6], gives . Apply [F2] to the first term, then integrate the triangle inequality under using [F5, F6] to obtain . Hence .
By [F2], . Substitution in step 1.2 yields .
The bounds in steps 2.1 and 1.3 have the same terms except for the final cross-domain term. Taking the smaller of those terms proves the stated minimum bound.
Remarks
The discrepancy in this theorem is a population quantity. Estimating it from finite samples, or replacing the input laws by empirical laws, requires additional bounded-loss and complexity assumptions and is a separate result.
Remarks references
Mansour, Mohri, and Rostamizadeh, §§3–4.1, arXiv version 3, pp. 3–7: finite-sample discrepancy estimation and the empirical target-risk bound are stated separately with Rademacher and bounded-loss hypotheses.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to Algorithms, Chapters 2 and 3 (Cambridge University Press, 2014)
- Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman Vaughan, A Theory of Learning from Different Domains, Machine Learning 79 (2010), §§3–4
- Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh, Domain Adaptation: Learning Bounds and Algorithms, arXiv:0902.3430v3, §§2–3
- Masashi Sugiyama, Learning under Non-stationarity: Covariate Shift Adaptation by Importance Weighting, Handbook of Computational Statistics, 2nd ed., Chapter 31 (2012)
- Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman Vaughan, A Theory of Learning from Different Domains, Machine Learning 79 (2010), Definition 3 and Lemma 3
- Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh, Domain Adaptation: Learning Bounds and Algorithms, arXiv:0902.3430v3, §3
- Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh, Domain Adaptation: Learning Bounds and Algorithms, arXiv:0902.3430v3, Definition 4
- Masashi Sugiyama, Learning under Non-stationarity: Covariate Shift Adaptation by Importance Weighting, Handbook of Computational Statistics, 2nd ed., Chapter 31 (2012), §3.1
- Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman Vaughan, A Theory of Learning from Different Domains, Machine Learning 79 (2010), Definitions 2–3, Lemma 3, and Theorem 2 proof
- Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh, Domain Adaptation: Learning Bounds and Algorithms, arXiv:0902.3430v3, §3 and §4.1
- Yishay Mansour, Mehryar Mohri, and Afshin Rostamizadeh, Domain Adaptation: Learning Bounds and Algorithms, arXiv:0902.3430v3, Definition 4 and Theorem 8