arXiv — Machine Learning · · 3 min read

K-IPO: Kendall-constrained Importance Preserving Oversampling for Imbalanced Tabular Data

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2607.16478 (cs)
[Submitted on 17 Jul 2026]

Title:K-IPO: Kendall-constrained Importance Preserving Oversampling for Imbalanced Tabular Data

View a PDF of the paper titled K-IPO: Kendall-constrained Importance Preserving Oversampling for Imbalanced Tabular Data, by Marios Tyrovolas and Argiris Sofotasios and Dimitris Metaxakis and Georgios Mermigkis and George Georgoulas and Panagiotis Hadjidoukas and Chrysostomos Stylios
View PDF HTML (experimental)
Abstract:Oversampling is widely used to address class imbalance in tabular classification, but existing methods can distort the feature importance ranking underlying model explanations. Although recent studies have quantified this distortion by comparing real and synthetic data, none have actively sought to prevent it. In this paper, we introduce Kendall-constrained Importance-Preserving Oversampling (K-IPO), a generator-agnostic, "generate-then-select" framework that preserves the original data's feature importance ranking during augmentation. K-IPO iteratively generates minority-class candidates and accepts them only if their inclusion maintains a user-defined minimum Kendall's tau ({\tau}) correlation with the reference ranking. Optionally, stricter constraints can be applied to the highest-ranked features. We evaluated K-IPO on 20 imbalanced binary classification datasets using three classifiers and multiple explanation methods. In most cases, K-IPO achieved the best or tied-best results in feature importance preservation, explanation consistency, and class separability. It also generally improved predictive performance while maintaining competitive computational overhead.
Comments: 24 pages, 5 figures, 9 tables
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as: arXiv:2607.16478 [cs.LG]
  (or arXiv:2607.16478v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2607.16478
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Marios Tyrovolas [view email]
[v1] Fri, 17 Jul 2026 19:52:55 UTC (391 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled K-IPO: Kendall-constrained Importance Preserving Oversampling for Imbalanced Tabular Data, by Marios Tyrovolas and Argiris Sofotasios and Dimitris Metaxakis and Georgios Mermigkis and George Georgoulas and Panagiotis Hadjidoukas and Chrysostomos Stylios
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning