REVIEW 5 cited by
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
WDC Products: A Multi-Dimensional Entity Matching Benchmark
read the original abstract
The difficulty of an entity matching task depends on a combination of multiple factors such as the amount of corner-case pairs, the fraction of entities in the test set that have not been seen during training, and the size of the development set. Current entity matching benchmarks usually represent single points in the space along such dimensions or they provide for the evaluation of matching methods along a single dimension, for instance the amount of training data. This paper presents WDC Products, an entity matching benchmark which provides for the systematic evaluation of matching systems along combinations of three dimensions while relying on real-world data. The three dimensions are (i) amount of corner-cases (ii) generalization to unseen entities, and (iii) development set size (training set plus validation set). Generalization to unseen entities is a dimension not covered by any of the existing English-language benchmarks yet but is crucial for evaluating the robustness of entity matching systems. Instead of learning how to match entity pairs, entity matching can also be formulated as a multi-class classification task that requires the matcher to recognize individual entities. WDC Products is the first benchmark that provides a pair-wise and a multi-class formulation of the same tasks. We evaluate WDC Products using several state-of-the-art matching systems, including Ditto, HierGAT, and R-SupCon. The evaluation shows that all matching systems struggle with unseen entities to varying degrees. It also shows that for entity matching contrastive learning is more training data efficient compared to cross-encoders.
Forward citations
Cited by 5 Pith papers
-
Entity Resolution via Batched Oracle Queries
Formalizes batched entity resolution with an NP-hardness proof for optimal batch selection, gives an optimal algorithm under a condition on entity sizes, and reports superior recall over baselines on six datasets.
-
Learning to Refine Hidden States for Reliable LLM Reasoning
ReLAR is a latent refinement framework that trains depth and action controllers with policy gradient on likelihood improvement to adaptively update LLM hidden states for better reasoning.
-
Learning to Refine Hidden States for Reliable LLM Reasoning
ReLAR uses reinforcement-guided latent refinement with adaptive controllers to improve LLM reasoning accuracy and stability at lower inference cost than explicit reasoning methods.
-
Understanding Domain-Aware Distribution Alignment in Budgeted Entity Matching
The paper runs experiments on the existing BEACON framework to analyze effects of algorithmic variations and data constraints on domain-aware entity matching performance.
-
Understanding Domain-Aware Distribution Alignment in Budgeted Entity Matching
Experiments evaluate how algorithmic variations and data constraints affect the BEACON framework for budgeted domain-aware entity matching.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.