Distributed spectral pairwise ranking algorithms
From MaRDI portal
Recommendations
Cites work
- 10.1162/1532443041827916
- A linear functional strategy for regularized ranking
- An efficient algorithm for learning to rank from preference graphs
- Balancing principle in supervised learning for a general regularization scheme
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Distributed learning with multi-penalty regularization
- Distributed learning with regularized least squares
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Fast and strong convergence of online learning algorithms
- Generalization bounds for ranking algorithms via algorithmic stability
- How general are general source conditions?
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3293383 (Why is no real title available?)
- Learning rates for regularized least squares ranking algorithm
- Learning Theory
- Learning theory estimates via integral operators and their approximations
- Learning theory of distributed regression with bias corrected regularization kernel network
- Learning theory of distributed spectral algorithms
- MODULI OF CONTINUITY FOR OPERATOR VALUED FUNCTIONS
- Norm Inequalities Equivalent to Heinz Inequality
- On ranking and generalization bounds
- On regularization algorithms in learning theory
- On the convergence rate and some applications of regularized ranking algorithms
- Online Pairwise Learning Algorithms
- Optimal learning rates for distribution regression
- Optimal rates for regularization of statistical inverse learning problems
- Optimal rates for the regularized least-squares algorithm
- Parallelizing spectrally regularized kernel algorithms
- Ranking and empirical minimization of \(U\)-statistics
- Regularization theory for ill-posed problems. Selected topics
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Spectral Algorithms for Supervised Learning
- Support Vector Machines
- The convergence rate of a regularized ranking algorithm
- Theory of Reproducing Kernels
Cited in
(7)- Spectral ranking using seriation
- Distributed user profiling via spectral methods
- scientific article; zbMATH DE number 6961717 (Why is no real title available?)
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- Spectral algorithms for functional linear regression
- Nyström subsampling for functional linear regression
- Online outcome weighted learning with general loss functions
This page was built for publication: Distributed spectral pairwise ranking algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060714)
