Papers for

risk analytics teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Self-supervised transaction embeddings improve fraud detection and risk analysis

CARTA: Self-Supervised Reusable Transaction Embeddings via Heterogeneous Tokenization and Cross-Attention

Abstract: Acquiring fraud labels for payment transactions is expensive and inconsistent across tasks, and high-cardinality identifiers such as merchant names make one-hot feature pipelines infeasible at scale. We present CARTA, a self-supervised encoder that learns a compact 16-dim embedding from raw transactions without labels; the frozen embedding is then reused for label-efficient fraud probing and exploratory unsupervised risk stratification without retraining the encoder. CARTA uses type-specific projections with learned embedding tables for high-cardinality identifiers, trained with token excision and InfoNCE contrastive loss. On IEEE-CIS, its linear probe at 1% of labels exceeds a raw-feature probe at 100%; on IBM TabFormer (2M rows), its frozen embedding reaches GBDT AUPRC 0.508, above frequency encoding (0.411) and the merchant-dropping baseline (0.022), though fully-supervised CatBoost is stronger. CARTA is a label-free, reusable representation that complements task-specific supervised models.

Sat 17 OctMachine LearningComputation and Language
The gist
Detecting fraud in payment transactions is hard because labels are expensive to get and some transaction details like merchant names vary a lot, making standard methods inefficient. The authors built CARTA, a model that learns a small set of numbers (an embedding) to describe transactions without needing any labels. This reusable representation works well for detecting fraud even with very few fraud labels and helps group transactions by risk without retraining. Their approach uses special handling of different data types and contrasts parts of transactions to learn meaningful patterns.
Open → 2610.24920v1

Homophily gated prediction improves node classification reliability without training

Valid for Free: Homophily-Gated Conformal Prediction for Training-Free Node Classification with Tabular Foundation Models

Abstract: Tabular foundation models (TFMs) can classify the nodes of a graph without training on it, by reading node and neighborhood features as table rows next to labeled context rows. Work in this line reports predictive performance, not conformal coverage or prediction-set size. To our knowledge, we give the first reliability study of the setting, with TabICL as the TFM and half of each graph as labeled context. As for any predictor fixed before calibration, a frozen in-context predictor makes split conformal prediction exactly valid in finite samples, with no training, validation fold, or tuning on the target graph. An audit across ten graphs then shows that the training-free TabICL posterior has lower expected calibration error (ECE) than GCN with temperature scaling (GCN+TS) on nine of them. Its mean ECE over the ten graphs is 0.019, about 35 percent below the 0.029 of GCN+TS. We also introduce HG-DAPS, a training-free diffusion score whose homophily gate reads only the in-context labels, so the guarantee still holds. Relative to adaptive prediction sets (APS), it reduces mean set size by 5.8 to 17.1 percent on six homophilous graphs and changes it by under 1 percent on four heterophilous ones. On two binary, class-imbalanced graphs, a pre-registered trap case shows that gating on raw rather than adjusted homophily lowers coverage among low-homophily nodes by 0.27 and 0.12. Marginal coverage stays at the nominal 0.90 and masks this drop.

Tue 6 OctMachine Learning
The gist
Predicting categories for nodes in a network usually needs lots of training data and time. The authors study how to make prediction sets that are reliable and accurate without training, by using tabular foundation models that read node information and known examples in context. They show this method gives better calibrated confidence in predictions compared to some existing models, saving effort and improving trust. They also propose a new way to adjust predictions based on how similar connected nodes are, which makes prediction sets smaller for certain graphs without losing reliability.
Open → 2610.08564v1