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 — Examples
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
- Distribution shift and domain adaptation
- 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
None yet.
4 · Examples, counterexamples and false statements
Support mismatch prevents covariate-shift weighting
Example
Let with the discrete sigma-algebras. Let the source joint law put mass one on and the target joint law put mass one on . Both conditional label kernels assign label with probability one at each input. The input marginals are and . Although the conditional label laws agree, there is no nonnegative measurable satisfying for every measurable .
Example references
Source and target joint laws, risks, and covariate shift: defines the joint laws, conditional label kernels, input marginals, and the covariate-shift condition.
Importance weighting under covariate shift: requires absolute continuity of the target input marginal with respect to the source marginal.
Ben-David et al., §3, printed pp. 154–155: distinguishes shifts in input laws from changes in labeling functions.
Facts & Assumptions
Given: The two finite joint laws and their common constant conditional label kernel in the Example.
Source and target joint laws, risks, and covariate shift: covariate shift requires as well as equality of conditional label kernels -almost everywhere.
A nonnegative integral over a null set vanishes: the integral of a nonnegative measurable function over a measurable null set is zero.
Verification
For , the specified point masses give and . Thus by the definition of absolute continuity.
If a nonnegative measurable density satisfied the proposed setwise identity, then by [F2], contradicting from step 1.1.
The kernels agree everywhere, but the absolute-continuity hypothesis in [F1] fails by step 1.1, so the covariate-shift importance-weighting theorem does not apply.
Covariate-shift weights can be unbounded and integrable
Example
Let with the discrete sigma-algebra and . Let the source input law have masses and the target input law have masses for . In both domains the label is with probability one. Use the zero-one loss and the constant classifier . The covariate-shift weight is : it is unbounded, but the weighted loss is integrable and the target risk equals the importance-weighted source risk, both equal to . Thus the exact risk identity holds while the bounded-weight hypothesis in any finite-sample concentration result that requires it fails.
Example references
Source and target joint laws, risks, and covariate shift: defines source and target joint laws, marginal laws, risks, and covariate shift.
Importance weighting under covariate shift: establishes the risk identity when the weighted loss is integrable.
Sugiyama, §3.1, book pp. 930–931: importance-weighted risk under covariate shift and the distinction between the exact identity and estimation methods.
Facts & Assumptions
Given: The discrete source and target masses, their common deterministic label kernel, the constant classifier , and zero-one loss.
Source and target joint laws, risks, and covariate shift: input marginals are probability measures, and under covariate shift their conditional label kernels agree and .
Importance weighting under covariate shift: for an integrable weighted loss, target risk is its target-input-density-weighted source risk.
Verification
For , , so the source masses sum to . Also : this holds at , and adding proves the formula at . Since , the target masses sum to .
Every source atom has positive mass, so the only -null set is empty and . The atomwise ratios satisfy , hence is a density and . The two conditional label kernels are identical.
The loss of against label is , hence . Its weighted source risk is by step 1.1; thus it is finite and equals the target risk.
Identical input laws can hide a large joint-labeling error
Example
Let the input space contain one point , and let both source and target input marginals put mass one on . Let the source label be surely and the target label be surely. For the class of the two constant binary classifiers, every classifier pair has equal source and target disagreement probabilities, so . Yet , , and the joint-labeling error . Thus the target-risk bound is sharp for , and equal input laws alone give no target-risk guarantee when the labeling law changes.
Example references
Source and target joint laws, risks, and covariate shift: defines joint laws, conditional label kernels, input marginals, and covariate shift.
H-delta-H divergence: defines divergence using only the input marginals.
Importance weighting under covariate shift: requires the conditional label kernels to agree on the target marginal.
Target risk bound by source risk, H-delta-H divergence, and joint error: retains the joint-labeling term in the target-risk bound.
Ben-David et al., Definition 2 and Theorem 2 proof, printed pp. 156–158: the joint-labeling error and the role of that term in the transfer bound.
Facts & Assumptions
Given: The one-point input space, deterministic source and target labels, and the two constant classifiers in the Example.
Source and target joint laws, risks, and covariate shift: source and target risks are probabilities under their respective joint laws, and the conditional label kernels are part of the domain pair.
H-delta-H divergence: the divergence compares disagreement probabilities under the two input marginals.
Target risk bound by source risk, H-delta-H divergence, and joint error: every classifier satisfies the source-risk plus half-divergence plus joint-error bound.
Importance weighting under covariate shift and Source and target joint laws, risks, and covariate shift: importance weighting requires covariate shift, including equality of the source and target conditional label kernels on the target marginal.
Verification
The two input marginals are identical, so every disagreement event has the same probability under them; [F2] gives .
Under the specified labels, , , , and . Therefore the infimum defining is .
Substituting these values into [F3] gives , with equality; dropping would assert the false inequality . The conditional label kernels differ at , so the premise in [F4] fails despite the equal input marginals.
Sources
- Shai Ben-David et al., A Theory of Learning from Different Domains, Machine Learning 79 (2010), §3
- Masashi Sugiyama, Learning under Non-stationarity: Covariate Shift Adaptation by Importance Weighting, Handbook of Computational Statistics, 2nd ed., Chapter 31 (2012), §3.1
- Masashi Sugiyama, Learning under Non-stationarity: Covariate Shift Adaptation by Importance Weighting, Handbook of Computational Statistics, 2nd ed., Chapter 31 (2012), §§2–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), §4.2 and Theorem 2 proof