← Back to all news
arXiv Machine Learning By Tianqi Zhao, Guanyang Wang, Yan Shuo Tan, Qiong Zhang

TabClustPFN: A Prior-data Fitted Network for Tabular Data Clustering

Read the original on arXiv Machine Learning →

TabClustPFN is a Prior-data Fitted Network designed for clustering tabular data. It jointly addresses the lack of supervision, unknown cluster cardinality, and label switching by integrating a hybrid pretraining prior, a decoupled partition‑inference and cardinality‑inference architecture, and a permutation‑invariant SoftARI training objective. On a curated benchmark of 44 real‑world tabular datasets, it outperforms classical, deep, and amortized baselines while maintaining efficient runtime.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Jun 11

CRUMB: Efficient Prior Fitted Network Inference via Distributionally Matched Context Batching

arXiv:2606. 11473v1 Announce Type: cross Abstract: Prior-fitted networks (PFNs) are a promising class of tabular foundation models that perform in-context learning, whereby the entire labelled training set is supplied as context, and predictions for test queries are produced in a single forward pass.

By Jamie Heredge, Mattia J. Villani, Pranav Deshpande, Akshay Seshadri, Niraj Kumar
llmsbenchmarks
More like this →
arXiv Machine Learning
Oct 12

TabMF: Learning Dataset Representations with Tabular Foundation Models

TabMF is a framework that repurposes pretrained tabular foundation models (TFMs) as encoders for supervised datasets, adding a dataset-level readout and fine‑tuning via contrastive post‑training on synthetic views. The authors instantiate TabMF on TabICLv2 and TabPFN‑2.5 and evaluate the resulting representations on six tasks involving unseen real datasets. The approach achieves the best aggregate performance among both learned and classical dataset representations, excelling in dataset retrieval, compact benchmark construction, and distribution‑shift severity assessment.

By Rafiq Kamel, Nicolas Atienza, Aziz Fouch\'e, Nicola Cancedda, Josif Grabocka
benchmarks
More like this →
arXiv Machine Learning
Aug 28

ClusterAttention: A training-free speedup of bidirectional attention

ClusterAttention is a training‑free technique that speeds up bidirectional attention by recursively clustering keys and queries into fixed‑size, power‑of‑two blocks, enabling block‑sparse attention to match dense attention latency on GPUs. The method derives error bounds for sparse attention, showing tighter clusters can reduce error when compensated via centroids, and demonstrates significant speedups—up to six‑fold on large tabular data and 1.8× on video generation—while preserving over 99% of dense accuracy.

By Kasper Nordenram, Amelie Dittmann
diffusion
More like this →