Best-effort adaptation
From MaRDI portal
Cites work
- 10.1162/1532443041424300
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A theory of learning from different domains
- A theory of transfer learning with applications to active learning
- Adaptation based on generalized discrepancy
- Addendum to: ``Multiple-source adaptation theory and algorithms
- Bounds for linear multi-task learning
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Covariate shift adaptation by importance weighted cross validation
- DC programming: overview.
- Domain adaptation and sample bias correction theory and algorithm for regression
- Domain adaptation in regression
- Domain-adversarial training of neural networks
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Foundations of machine learning
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- Learning from multiple sources
- Multi-task kernel learning based on probabilistic Lipschitzness
- Multiple-source adaptation theory and algorithms
- New analysis and algorithm for learning with drifting distributions
- On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Relative deviation learning bounds and generalization with unbounded loss functions
- Scikit-learn: machine learning in Python
- The benefit of multitask representation learning
- The Concave-Convex Procedure
This page was built for publication: Best-effort adaptation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496424)
