A linear functional strategy for regularized ranking
From MaRDI portal
Recommendations
- On the convergence rate and some applications of regularized ranking algorithms
- Regularized ranking with convex losses and \(\ell^1\)-penalty
- The convergence rate of a regularized ranking algorithm
- Learning rates for regularized least squares ranking algorithm
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
Cites work
- scientific article; zbMATH DE number 3974236 (Why is no real title available?)
- scientific article; zbMATH DE number 1288298 (Why is no real title available?)
- 10.1162/1532443041827916
- Adaptive estimation of linear functionals in Hilbert scales from indirect white noise observa\-tions
- Adaptive kernel methods using the balancing principle
- Advances in large-margin classifiers
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- Cross-validation based adaptation for regularization operators in learning theory
- Direct estimation of linear functionals from indirect noisy observations
- Generalization bounds for ranking algorithms via algorithmic stability
- Geometry of linear ill-posed problems in variable Hilbert scales
- How general are general source conditions?
- Learning coordinate covariances via gradients
- Learning the kernel function via regularization
- Learning theory estimates via integral operators and their approximations
- Local solutions to inverse problems in geodesy. The impact of the noise covariance structure upon the accuracy of estimation
- On regularization algorithms in learning theory
- Regularization theory for ill-posed problems. Selected topics
- Subset Ranking Using Regression
- The convergence rate of a regularized ranking algorithm
Cited in
(16)- Learning linear ranking functions for beam search with application to planning
- scientific article; zbMATH DE number 7370593 (Why is no real title available?)
- A new look at the automatic synthesis of linear ranking functions
- Manifold regularization based on Nyström type subsampling
- Levenberg-Marquardt multi-classification using hinge loss function
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Online regularized pairwise learning with least squares loss
- Fast rates of minimum error entropy with heavy-tailed noise
- Nyström type subsampling analyzed as a regularized projection
- scientific article; zbMATH DE number 1701751 (Why is no real title available?)
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- On the convergence rate and some applications of regularized ranking algorithms
- Multi-task learning via linear functional strategy
- On a regularization of unsupervised domain adaptation in RKHS
- The \(\mathrm{r}\)-\(\mathrm{d}\) class predictions in linear mixed models
- Distributed spectral pairwise ranking algorithms
This page was built for publication: A linear functional strategy for regularized ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1669294)
