mlsanityData to 14 Oct 2026

Pairwise Difference Learning for Classification

arXiv 2406.20031 ↗First posted 28 Jun 2024cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Pairwise difference learning (PDL) has recently been introduced as a new meta-learning technique for regression. Instead of learning a mapping from instances to outcomes in the standard way, the key idea is to learn a function that takes two instances as input and predicts the difference between the respective outcomes. Given a function of this kind, predictions for a query instance are derived from every training example and then averaged. This paper extends PDL toward the task of classification and proposes a meta-learning technique for inducing a PDL classifier by solving a suitably defined (binary) classification problem on a paired version of the original training data. We analyze the performance of the PDL classifier in a large-scale empirical study and find that it outperforms state-of-the-art methods in terms of prediction performance. Last but not least, we provide an easy-to-use and publicly available implementation of PDL in a Python package.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 28 Jun 2024.

Builds on

7 of 23 references.

References · 7

  1. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  2. 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 913
  3. 2017OpenML Benchmarking Suitescited by 178
  4. 2016Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Sciencecited by 75
  5. 2020Twin Neural Network Regressioncited by 6
  6. 2021Twin Neural Network Regression is a Semi-Supervised Regression Algorithmcited by 6
  7. 2023Optimizing Data Shapley Interaction Calculation from O(2^n) to O(t n^2) for KNN modelscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.