Online regularized learning with pairwise loss functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- 10.1162/153244303321897690
- 10.1162/1532443041424300
- Analysis of support vector machine classification
- Consistency analysis of an empirical minimum error entropy algorithm
- Distance metric learning with eigenvalue optimization
- Estimation of gradients and coordinate covariation in classification
- Generalization bounds for metric and similarity learning
- Generalization bounds for ranking algorithms via algorithmic stability
- Good edit similarity learning by loss minimization
- Guaranteed Classification via Regularized Similarity Learning
- Improved Risk Tail Bounds for On-Line Algorithms
- Large scale online learning of image similarity through ranking
- Learning Theory
- Learning coordinate covariances via gradients
- Local Rademacher complexities
- On ranking and generalization bounds
- Online Regularized Classification Algorithms
- Online gradient descent learning algorithms
- Online learning algorithms
- Optimum bounds for the distributions of martingales in Banach spaces
- Random sampling with a reservoir
- Ranking and empirical minimization of \(U\)-statistics
- Regularization schemes for minimum error entropy principle
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support Vector Machines
- Theory of Reproducing Kernels
Cited in
(17)- Online pairwise learning algorithms with convex loss functions
- Generalization ability of online pairwise support vector machine
- Convergence of online mirror descent
- Fast and strong convergence of online learning algorithms
- Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ Regularization
- Learning Theory
- scientific article; zbMATH DE number 5957493 (Why is no real title available?)
- Convergence of online pairwise regression learning with quadratic loss
- Online regularized pairwise learning with least squares loss
- Convergence analysis of online learning algorithm with two-stage step size
- Online regularized learning algorithm for functional data
- Online manifold regularization by dual ascending procedure
- Online Pairwise Learning Algorithms
- Error analysis of kernel regularized pairwise learning with a strongly convex loss
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- Unregularized online learning algorithms with general loss functions
- Online regularized pairwise learning with non-i.i.d. observations
This page was built for publication: Online regularized learning with pairwise loss functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361154)
