Regularized Nyström Subsampling in Covariate Shift Domain Adaptation Problems
From MaRDI portal
Cites work
- A least-squares approach to direct importance estimation
- An Introduction to Artificial Intelligence Based on Reproducing Kernel Hilbert Spaces
- Analysis of regularized Nyström subsampling for regression functions of low smoothness
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- Distributed learning with regularized least squares
- Geometry of linear ill-posed problems in variable Hilbert scales
- scientific article; zbMATH DE number 3954180 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Improving predictive inference under covariate shift by weighting the log-likelihood function
- Input-dependent estimation of generalization error under covariate shift
- Learning from examples as an inverse problem
- MODULI OF CONTINUITY FOR OPERATOR VALUED FUNCTIONS
- Nyström type subsampling analyzed as a regularized projection
- On a regularization of unsupervised domain adaptation in RKHS
- On the convergence rate and some applications of regularized ranking algorithms
- On the regularization of projection methods for solving ill-posed problems
- Perturbation theory for linear operators.
- Regularization theory for ill-posed problems. Selected topics
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory
- The convergence rate of a regularized ranking algorithm
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Regularized Nyström Subsampling in Covariate Shift Domain Adaptation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130664)
