2000 character limit reached
On the robustness of kernel-based pairwise learning (2010.15527v1)
Published 29 Oct 2020 in stat.ML and cs.LG
Abstract: It is shown that many results on the statistical robustness of kernel-based pairwise learning can be derived under basically no assumptions on the input and output spaces. In particular neither moment conditions on the conditional distribution of Y given X = x nor the boundedness of the output space is needed. We obtain results on the existence and boundedness of the influence function and show qualitative robustness of the kernel-based estimator. The present paper generalizes results by Christmann and Zhou (2016) by allowing the prediction function to take two arguments and can thus be applied in a variety of situations such as ranking.
Collections
Sign up for free to add this paper to one or more collections.