← Back to all news
Hugging Face Trending Papers

Adapting prior-data fitted networks for tabular anomaly detection

Read the original on Hugging Face Trending Papers →

The paper explores how prior-data fitted networks (PFNs) can be adapted for anomaly detection in tabular data. Using frozen TabPFN features, the authors show that scoring samples by nearest-neighbor distance in feature space yields strong results, and they identify optimal layers and extraction procedures. They further improve performance by fine‑tuning the model on a reference set, achieving higher AUROC on the ADBench benchmark with both a fine‑tuning‑free (ZEN) and a fine‑tuned (FOCUS) approach.

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 Hugging Face Trending Papers.

Related stories

arXiv Machine Learning
Oct 5

Mitigating Convergence Collapse in Fixed-Target Anomaly Detectors via Kernel-Anchored Locality Regularization

The paper studies a class of tabular anomaly detectors that train a neural map toward a fixed target using squared‑error loss, noting that improved optimization can paradoxically worsen detection performance—a phenomenon termed convergence collapse. It demonstrates that this collapse arises because the learned map extrapolates beyond the training data, erasing residual signals on anomalies. To address this, the authors introduce Kernel Contraction Matching (KCM), a closed‑form, training‑free kernel‑based baseline, and propose the Kernel‑Anchored Regularizer (KAR), which penalizes deviations from a kernel‑weighted average of training targets, thereby mitigating collapse and improving AUROC during extended training.

By Jos\'e Lucas De Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Li\^en Doan
More like this →