.png){kind=icon}
返回
Robustness and generalization for metric learning
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2014.09.044.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Metric learning has attracted a lot of interest over the last decade, but the generalization ability of such methods has not been thoroughly studied. In this paper, we introduce an adaptation of the notion of algorithmic robustness (previously introduced by Xu and Mannor) that can be used to derive generalization bounds for metric learning. We further show that a weak notion of robustness is in fact a necessary and sufficient condition for a metric learning algorithm to generalize. To illustrate the applicability of the proposed framework, we derive generalization results for a large family of existing metric learning algorithms, including some sparse formulations that are not covered by the previous results. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Metric learning
Algorithmic robustness
Generalization bounds
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
分享收藏Cost-Effective and Humid Air-Stable Fluoride Solid Electrolyte with High Ionic Conductivity Induced by Microstructural Modulation低成本且在湿空气下稳定的氟化物固体电解质，其离子电导率通过微观结构调控得以提高
PREAI
分享收藏
查看更多内容