Generalization bounds for metric and similarity learning

DOI10.1007/s10994-015-5499-7zbMath1345.68250arXiv1207.5437OpenAlexW1490654344MaRDI QIDQ255367

Qiong Cao, Zheng-Chu Guo, Yiming Ying

Publication date: 9 March 2016

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

Full work available at URL: https://arxiv.org/abs/1207.5437

zbMATH Keywords

Rademacher complexitygeneralization boundmetric learningsimilarity learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (15)

Online regularized learning with pairwise loss functions ⋮ Online regularized pairwise learning with non-i.i.d. observations ⋮ A fast diagonal distance metric learning approach for large-scale datasets ⋮ Convergence of online pairwise regression learning with quadratic loss ⋮ Error analysis of kernel regularized pairwise learning with a strongly convex loss ⋮ Self-supervised Metric Learning in Multi-View Data: A Downstream Task Perspective ⋮ On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm ⋮ Guaranteed Classification via Regularized Similarity Learning ⋮ Online Pairwise Learning Algorithms ⋮ Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning ⋮ Generalization ability of online pairwise support vector machine ⋮ Online pairwise learning algorithms with convex loss functions ⋮ Online regularized pairwise learning with least squares loss ⋮ Convergence analysis of distributed multi-penalty regularized pairwise learning ⋮ Uniform consistency and uniform in number of neighbors consistency for nonparametric regression estimates and conditional \(U\)-statistics involving functional data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Empirical margin distributions and bounding the generalization error of combined classifiers
• Ranking and empirical minimization of \(U\)-statistics
• Rademacher Chaos Complexities for Learning the Kernel Problem
• 10.1162/153244302760200704
• 10.1162/153244303321897690

This page was built for publication: Generalization bounds for metric and similarity learning