Learning rate of magnitude-preserving regularization ranking with dependent samples

DOI10.1142/S0219691316500016MaRDI QIDQ2800842zbMATH OpenFDO

Authors Hong Chen

Publication date 18 April 2016

Published in International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)

zbMATH Keywords

learning ratedependent samplesmagnitude-preserving regularization ranking

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The convergence rate of a regularized ranking algorithm
• Learning rates for regularized least squares ranking algorithm
• On ranking and generalization bounds
• Debiased magnitude-preserving ranking: learning rate and bias characterization
• Generalization bounds for ranking algorithms via algorithmic stability

Cites work

• An Alternative Ranking Problem for Search Engines
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Extreme learning machine for ranking: generalization analysis and applications
• Generalization bounds for ranking algorithms via algorithmic stability
• Learning Theory
• Learning and generalisation. With applications to neural networks.
• Learning theory approach to minimum error entropy criterion
• ONLINE LEARNING WITH MARKOV SAMPLING
• On ranking and generalization bounds

Cited in

(4)

• Convergence rate of SVM for kernel-based robust regression
• Calibration and regret bounds for order-preserving surrogate losses in learning to rank
• Learning rates for regularized least squares ranking algorithm
• Debiased magnitude-preserving ranking: learning rate and bias characterization

This page was built for publication: Learning rate of magnitude-preserving regularization ranking with dependent samples

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