Generalization Bounds for Set-to-Set Matching with Negative Sampling

02/25/2023
by   Masanari Kimura, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/03/2022

Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm

Given two sets A=a_1,a_2,...,a_s and b_1,b_2,...,b_t, a many-to-many mat...
research
06/03/2022

Erdős Matching Conjecture for almost perfect matchings

In 1965 Erdős asked, what is the largest size of a family of k-elements ...
research
04/20/2020

Dynamic Matching Algorithms in Practice

In recent years, significant advances have been made in the design and a...
research
10/22/2019

Deep Set-to-Set Matching and Learning

Matching two sets of items, called set-to-set matching problem, is being...
research
04/22/2018

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts

Online matching problems have garnered significant attention in recent y...
research
01/07/2019

Bloom Multifilters for Multiple Set Matching

Bloom filter is a space-efficient probabilistic data structure for check...
research
05/06/2022

HumanAL: Calibrating Human Matching Beyond a Single Task

This work offers a novel view on the use of human input as labels, ackno...

Please sign up or login with your details

Forgot password? Click here to reset