Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
From MaRDI portal
(Redirected from Publication:669277)
Recommendations
- Generalization bounds for metric and similarity learning
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD)
- Sparse distance metric learning
- Metric learning: a survey
- Supervised distance metric learning through maximization of the Jeffrey divergence
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- 10.1162/153244302760200704
- 10.1162/153244303321897690
- 10.1162/1532443041424300
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Distance metric learning for large margin nearest neighbor classification
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD)
- Generalization bounds for metric and similarity learning
- Generalization bounds for ranking algorithms via algorithmic stability
- Guaranteed Classification via Regularized Similarity Learning
- Large scale online learning of image similarity through ranking
- Learning a distance metric from relative comparisons between quadruplets of images
- Local Rademacher complexities
- Metric Learning
- Metric learning: a survey
- On ranking and generalization bounds
- Ranking and empirical minimization of \(U\)-statistics
- Understanding machine learning. From theory to algorithms
Cited in
(6)- Generalization bounds for metric and similarity learning
- Generalization bottleneck in deep metric learning
- Self-supervised Metric Learning in Multi-View Data: A Downstream Task Perspective
- Generalization analysis of multi-modal metric learning
- A multi-birth metric learning framework based on binary constraints
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD)
This page was built for publication: Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669277)
