On the convergence rate and some applications of regularized ranking algorithms
DOI10.1016/J.JCO.2015.09.004zbMATH Open1333.65012OpenAlexW2221340659MaRDI QIDQ5963450FDOQ5963450
Authors: Galyna Kriukova, Sergei V. Pereverzyev, Pavlo Tkachenko 
Publication date: 19 February 2016
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2015.09.004
Recommendations
Applications of statistics to biology and medical sciences; meta analysis (62P10) Medical applications (general) (92C50) Statistical ranking and selection procedures (62F07) General biostatistics (92B15)
Cites Work
- Learning Theory
- Support Vector Machines
- Title not available (Why is that?)
- On the influence of the kernel on the consistency of support vector machines
- Regularization theory for ill-posed problems. Selected topics
- Geometry of linear ill-posed problems in variable Hilbert scales
- Use of the regularization method in non-linear problems
- Generalization bounds for ranking algorithms via algorithmic stability
- 10.1162/1532443041827916
- Learning theory estimates via integral operators and their approximations
- On regularization algorithms in learning theory
- Learning coordinate covariances via gradients
- MODULI OF CONTINUITY FOR OPERATOR VALUED FUNCTIONS
- The convergence rate of a regularized ranking algorithm
- Extreme learning machine for ranking: generalization analysis and applications
- Title not available (Why is that?)
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- Subset Ranking Using Regression
Cited In (13)
- Analysis of regularized least squares ranking with centered reproducing kernel
- Ranking with a P-Norm Push
- 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
- 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
- Distributed spectral pairwise ranking algorithms
- Optimality of regularized least squares ranking with imperfect kernels
- Regularized Nyström Subsampling in Covariate Shift Domain Adaptation Problems
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)
