Online learning algorithms tackling covariate shift
From MaRDI portal
Cites work
- A theory of learning from different domains
- Capacity dependent analysis for functional online learning algorithms
- Convergence of unregularized online learning algorithms
- Covariate shift adaptation by importance weighted cross validation
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Improving predictive inference under covariate shift by weighting the log-likelihood function
- Learning Theory
- Nonparametric stochastic approximation with large step-sizes
- On a regularization of unsupervised domain adaptation in RKHS
- On Complexity Issues of Online Learning Algorithms
- On early stopping in gradient descent learning
- Online gradient descent learning algorithms
- Online learning algorithms
- Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
- Online Learning with Kernels
- Online Regularized Classification Algorithms
- Optimal rates for coefficient-based regularized regression
- Optimal rates for the regularized least-squares algorithm
- Optimality of robust online learning
- Optimally tackling covariate shift in RKHS-based nonparametric regression
- Regularization in kernel learning
- Robust Stochastic Approximation Approach to Stochastic Programming
- The covering number in learning theory
- Theory of Reproducing Kernels
This page was built for publication: Online learning algorithms tackling covariate shift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6872916)
