Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
From MaRDI portal
Publication:4968723
DOI10.1142/S021953051850029XzbMath1416.68145OpenAlexW2900243757MaRDI QIDQ4968723
No author found.
Publication date: 9 July 2019
Published in: Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021953051850029x
rankingsupervised learningkernel methodsregressionbig datageneral source conditionsNyström subsampling
General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (7)
Distributed spectral pairwise ranking algorithms ⋮ Regularized Nyström Subsampling in Covariate Shift Domain Adaptation Problems ⋮ Kernel conjugate gradient methods with random projections ⋮ Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces ⋮ Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions ⋮ A statistical learning assessment of Huber regression ⋮ Analysis of regularized Nyström subsampling for regression functions of low smoothness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 regularization algorithms in learning theory
- On the regularization of projection methods for solving ill-posed problems
- A linear functional strategy for regularized ranking
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- Adaptive kernel methods using the balancing principle
- Learning sets with separating kernels
- Optimal rates for the regularized least-squares algorithm
- Learning theory estimates via integral operators and their approximations
- 10.1162/153244302760185252
- Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates
- CROSS-VALIDATION BASED ADAPTATION FOR REGULARIZATION OPERATORS IN LEARNING THEORY
- Geometry of linear ill-posed problems in variable Hilbert scales
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Nyström type subsampling analyzed as a regularized projection
- Learning theory of distributed spectral algorithms
- Learning rates for regularized least squares ranking algorithm
- Online Pairwise Learning Algorithms
- How general are general source conditions?
- Aggregation of regularized solutions from multiple observation models
- Theory of Reproducing Kernels
- On the convergence rate and some applications of regularized ranking algorithms
This page was built for publication: Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
