Analysis of convergence performance of neural networks ranking algorithm

DOI10.1016/J.NEUNET.2012.06.012MaRDI QIDQ1942699zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Yongquan Zhang, Feilong Cao

Publication date 13 March 2013

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2012.06.012

zbMATH Keywords

convergence ratecovering numberneural networksranking algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 6178473
• The convergence rate of a regularized ranking algorithm
• Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
• Learning rates for regularized least squares ranking algorithm
• On ranking and generalization bounds

Cites work

• 10.1162/1532443041827916
• A distribution-free theory of nonparametric regression
• A note on different covering numbers in learning theory.
• An Alternative Ranking Problem for Search Engines
• Analysis of the rate of convergence of least squares neural network regression estimates in case of measurement errors
• Approximation by Ridge functions and neural networks with one hidden layer
• Approximation by superposition of sigmoidal and radial basis functions
• Approximation by superpositions of a sigmoidal function
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Generalization bounds for ranking algorithms via algorithmic stability
• Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 3551712 (Why is no real title available?)
• scientific article; zbMATH DE number 1288298 (Why is no real title available?)
• Interpolation and rates of convergence for a class of neural networks
• Learning Theory
• Nonasymptotic bounds on the \(L_{2}\) error of neural network regression estimates
• On the mathematical foundations of learning
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Ranking and empirical minimization of \(U\)-statistics
• Simultaneous \(\mathbf L^p\)-approximation order for neural networks
• Subset Ranking Using Regression
• Universal approximation bounds for superpositions of a sigmoidal function

Cited in

(5)

• Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
• Extreme learning machine for ranking: generalization analysis and applications
• Generalization ability of fractional polynomial models
• Neural modelling of ranking data with an application to stated preference data
• Artificial neural networks with a signed-rank objective function and applications

This page was built for publication: Analysis of convergence performance of neural networks ranking algorithm

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