Generalization analysis of multi-modal metric learning

DOI10.1142/S0219530515500104zbMATH Open1338.68235OpenAlexW2112473543MaRDI QIDQ2809235FDOQ2809235

Authors: Yunwen Lei, Yiming Ying 

Publication date: 27 May 2016

Published in: Analysis and Applications (Singapore) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219530515500104

Recommendations

• Generalization bounds for metric and similarity learning
• Rademacher Chaos Complexities for Learning the Kernel Problem
• Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning
• Guaranteed Classification via Regularized Similarity Learning
• Rademacher complexity bounds for a penalized multi-class semi-supervised algorithm

zbMATH Keywords

regularizationmetric learningRademacher complexitymulti-modal datageneralization bounds

Mathematics Subject Classification ID

General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 10.1162/153244303321897690
• Learning multi-modal similarity
• Regularization techniques for learning with matrices

Cited In (5)

• Generalization bounds for metric and similarity learning
• Generalization bottleneck in deep metric learning
• Structural, Syntactic, and Statistical Pattern Recognition
• Metric-guided multi-task learning
• Robust pairwise learning with Huber loss

This page was built for publication: Generalization analysis of multi-modal metric learning

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