Error analysis of kernel regularized pairwise learning with a strongly convex loss
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7295804
- On the robustness of regularized pairwise learning methods based on kernels
- Convergence of online pairwise regression learning with quadratic loss
- Error analysis of the kernel regularized regression based on refined convex losses and RKBSs
- Online pairwise learning algorithms with convex loss functions
Cites work
- Behavior of a functional in learning theory
- Bouligand derivatives and robustness of support vector machines for regression
- Coefficient-based regularization network with variance loss for error
- Consistency analysis of an empirical minimum error entropy algorithm
- Convergence analysis of distributed multi-penalty regularized pairwise learning
- Convergence of online pairwise regression learning with quadratic loss
- Convex analysis and monotone operator theory in Hilbert spaces
- Deep distributed convolutional neural networks: universality
- Distance metric learning for large margin nearest neighbor classification
- Distance metric learning with eigenvalue optimization
- Error analysis on regularized regression based on the maximum correntropy criterion
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Generalization bounds for metric and similarity learning
- Generalization bounds for ranking algorithms via algorithmic stability
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 5957287 (Why is no real title available?)
- Kernel gradient descent algorithm for information theoretic learning
- Learning rates for least square regressions with coefficient regularization
- Learning rates for regularized least squares ranking algorithm
- Learning rates for the kernel regularized regression with a differentiable strongly convex loss
- Learning sets with separating kernels
- Learning Theory
- Multi-kernel regularized classifiers
- On ranking and generalization bounds
- On the convergence rate and some applications of regularized ranking algorithms
- On the robustness of regularized pairwise learning methods based on kernels
- Online minimum error entropy algorithm with unbounded sampling
- Online Pairwise Learning Algorithms
- Online regularized learning with pairwise loss functions
- Online regularized pairwise learning with least squares loss
- Pairwise support vector machines and their application to large scale problems
- Precise asymptotics of U-statistics
- Probability Inequalities for Sums of Bounded Random Variables
- Ranking and empirical minimization of \(U\)-statistics
- Regularization schemes for minimum error entropy principle
- Regularized least square regression with spherical polynomial kernels
- Regularized ranking with convex losses and \(\ell^1\)-penalty
- Robust kernel-based distribution regression
- Semi-supervised learning for regression based on the diffusion matrix
- Stochastic proximal AUC maximization
- The convergence rate of a regularized ranking algorithm
- The learning rate of \(l_2\)-coefficient regularized classification with strong loss
- Theory of deep convolutional neural networks. III: Approximating radial functions
- Theory of deep convolutional neural networks: downsampling
- Universality of deep convolutional neural networks
Cited in
(4)
This page was built for publication: Error analysis of kernel regularized pairwise learning with a strongly convex loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6112862)
