Learning rates for regularized least squares ranking algorithm
From MaRDI portal
(Redirected from Publication:5356934)
Recommendations
- Learning rates of least-square regularized regression
- The convergence rate of a regularized ranking algorithm
- Learning rate of support vector machine for ranking
- Learning rate of magnitude-preserving regularization ranking with dependent samples
- On the convergence rate and some applications of regularized ranking algorithms
- Lavrentiev regularization method in rank learning
- Learning-Related Complexity of Linear Ranking Functions
- Learning rates for least square regressions with coefficient regularization
- Optimal rate of the regularized regression learning algorithm
Cites work
- \(U\)-processes indexed by Vapnik-Červonenkis classes of functions with applications to asymptotics and bootstrap of \(U\)-statistics with estimated parameters
- 10.1162/1532443041827916
- An efficient algorithm for learning to rank from preference graphs
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Concentration estimates for learning with unbounded sampling
- Generalization bounds for ranking algorithms via algorithmic stability
- Learning rates of least-square regularized regression
- Learning Theory
- Learning Theory
- Learning Theory
- Learning theory approach to minimum error entropy criterion
- Learning with coefficient-based regularization and ^1-penalty
- Multi-kernel regularized classifiers
- On ranking and generalization bounds
- Probability Inequalities for Sums of Bounded Random Variables
- Ranking and empirical minimization of \(U\)-statistics
- The convergence rate of a regularized ranking algorithm
- The covering number in learning theory
- U-processes: Rates of convergence
Cited in
(37)- On kernel methods for covariates that are rankings
- A linear functional strategy for regularized ranking
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Analysis of convergence performance of neural networks ranking algorithm
- Robust pairwise learning with Huber loss
- Convergence of online pairwise regression learning with quadratic loss
- Quantitative convergence analysis of kernel based large-margin unified machines
- Kernel gradient descent algorithm for information theoretic learning
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Efficient regularized least-squares algorithms for conditional ranking on relational data
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
- Regularized ranking with convex losses and \(\ell^1\)-penalty
- Learning rate of magnitude-preserving regularization ranking with dependent samples
- Bias corrected regularization kernel method in ranking
- Learning rate of support vector machine for ranking
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Comparison theorems on large-margin learning
- Learning theory of minimum error entropy under weak moment conditions
- Distributed spectral pairwise ranking algorithms
- On the K-functional in learning theory
- Online regularized pairwise learning with least squares loss
- Convergence analysis of distributed multi-penalty regularized pairwise learning
- Semi-supervised learning with summary statistics
- Distributed learning with indefinite kernels
- Lavrentiev regularization method in rank learning
- Advances in Intelligent Data Analysis VI
- Optimal learning with Gaussians and correntropy loss
- On the convergence rate and some applications of regularized ranking algorithms
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- Optimality of regularized least squares ranking with imperfect kernels
- Moduli of smoothness, \(K\)-functionals and Jackson-type inequalities associated with Kernel function approximation in learning theory
- Analysis of regularized least squares ranking with centered reproducing kernel
- The convergence rate of a regularized ranking algorithm
- Robust learning of the modified Huber loss
- Debiased magnitude-preserving ranking: learning rate and bias characterization
This page was built for publication: Learning rates for regularized least squares ranking algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5356934)
