NVIDIA's Kumo Relational predicts churn, demand and fraud straight from a relational database with no task-specific training
AspireAI community · NVIDIA
NVIDIA introduced Kumo Relational, a pre-trained relational foundation model that works directly on a database, respecting its tables, foreign keys and timestamps, instead of flattening rows. Given a predictive query it returns predictions such as churn, demand or fraud in a single forward pass with no task-specific training, feature engineering or table flattening, and its Predictive Query Language is built to be called by agents. NVIDIA reports that across 41 tasks on 15 databases it beats supervised relational deep-learning models and expert-engineered gradient-boosted tree pipelines, that on RelBench V1 classification it is ahead of gradient-boosted trees on engineered features by nearly 4 AUROC points, and that on SAP SALT it surpasses AutoGluon ensembles by 8% in mean reciprocal rank. The code is Apache 2.0, the weights are under the OpenMDW 1.1 license, and NVIDIA says it scales to databases with more than 500 billion rows. Treat the benchmark numbers as NVIDIA's own reporting; the open release makes them reproducible.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.