Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning

DOI10.1007/s10994-018-5734-0zbMath1483.68326OpenAlexW2810117441WikidataQ129619396 ScholiaQ129619396MaRDI QIDQ669277

Han-Jia Ye, Yuan Jiang, De-Chuan Zhan

Publication date: 15 March 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-018-5734-0

zbMATH Keywords

distance metric learningexcess riskgeneralization analysis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Self-supervised Metric Learning in Multi-View Data: A Downstream Task Perspective

Uses Software

• LMNN
• GSML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Generalization bounds for metric and similarity learning
• Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD)
• Learning a distance metric from relative comparisons between quadruplets of images
• Ranking and empirical minimization of \(U\)-statistics
• Local Rademacher complexities
• Metric Learning: A Survey
• 10.1162/153244302760200704
• 10.1162/1532443041424300
• 10.1162/153244303321897690
• Metric Learning
• Guaranteed Classification via Regularized Similarity Learning
• Understanding Machine Learning

This page was built for publication: Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning