Generalization bottleneck in deep metric learning

DOI10.1016/J.INS.2021.09.023MaRDI QIDQ6139453zbMATH OpenOpenAlexFDO

Authors Zhanxuan Hu, Danyang Wu, Feiping Nie, Rong Wang

Publication date 19 January 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2021.09.023

zbMATH Keywords

metric learningimage retrievalfeature learninglow-dimensional embedding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Artificial neural networks and deep learning (68T07) Computational aspects of data analysis and big data (68T09) Computational learning theory (68Q32) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

Recommendations

• Generalization bounds for metric and similarity learning
• Generalization analysis of multi-modal metric learning
• Deep metric learning using triplet network
• Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
• Distance metric learning by knowledge embedding

Cites work

• A nearest-neighbor search model for distance metric learning

This page was built for publication: Generalization bottleneck in deep metric learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139453)