Automated Machine Learning for Unsupervised Tabular Tasks

Prabhant Singh, Pieter Gijsbers, Elif Ceren Gok Yildirim, Murat Onur Yildirim, Joaquin Vanschoren
10/8/2025
cs.LG

No confident code implementation found for this paper.

Abstract

In this work, we present LOTUS (Learning to Learn with Optimal Transport for Unsupervised Scenarios), a simple yet effective method to perform model selection for multiple unsupervised machine learning(ML) tasks such as outlier detection and clustering. Our intuition behind this work is that a machine learning pipeline will perform well in a new dataset if it previously worked well on datasets with a similar underlying data distribution. We use Optimal Transport distances to find this similarity between unlabeled tabular datasets and recommend machine learning pipelines with one unified single method on two downstream unsupervised tasks: outlier detection and clustering. We present the effectiveness of our approach with experiments against strong baselines and show that LOTUS is a very promising first step toward model selection for multiple unsupervised ML tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{singh2025automated,
  title  = {Automated Machine Learning for Unsupervised Tabular Tasks},
  author = {Prabhant Singh and Pieter Gijsbers and Elif Ceren Gok Yildirim and Murat Onur Yildirim and Joaquin Vanschoren},
  year   = {2025},
  eprint = {2510.07569},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.07569v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.07569.svg)](https://codeofpaper.com/paper/2510.07569)

Discussion