Generalization bounds for ranking algorithms via algorithmic stability
From MaRDI portal
(Redirected from Publication:2880888)
Recommendations
Cited in
(48)- Online pairwise learning algorithms with convex loss functions
- Online regularized learning with pairwise loss functions
- Extreme learning machine for ranking: generalization analysis and applications
- Generalization ability of online pairwise support vector machine
- Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking
- One-pass AUC optimization
- Randomized smoothing variance reduction method for large-scale non-smooth convex optimization
- Row and column generation algorithm for maximization of minimum margin for ranking problems
- Analysis of regularized least squares ranking with centered reproducing kernel
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Stability analysis of learning algorithms for ontology similarity computation
- On extension theorems and their connection to universal consistency in machine learning
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
- Supervised multidimensional scaling for visualization, classification, and bipartite ranking
- Convergence analysis of distributed multi-penalty regularized pairwise learning
- An exponential Efron-Stein inequality for L_q stable learning rules
- A linear functional strategy for regularized ranking
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Bias corrected regularization kernel method in ranking
- On the robustness of regularized pairwise learning methods based on kernels
- Learning rate of magnitude-preserving regularization ranking with dependent samples
- Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions
- Convergence of online pairwise regression learning with quadratic loss
- Generalization Bounds for Some Ordinal Regression Algorithms
- Stability and optimization error of stochastic gradient descent for pairwise learning
- Online regularized pairwise learning with least squares loss
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- The convergence rate of a regularized ranking algorithm
- Learning rates for regularized least squares ranking algorithm
- Online Pairwise Learning Algorithms
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- The performance of semi-supervised Laplacian regularized regression with the least square loss
- Generalization performance of bipartite ranking algorithms with convex losses
- Debiased magnitude-preserving ranking: learning rate and bias characterization
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- On the convergence rate and some applications of regularized ranking algorithms
- Unregularized online learning algorithms with general loss functions
- Strong and weak stability of k-partite ranking algorithms
- Analysis of convergence performance of neural networks ranking algorithm
- Online regularized pairwise learning with non-i.i.d. observations
- Learning Theory
- On ranking and generalization bounds
- The \(\mathrm{r}\)-\(\mathrm{d}\) class predictions in linear mixed models
- Distributed spectral pairwise ranking algorithms
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
- Robust pairwise learning with Huber loss
- Optimality of regularized least squares ranking with imperfect kernels
- Learning to rank on graphs
This page was built for publication: Generalization bounds for ranking algorithms via algorithmic stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880888)
