On the convergence rate and some applications of regularized ranking algorithms

DOI10.1016/J.JCO.2015.09.004MaRDI QIDQ5963450zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical examplesalgorithmrankingconvergence ratesource conditionblood glucose error grid

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Medical applications (general) (92C50) Statistical ranking and selection procedures (62F07) General biostatistics (92B15)

Recommendations

• The convergence rate of a regularized ranking algorithm
• Learning rates for regularized least squares ranking algorithm
• Regularized ranking with convex losses and \(\ell^1\)-penalty
• A linear functional strategy for regularized ranking
• Learning Theory

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)

• Analysis of regularized least squares ranking with centered reproducing kernel
• Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
• Debiased magnitude-preserving ranking: learning rate and bias characterization
• Pairwise learning problems with regularization networks and Nyström subsampling approach
• Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
• Convergence of online pairwise regression learning with quadratic loss
• Error analysis of kernel regularized pairwise learning with a strongly convex loss
• Learning rates for regularized least squares ranking algorithm
• A meta-learning approach to the regularized learning -- case study: blood glucose prediction
• Distributed spectral pairwise ranking algorithms
• Lavrentiev regularization method in rank learning
• The convergence rate of a regularized ranking algorithm
• A linear functional strategy for regularized ranking
• Ranking with a P-Norm Push
• Comparison theorems on large-margin learning
• Bias corrected regularization kernel method in ranking
• Regularized Nyström Subsampling in Covariate Shift Domain Adaptation Problems
• Regularized ranking with convex losses and \(\ell^1\)-penalty
• 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)