Generalization Bounds for Set-to-Set Matching with Negative Sampling
It addresses a theoretical gap for researchers in machine learning, but it is incremental as it focuses on analysis rather than new methods or data.
The paper tackles the lack of theoretical analysis for set-to-set matching with neural networks by performing a generalization error analysis to reveal model behavior in this task.
The problem of matching two sets of multiple elements, namely set-to-set matching, has received a great deal of attention in recent years. In particular, it has been reported that good experimental results can be obtained by preparing a neural network as a matching function, especially in complex cases where, for example, each element of the set is an image. However, theoretical analysis of set-to-set matching with such black-box functions is lacking. This paper aims to perform a generalization error analysis in set-to-set matching to reveal the behavior of the model in that task.