Regularized Nyström Subsampling in Covariate Shift Domain Adaptation Problems
From MaRDI portal
Publication:6130664
DOI10.1080/01630563.2024.2318572OpenAlexW4392132006MaRDI QIDQ6130664
Unnamed Author, Sergei G. Solodky
Publication date: 3 April 2024
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2024.2318572
computational complexityregularizationRadon-Nikodym derivativebig datasource conditionunsupervised domain adaptationNyström subsampling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regularization theory for ill-posed problems. Selected topics
- The convergence rate of a regularized ranking algorithm
- On the regularization of projection methods for solving ill-posed problems
- Improving predictive inference under covariate shift by weighting the log-likelihood function
- Perturbation theory for linear operators.
- On a regularization of unsupervised domain adaptation in RKHS
- Input-dependent estimation of generalization error under covariate shift
- Geometry of linear ill-posed problems in variable Hilbert scales
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- MODULI OF CONTINUITY FOR OPERATOR VALUED FUNCTIONS
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- An Introduction to Artificial Intelligence Based on Reproducing Kernel Hilbert Spaces
- Analysis of regularized Nyström subsampling for regression functions of low smoothness
- Nyström type subsampling analyzed as a regularized projection
- The elements of statistical learning. Data mining, inference, and prediction
- Some properties of Gaussian reproducing kernel Hilbert spaces and their implications for function approximation and learning theory
- On the convergence rate and some applications of regularized ranking algorithms
