Metraipolis › archive › dc_2301bb686906
Efficient Pairwise Difference Learning: A Comparative Study of Encoding Strategies and Training Pair Selection — arXiv:2610.21644
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21644
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T09:28:31.826Z
- SHA-256 of the archived text
7f8d4cb3f034b5568352bc8a887d38fbc41da48d7870bde8fca1f0f2010496a3- Stable URL of this page
https://metraipolis.com/documento/dc_2301bb686906
How to cite
Efficient Pairwise Difference Learning: A Comparative Study of Encoding Strategies and Training Pair Selection — arXiv:2610.21644 — arXiv (en), https://arxiv.org/abs/2610.21644 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2301bb686906 (Metraipolis archive dc_2301bb686906, sha256 7f8d4cb3f034b5568352bc8a887d38fbc41da48d7870bde8fca1f0f2010496a3)
BibTeX
@misc{dc2301bb686906,
title = {Efficient Pairwise Difference Learning: A Comparative Study of Encoding Strategies and Training Pair Selection — arXiv:2610.21644},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21644},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2301bb686906; sha256 7f8d4cb3f034b5568352bc8a887d38fbc41da48d7870bde8fca1f0f2010496a3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21644. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Pairwise Difference Learning for Classification (PDC) enhances supervised learning in low-data regimes by training a binary similarity classifier on pairs of instances rather than individual samples, effectively inflating the training set from $n$ to $O(n^2)$ examples. However, the PDC framework leaves critical implementation choices underspecified, particularly regarding input representation and pair selection strategies. This work systematically investigates these design decisions through extensive empirical evaluation. We compare four feature encoders (paired features, triplet with relative difference, absolute difference, and a novel triplet with absolute difference) alongside four pair selection strategies ranging from exhaustive to kernel-thinning-based schemes. Experiments across nearly 200 benchmark classification datasets using Decision Tree, Multilayer Perceptron, Gaussian Naive Bayes, and Support Vector Classifier as base models reveal that the proposed triplet with absolute difference encoder ($\phi_{\mathrm{3dabs}}$) achieves the highest average F1 scores. More notably, restricting training to upper-triangle pairs reduces computational time by approximately 40% with negligible accuracy loss. Kernel thinning-based selection provided no accuracy benefits while substantially increasing computational overhead. Overall, PDC configurations outperformed base models in 94% of tested cases, though no single configuration dominated universally, suggesting dataset-specific optimization remains an open challenge.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.21644 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:44:17.980Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).