Generalization Bound For Kernel Similarity Learning

Abstract

Similarity learning has received a large amount of interest and is an important tool for many scientific and industrial applications. In this framework, we wish to infer the distance (similarity) between points with respect to an arbitrary distance function \(d\). Here, we formulate the problem as a regression from a feature space \(\mathcal\{X\}\) to an arbitrary vector space \(\mathcal\{Y\}\), where the Euclidean distance is proportional to \(d\). We then give Rademacher complexity bounds on the generalization error. We find that with high probability, the complexity is bounded by the maximum of the radius of \(\mathcal\{X\}\) and the radius of \(\mathcal\{Y\}\).

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyrabadi2016generalization

Related papers

• Escaping The Curse Of Dimensionality In Similarity Learning: Efficient Frank-wolfe Algorithm And Generalization Bounds (2018)9.41
• Discriminative Learning Of Similarity And Group Equivariant Representations (2018)0.00
• Similarity Learning Via Kernel Preserving Embedding (2019)10.35
• Super-sparse Learning In Similarity Spaces (2017)5.24
• A New Similarity Space Tailored For Supervised Deep Metric Learning (2020)3.58
• Kernel Density Estimation Through Density Constrained Near Neighbor Search (2020)5.84
• Neural Bregman Divergences For Distance Learning (2022)0.00
• Generalization Analysis With Deep Relu Networks For Metric And Similarity Learning (2024)0.00