Bias corrected regularization kernel method in ranking

DOI10.1142/S0219530518500161zbMATH Open1442.68195OpenAlexW2883974910MaRDI QIDQ4615656FDOQ4615656

Fangchao He, Qiang Wu

Publication date: 29 January 2019

Published in: Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219530518500161

zbMATH Keywords

regularizationrankingbias correctionintegral operatorkernel method

Mathematics Subject Classification ID

General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
• Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models
• Theory of Reproducing Kernels
• Statistical significance in high-dimensional linear models
• Title not available (Why is that?)
• Ranking and empirical minimization of \(U\)-statistics
• Title not available (Why is that?)
• Generalization bounds for ranking algorithms via algorithmic stability
• Title not available (Why is that?)
• Shannon sampling. II: Connections to learning theory
• Learning theory estimates via integral operators and their approximations
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• On regularization algorithms in learning theory
• Application of integral operator for regularized least-square regression
• Title not available (Why is that?)
• Indefinite kernel network with dependent sampling
• Concentration inequalities for random fields via coupling
• Title not available (Why is that?)
• Error bounds for learning the kernel
• The convergence rate of a regularized ranking algorithm
• Generalization performance of bipartite ranking algorithms with convex losses
• Title not available (Why is that?)
• Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization
• Deep distributed convolutional neural networks: Universality
• Title not available (Why is that?)
• Learning rates for regularized least squares ranking algorithm
• Title not available (Why is that?)
• On the convergence rate and some applications of regularized ranking algorithms
• Regularization networks with indefinite kernels

Cited In (3)

• Analysis of regularized least squares ranking with centered reproducing kernel
• Debiased magnitude-preserving ranking: learning rate and bias characterization
• Optimality of regularized least squares ranking with imperfect kernels

This page was built for publication: Bias corrected regularization kernel method in ranking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615656)