On the convergence rate and some applications of regularized ranking algorithms
From MaRDI portal
(Redirected from Publication:5963450)
Recommendations
Cites work
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 932412 (Why is no real title available?)
- 10.1162/1532443041827916
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- Extreme learning machine for ranking: generalization analysis and applications
- Generalization bounds for ranking algorithms via algorithmic stability
- Geometry of linear ill-posed problems in variable Hilbert scales
- Learning Theory
- Learning coordinate covariances via gradients
- Learning theory estimates via integral operators and their approximations
- MODULI OF CONTINUITY FOR OPERATOR VALUED FUNCTIONS
- On regularization algorithms in learning theory
- On the influence of the kernel on the consistency of support vector machines
- Regularization theory for ill-posed problems. Selected topics
- Subset Ranking Using Regression
- Support Vector Machines
- The convergence rate of a regularized ranking algorithm
- Use of the regularization method in non-linear problems
Cited in
(19)- Regularized Nyström Subsampling in Covariate Shift Domain Adaptation Problems
- Lavrentiev regularization method in rank learning
- Analysis of regularized least squares ranking with centered reproducing kernel
- Ranking with a P-Norm Push
- A linear functional strategy for regularized ranking
- Bias corrected regularization kernel method in ranking
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Comparison theorems on large-margin learning
- Convergence of online pairwise regression learning with quadratic loss
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- The convergence rate of a regularized ranking algorithm
- Learning rates for regularized least squares ranking algorithm
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- Debiased magnitude-preserving ranking: learning rate and bias characterization
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- A meta-learning approach to the regularized learning -- case study: blood glucose prediction
- Regularized ranking with convex losses and \(\ell^1\)-penalty
- Distributed spectral pairwise ranking algorithms
- Optimality of regularized least squares ranking with imperfect kernels
This page was built for publication: On the convergence rate and some applications of regularized ranking algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963450)
