Adaptation based on generalized discrepancy
From MaRDI portal
Publication:4633010
Recommendations
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- A kernel two-sample test
- A theory of the learnable
- Approximate minimum enclosing balls in high dimensions using core-sets
- Direct importance estimation for covariate shift adaptation
- Domain adaptation and sample bias correction theory and algorithm for regression
- Domain adaptation in regression
- On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples
- Sample Selection Bias Correction Theory
- Stability bounds for stationary \(\varphi \)-mixing and \(\beta \)-mixing processes
- Two Algorithms for the Minimum Enclosing Ball Problem
Cited in
(11)- Domain adaptation and sample bias correction theory and algorithm for regression
- Robust domain adaptation
- On minimum distribution discrepancy support vector machine for domain adaptation
- On generalization in moment-based domain adaptation
- Nuclear discrepancy for single-shot batch active learning
- Best-effort adaptation
- Domain adaptation in regression
- Domain adaptation learning based on maximum distribution weighted mean discrepancy
- Adaptive transfer learning
- Marginal singularity and the benefits of labels in covariate-shift
- A local weighted mean based domain adaptation learning framework
This page was built for publication: Adaptation based on generalized discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633010)