4.6 Article

On the Decomposition of Covariate Shift Assumption for the Set-to-Set Matching

Journal

IEEE ACCESS
Volume 11, Issue -, Pages 120728-120740

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2023.3324044

Keywords

Set-to-set matching; permutation-invariant; machine learning; distribution shift; covariate shift

Ask authors/readers for more resources

This study refines and redefines the covariate shift assumption in set matching and analyzes the performance of models under these conditions.
The task of set matching, which models the quality of matching between pairs of sets, is expected to have a wide range of practical applications. However, many existing methods that address this task assume that the training and testing distributions are identical, which is frequently violated in real-world scenarios. To address this issue, the covariate shift assumption focuses on the shift in the distribution of covariates between the training and testing datasets. While several studies have analyzed this assumption for vector inputs, there is a lack of research on similar assumptions when the input is a pair of sets. In this study, we refine and redefine the covariate shift assumption in set matching and analyze how models perform under these conditions.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available