betaFeedback

WorksComputer Science

TRIDENT-Seq: Profile-Matched Prefix-Future Contrast for Label-Efficient Payment Risk Modeling

Abstract

Ant International accumulates large volumes of transaction history across users and payment businesses. Confirmed fraud and chargeback outcomes, by contrast, are scarce, delayed, and specific to each business. A single encoder pretrained on unlabeled histories could serve all businesses, but only if pretraining captures the behavior that separates risk. Coarse activity differences can make contrastive pretraining on transaction logs too easy: transaction volume, amount, and timing can distinguish a history's continuation from arbitrary candidates without modeling how payment resources are used. We present TRIDENT-Seq, a transaction foundation model trained with Prefix-Future Contrast (PFC). PFC matches each prefix to a summary of its subsequent behavior among candidates with similar activity profiles; activity prediction and dispersion regularization act on the encoder output. Across three production payment businesses, the pretrained encoder improves average precision (AP) and recall at a 0.5% intervention budget over architecture-matched scratch training in all six business-budget settings. With a fixed validation set, it exceeds full-label scratch training in mean AP and recall using 10% of the training labels on Wallet and 25% on Shopping and SME. Pretraining only on another business's histories still helps. Replacing profile-matched candidates with random ones cuts recall from 24.62% to 5.64%. In Ant International's deployment evaluation, recorded amount-based chargeback and overall loss rates are 37.7% and 37.9% lower than those of the previous XGBoost-based system under the same intervention budget.

Introduction

Online payments underpin commerce on the Web. Ant International supports payment services across digital wallets, shopping platforms, and merchant businesses. Each needs its own risk model. Transaction histories accumulate continuously in all of them, but confirmed risk outcomes are rare and arrive only after chargebacks or investigations [11]. A new business or market therefore starts with abundant behavior and few labels, and one model per business multiplies the cost of labeling and upkeep [32]. The natural remedy is to pretrain one encoder on unlabeled histories and adapt it to each business with whatever labels it has.

Such an encoder should meet two requirements. Low-label adaptation: a business may hold millions of histories but only a few hundred confirmed outcomes. The pretrained representation must therefore separate much of the risk before labels shape it. Cross-business generalization: payment processes, user populations, and risk criteria differ across businesses. What the encoder learns must remain useful outside the business that supplied its histories, including businesses where most transactions have little or no history.

Self-supervised learning on event sequences makes this feasible [2, 33, 43, 48], and transaction foundation models now transfer representations across financial tasks and populations [13, 26, 32, 40]. Less settled is what a pretraining task should demand of a payment history. Risk often shows in how a user handles resources over time: switching cards after a decline, or retrying at the same merchant within minutes. Volume alone says much less.

This distinction exposes a weakness of contrastive pretraining on transaction logs. Histories differ most visibly in activity level: how many transactions they contain, how large the amounts are, and how the events spread over time. Asked to identify the continuation of a history among arbitrary alternatives, a model can often succeed on these coarse quantities alone. It then has little pressure to learn the finer behavior that separates risky from legitimate use, an instance of the shortcut solutions known to affect contrastive learning [36]. Candidate construction has a large downstream impact in our data. On a wallet business, random contrastive candidates yield 5.64% recall at a 0.5% intervention budget after fine-tuning with 10% of the labels. Candidates of comparable activity yield 24.62% § 6.

We present TRIDENT-Seq, a transaction foundation model built on Prefix–Future Contrast (PFC). PFC splits each training history into an older prefix and the behavior that follows. It summarizes the latter through amount, timing, and attribute-change statistics, and trains the encoder to identify the true summary among candidates with similar activity profiles. PFC selects candidates with comparable transaction counts, amounts, and aggregate event ages, then distinguishes their richer behavioral summaries. Two auxiliary terms act on the encoder output that adaptation reuses. Activity prediction directly supervises activity level, complementing the profile-matched contrast; a dispersion penalty discourages low average variation in the encoder output. Each business then fine-tunes a copy of the encoder with its own risk head Figure 1.

TRIDENT-Seq overview

Figure 1. TRIDENT-Seq overview. (a) PFC learns behavioral representations without risk labels. (b) The shared foundation model adapts to each business through supervised fine-tuning (SFT) with limited labels. (c) At Ant International, online A/B evaluation across deployed payment businesses shows a 37.9% reduction in the overall loss rate under the same intervention budget.

We evaluate TRIDENT-Seq on three payment businesses served by Ant International, with history coverage ranging from nearly complete to mostly empty. Pretraining improves AP and recall over architecture-matched scratch training in all six business–budget settings. On the wallet business, 10% of the training labels, only 76 positive examples, outperform scratch training with all training labels under the same fixed validation set. On the other two, 25% do so in mean AP and recall. Pretraining solely on another business’s histories still helps. The system has served SME merchants, where most transactions have no history, since June 8, 2026. Across its deployed payment businesses, recorded chargeback and overall loss rates are 37.7% and 37.9% lower than those of the previous XGBoost-based system.

Our contributions are as follows:

  • Method. We propose profile-matched future contrast, which trains each history prefix to identify its own future summary among candidates with comparable activity. This makes candidate construction an explicit part of transaction pretraining.

  • Evidence. Across three production businesses, one pretrained encoder supports label-efficient adaptation and transfers across businesses, and ablations isolate the contribution of each component.

  • Deployment. TRIDENT-Seq runs in Ant International’s payment risk system within a 120 ms inference budget, with portfolio-level A/B results and a two-stage SME evaluation.

Related Work

Transaction risk modeling. Feature-based detectors aggregate historical activity into indicators for supervised classifiers such as gradient-boosted trees [3, 8, 11]. Sequence models learn temporal dependencies directly from ordered transactions [22]. Graph models exploit relations among accounts, devices, and merchants, including camouflaged and highly imbalanced fraud [14, 28, 29]. These detectors typically learn from the risk labels of a single task. Each new business must first accumulate its own labels, and delayed feedback slows their arrival [6, 11]. TRIDENT-Seq learns its representation from unlabeled histories and uses labels only for adaptation.

Self-supervised pretraining on event sequences. TabBERT reconstructs masked fields of tabular event sequences [33], and self-supervised objectives have been combined with sampling strategies for card fraud detection [7]. CoLES treats subsequences of the same history as positive pairs [2], as TS2Vec does for time series [49]. Predictive objectives link the past to what follows. CPC contrasts future latent representations against in-batch negatives [43], and BYB predicts a teacher’s representation of a later behavior window [48] in the spirit of BYOL [17]. PFC is also predictive, but it targets and its negatives differ. The target is a fixed statistical summary of several subsequent events, not a learned event representation. The negatives are restricted to comparable activity. Hard-negative sampling also selects informative negatives, but defines hardness by embedding similarity [35]. PFC defines comparability through observable activity profiles and thus targets the shortcut that random negatives leave open [36]. Finally, negatives keep contrastive representations spread over the hypersphere [46], whereas non-contrastive methods enforce spread with explicit variance terms [4]. Our dispersion term follows the latter.

Transaction foundation models. The Foundation Purchasing Model pretrains generative autoregressive models on transaction sequences and transfers them to held-out fraud-detection populations [40]. TransactionGPT models transaction attributes and trajectories with a 3D Transformer [13]. PANTHER combines structured behavior tokens, sequence patterns, and user profiles [26]. PRAGMA extends masked modeling to banking events [32], and FRiskGPT places user behaviors and risk outcomes in a shared token space [50]. Payment companies report similar models in production [1, 10, 21]. Pretrained sequence encoders are likewise shared across domains in recommendation and advertising [15, 16, 20, 27], where transfer is usually evaluated between related catalogs, markets, or tasks [34]. Payment businesses also differ in label definitions and history coverage, which our controlled-source experiments vary explicitly. Most transaction foundation models predict the next event or reconstruct masked ones. TRIDENT-Seq instead contrasts multi-event summaries under activity matching, and we follow its reuse across businesses through to deployment.

Problem Setup

Transaction histories. For a transaction scored at time tt, the history H<t=(e1,…,en)H_{<t} = (e_1, \ldots, e_n) lists the user’s preceding events from most recent to oldest. Each event ej=(aj,fj,δj)e_j = (a_j, f_j, \delta_j) has an amount aja_j, categorical attributes fjf_j describing payment, device, and network context, and an age δj\delta_j in days relative to tt. The length nn varies and can be zero. The label y∈{0,1}y \in\{0, 1\} of the scored transaction indicates recorded fraud or chargeback. Chargebacks can arrive months after the transaction, so labels always lag the traffic they describe. For pretraining, an observed history is split into an older prefix HipH_i^p and the subsequent segment HifH_i^f, which we call its future. Both precede the scored transaction, so pretraining never sees events that occur after a decision.

Pretraining and adaptation. Let U\mathcal{U} be a pool of unlabeled histories and Ld={(H<t,y)}\mathcal{L}_d = \{(H_{<t}, y)\} the labeled transactions of business dd. We learn encoder parameters θpre\theta_{\mathrm{pre}} on U\mathcal{U}. Each business initializes its encoder FθdF_{\theta_d} from θpre\theta_{\mathrm{pre}} and trains it jointly with a risk head gϕdg_{\phi_d}:

pd(H<t)=σ(gϕd(Fθd(H<t))),(1)p_d(H_{<t}) = \sigma\left(g_{\phi_d}\left(F_{\theta_d}(H_{<t})\right)\right), \tag*{(1)}

where σ\sigma is the sigmoid function. The decision system ranks transactions by pdp_d and intervenes on a fixed fraction of traffic, the intervention budget. The budget is small, 0.5% in Ant International’s production system, because every intervention adds friction for legitimate users. We seek a θpre\theta_{\mathrm{pre}} that makes this ranking accurate with few labels, across businesses.

Methodology

Overview

Figure 1 shows the three stages of TRIDENT-Seq. (a) PFC pretrains a shared history encoder on unlabeled histories. (b) Each business fine-tunes its own copy of the encoder, with a new risk head, on its own labels. (c) Online, each transaction triggers history retrieval and one pass through the adapted encoder and risk head; the decision system acts on the resulting score. Future summaries, contrastive candidates, and auxiliary heads exist only in pretraining. They add nothing to serving cost.

Event Encoding

Event tokenization. Payment, device, and network attributes acquire new values continuously. We encode each categorical field with a Bloom-filter-style multi-probe hash [5, 42, 47] that maps a value to a fixed-width bit vector. A card or device always produces the same bit pattern. A new one typically produces a different pattern, and no vocabulary has to be maintained. Reuse and switching of payment resources, the cues behind evasion, are therefore visible directly in the token sequence. With four probes in separate 32-bit blocks, two distinct values receive identical vectors with probability 32−4≃10−632^{-4} \simeq10^{-6}, so collisions rarely merge different cards or devices. Amounts are clipped and log-transformed, and ages are expanded with sine and cosine features [23]. The token of event eje_j is

xj=Pe[B(fj)∥ψ(aj)]+Pδγ(δj),(2)x_j = P_e[B(f_j) \mathbin{\|} \psi(a_j)] + P_\delta\gamma(\delta_j), \tag*{(2)}

where BB concatenates the field bit vectors in a fixed order, ψ\psi transforms the amount, γ\gamma expands the age, ∥\mathbin{\|} denotes concatenation, and PeP_e and PδP_\delta are learned projections.

History encoder. A Transformer [45] with rotary positional encoding reads a CLS token followed by the event tokens, with padding masked. Its CLS output Fθ(H)F_\theta(H) represents the history. Pretraining, adaptation, and serving share this encoding (Figure 2); Appendix A gives the configuration.

Figure 2. TRIDENT-Seq architecture. (a) Event tokenization. (b) Shared history encoder. (c) Pretraining with PFC, activity prediction, and dispersion regularization, and business-specific supervised adaptation.

Prefix–Future Contrast

Prefixes and future summaries. For a training history HiH_i with at least two events, the older 60% of events form the prefix HipH_i^p and the rest form the future HifH_i^f. The encoder represents the prefix as ri=Fθ(Hip)r_i = F_\theta(H_i^p). A deterministic function SS maps HifH_i^f to a 24-dimensional summary of its amount and event-age distributions, the regularity of intervals between adjacent events, and the occupancy and change of hashed attribute values (Appendix A.2). Hash occupancy is a coarse proxy for the diversity of attribute values within the future. The switching rate measures, field by field, how Algorithm 1. Profile-matched PFC for one minibatch

Input: BB histories with at least two events; prefix ratio ρ\rho, threshold ε\varepsilon, temperature τ\tau.

Output: LPFC\mathcal{L}_{\mathrm{PFC}} and prefix representations RR.

  1. for i=1,…,Bi=1,\ldots,B do

  2. (Hip,Hif)←SplitChronologically⁡(Hi,ρ)(H_i^p,H_i^f)\leftarrow\operatorname{SplitChronologically}(H_i,\rho); ri←Fθ(Hip)r_i\leftarrow F_\theta(H_i^p)

  3. zip←norm⁡(qp(ri))z_i^p\leftarrow\operatorname{norm}(q_p(r_i)); zif←norm⁡(qf(S(Hif)))z_i^f\leftarrow\operatorname{norm}(q_f(S(H_i^f))); πi←π(Hif)\pi_i\leftarrow\pi(H_i^f)

  4. ℓij←⟨zip,zjf⟩/τ\ell_{ij}\leftarrow\langle z_i^p,z_j^f\rangle/\tau and dij←∥πi−πj∥1d_{ij}\leftarrow\lVert\pi_i-\pi_j\rVert_1 for all i,ji,j

  5. M←IBM\leftarrow I_B; Mij←1M_{ij}\leftarrow1 for all j≠ij\ne i with dij≤εd_{ij}\le\varepsilon

  6. Mi,:←1M_{i,:}\leftarrow1 for every row ii with ∑jMij=1\sum_j M_{ij}=1 ▷ fallback

  7. ℓij←−∞\ell_{ij}\leftarrow-\infty wherever Mij=0M_{ij}=0

  8. return LPFC=−1B∑ilog⁡softmax⁡(ℓi,:)i\mathcal{L}_{\mathrm{PFC}}=-\frac{1}{B}\sum_i\log\operatorname{softmax}(\ell_{i,:})_i, R=[r1,…,rB]R=[r_1,\ldots,r_B]

often consecutive events change attribute values, as when a card or device is replaced after a rejection. Event-age statistics describe how activity is spread over time. We summarize several events rather than predict the next one: retry bursts, resource switching, and the slow build-up of routine activity all span multiple events. A prefix head qpq_p and a future head qfq_f map both sides into a shared space:

zip=norm⁡(qp(ri)),zif=norm⁡(qf(S(Hif))),(3)z_i^p=\operatorname{norm}(q_p(r_i)),\qquad z_i^f=\operatorname{norm}(q_f(S(H_i^f))), \tag*{(3)}

where norm is L2 normalization [9, 46].

Profile-matched candidates. Contrasting a prefix against arbitrary futures invites the activity shortcut: a future with three transactions is easily told apart from one with three hundred. We therefore select contrastive candidates by similarity in coarse activity. With uj=log⁡(1+max⁡(aj,0))u_j=\log(1+\max(a_j,0)), the activity profile of a future is

π(Hf)=[log⁡(1+∑j∈Hfuj)log⁡(1+∣Hf∣)log⁡(1+∑j∈Hfδj)].(4)\pi(H^f)=\begin{bmatrix} \log(1+\sum_{j\in H^f}u_j)\\ \log(1+|H^f|)\\ \log(1+\sum_{j\in H^f}\delta_j) \end{bmatrix}. \tag*{(4)}

In a minibatch of BB prefix–future pairs, prefix ii keeps its own future and every other future jj with ∥π(Hif)−π(Hjf)∥1≤ε\lVert\pi(H_i^f)-\pi(H_j^f)\rVert_1\le\varepsilon. If no other future qualifies, all futures in the batch are used (Algorithm 1). The logarithmic threshold ε=1.5\varepsilon=1.5 allows roughly e1.5≈4.5e^{1.5}\approx4.5-fold variation in activity scale when the other two coordinates agree. Building the mask takes B2B^2 comparisons of three-dimensional profiles, negligible next to the encoder. With N(i)\mathcal{N}(i) the resulting candidate set and τ\tau a temperature, PFC minimizes

LPFC=−1B∑i=1Blog⁡exp⁡(⟨zip,zif⟩/τ)∑j∈N(i)exp⁡(⟨zip,zjf⟩/τ).(5)\mathcal{L}_{\mathrm{PFC}}=-\frac{1}{B}\sum_{i=1}^{B}\log\frac{\exp(\langle z_i^p,z_i^f\rangle/\tau)}{\sum_{j\in\mathcal{N}(i)}\exp(\langle z_i^p,z_j^f\rangle/\tau)}. \tag*{(5)}

Matching candidates on volume, amount, and event timing directs the contrast toward the finer structure that SS encodes.

Auxiliary Objectives

PFC trains the projected, normalized vectors zpz^p, whereas adaptation reuses the encoder output rr. Two auxiliary terms act on rr directly.

Activity prediction. Profile matching reduces coarse activity differences among candidates, while activity remains informative about risk. An activity head qaq_a therefore regresses rir_i onto a 25-dimensional target A(Hi)A(H_i) computed from the full training history. The target collects transaction counts, amounts, event ages, and hash-field statistics over the 75, 150, and 300 most recent events, plus differences that contrast the most recent window with the longer history (Appendix A.2). The loss

Lact=1B∑i=1BSmoothL1⁡(qa(ri),A(Hi))(6)\mathcal{L}_{\mathrm{act}}=\frac{1}{B}\sum_{i=1}^{B}\operatorname{SmoothL1}(q_a(r_i),A(H_i)) \tag*{(6)}

averages over target coordinates.

Dispersion regularization. Because the contrastive loss is computed after projection and normalization, it does not directly constrain the spread of rr itself. We penalize a low average within-batch standard deviation of the prefix representations:

Ldisp=max⁡(0,σ0−1D∑k=1DStd⁡i(rik)),(7)\mathcal{L}_{\mathrm{disp}}=\max\left(0,\sigma_0-\frac{1}{D}\sum_{k=1}^{D}\operatorname{Std}_i(r_{ik})\right), \tag*{(7)}

where Std⁡i\operatorname{Std}_i is the standard deviation of dimension kk over the BB prefixes in the minibatch and DD is the representation width. The penalty vanishes once the average spread reaches σ0\sigma_0. It resembles the variance term of VICReg [4] but applies to the mean standard deviation rather than to each dimension, before projection.

Joint objective. The pretraining loss is

L=LPFC+λactLact+λdispLdisp,(8)\mathcal{L}=\mathcal{L}_{\mathrm{PFC}}+\lambda_{\mathrm{act}}\mathcal{L}_{\mathrm{act}}+\lambda_{\mathrm{disp}}\mathcal{L}_{\mathrm{disp}}, \tag*{(8)}

with λact=0.30\lambda_{\mathrm{act}}=0.30, λdisp=0.05\lambda_{\mathrm{disp}}=0.05, and σ0=0.02\sigma_0=0.02. The encoder and the prefix, future, and activity heads are trained jointly.

Business-Specific Adaptation

Each business dd copies the complete pretrained encoder, including event projections: θd←θpre\theta_d\leftarrow\theta_{\mathrm{pre}}. A new risk head gθdg_{\theta_d} reads its CLS output (Equation (1)), and the pretraining heads are discarded. For a labeled subset Ld\mathcal{L}_d with NdN_d examples, Nd,cN_{d,c} of them in class cc, the encoder and risk head minimize class-balanced cross-entropy:

Lrisk(d)=−1Nd∑(H,y)∈Ld[ωd,1ylog⁡pd(H)+ωd,0(1−y)log⁡(1−pd(H))],(9)\mathcal{L}_{\mathrm{risk}}^{(d)}=-\frac{1}{N_d}\sum_{(H,y)\in\mathcal{L}_d}\left[\omega_{d,1}y\log p_d(H)+\omega_{d,0}(1-y)\log(1-p_d(H))\right], \tag*{(9)}

with ωd,c=Nd/(2Nd,c)\omega_{d,c}=N_d/(2N_{d,c}), so both classes carry equal total weight. We fine-tune the whole encoder rather than a head on frozen features. Each business defines risk differently, and its labels should be able to reweight what the shared representation emphasizes.

Experiments

We address four research questions. RQ1: Does pretraining improve risk ranking across businesses and label budgets? RQ2: Does it transfer when the target business is excluded from pretraining? RQ3: Which components of PFC matter? RQ4: Do the gains carry over to production?

Datasets

We use data from three payment businesses served by Ant International: a wallet business (Wallet), a shopping-platform business (Shopping), and an SME-merchant business (SME). They differ mainly in history coverage (Table 1). Nearly every Wallet transaction has a history, whereas 30.63% of Shopping and 76.91% of SME test traffic have none. Wallet is also the most label-scarce: its training split contains 732 positive examples, against 183,398 on Shopping and 46,740 on SME. Each dataset is split chronologically into training, validation, and test periods [6, 11], and transactions with empty histories remain in the evaluation. Shared pretraining uses a pool of 24.5 million unlabeled histories, including Shopping histories. Their anchors end on March 1, 2026, before every downstream test period.

DataScored eventsHistory eventsMean lengthHistory sparsityTrain positives
Wallet127,37516.03M125.80.50%732
Shopping501,89814.78M29.530.63%183,398
SME371,6002.91M7.876.91%46,740

Table 1. Dataset statistics.

In Table 1, scored and history events are counted over the sampled training, validation, and test sets. A history event is counted each time it appears in an input, so events shared by overlapping histories count repeatedly. Mean length includes empty histories. History sparsity is the population-weighted share of test traffic with an empty history. Appendix D lists split sizes and positive counts.

Experimental Setup

Metrics. We report average precision (AP) [12, 37] and risk recall at a 0.5% intervention budget ([email protected]%), the share of risk captured when the highest-scoring 0.5% of traffic is selected. Validation and test metrics use inverse sampling-probability weights wiw_i that account for cohort subsampling and negative sampling [19, 24]. For budget bb, let αi(b)\alpha_i(b) be 1 above the score threshold, 0 below it, and a common fraction for scores tied at the threshold. Then

R⁡@b=∑iwiyiαi(b)∑iwiyi,∑iwiαi(b)=b∑iwi.(10)\operatorname{R}@b = \frac{\sum_i w_i y_i \alpha_i(b)}{\sum_i w_i y_i}, \qquad\sum_i w_i \alpha_i(b) = b \sum_i w_i. \tag*{(10)}

AP uses the same weights. Both metrics are reported as percentages. [email protected]% is our primary metric. It mirrors how the decision system acts, intervening on a fixed share of traffic, and the 0.5% budget matches production (§ 6.2). AP complements it by summarizing precision over the whole ranking.

Label budgets. Fine-tuning uses 1%, 5%, 10%, 25%, or 100% of the training labels, with the same subsets for all methods. The validation set, which selects learning rates and checkpoints, is the same at every budget; on Wallet it holds 807 positives. The main comparison uses 10% and 100%, and Shopping and SME are evaluated at all five budgets. On Wallet, the 1% and 5% subsets would contain only 7 and 34 positive examples, so we report 10% (76 positives) and 100%.

Baselines. All offline methods take historical transaction events as input. Scratch uses the TRIDENT-Seq encoder and risk head with random initialization. CoLES [2], BYB [48], and CPC [43] are adapted to share our encoder, pretraining histories, and 24,000-update budget. They contrast history crops, predict a teacher’s representation of later behavior, and contrast upcoming event representations, respectively. TransactionGPT [13] and PANTHER [26] keep their own event encodings and architectures and are pretrained on the same pool. Appendix B details the adaptations and also reports XGBoost on production risk indicators, whose inputs differ from those of the sequence models. Ant International’s production baselines, XGB-AutoRefit and a SAINT-style model, appear in Section 5.8.

Implementation. The encoder is an 8-layer Transformer with hidden size 1,024 and 8 attention heads (92.92M parameters) over at most 300 events. Pretraining uses AdamW at learning rate 1.5×10−41.5 \times10^{-4}, τ=0.2\tau= 0.2, and ϵ=1.5\epsilon= 1.5 for 24,000 updates at global batch size 128. One pretrained checkpoint serves all businesses and budgets. Each fine-tuning run tries three encoder learning rates for 1,024 updates each, then trains for 2,048 updates at the rate with the best weighted validation AP. The same criterion selects the checkpoint. We report means and sample standard deviations over three fine-tuning runs. Appendix A gives the full configuration, and Appendix G examines a longer adaptation schedule.

Overall Performance (RQ1)

Pretraining improves on scratch training in every setting. TRIDENT-Seq raises both AP and [email protected]% over architecture-matched scratch training in all six business–budget settings (Table 2). No other objective that shares our encoder and pretraining data does so. With 10% of the Wallet labels, CoLES and CPC fall below scratch in AP, and BYB falls below it in recall. CPC is the closest to PFC: it also predicts what follows a prefix, but contrasts against in-batch futures of other users without activity matching. With full Wallet labels it beats scratch (12.74% vs. 10.41% recall) yet stays far from TRIDENT-Seq (28.33%), in line with the drop that random candidates cause in our ablation (§ 6). Among the separately designed systems, PANTHER is competitive on Wallet but trails scratch on Shopping at both budgets and on SME with full labels. One difference: PANTHER encodes behaviors and fields through fixed vocabularies of 60,003 and 7,912 tokens, whereas hashing encodes unseen attributes as values without a fixed vocabulary. For reference, XGBoost trained on Ant International’s production risk indicators that preceded TRIDENT-Seq online trails scratch training in all six settings (Appendix B).

ModelWallet AP ↑Wallet [email protected]% ↑Shopping AP ↑Shopping [email protected]% ↑SME AP ↑SME [email protected]% ↑
10% training labels
Scratch0.0342±0.00823.31±0.770.3067±0.03754.79±0.510.3476±0.07984.67±0.51
CoLES (adapted)0.0274±0.01242.92±0.550.2879±0.01825.18±0.840.3514±0.06915.04±0.52
BYB (adapted)0.0475±0.01602.86±0.560.2447±0.05743.56±1.800.3624±0.04885.91±2.17
CPC (adapted)0.0279±0.00613.34±2.140.3569±0.00945.79±0.700.3874±0.02835.60±0.68
TransactionGPT (adapted)0.3209±0.150220.69±8.570.4316±0.02376.16±0.880.5446±0.12648.30±1.72
PANTHER (adapted)0.2067±0.105516.01±9.690.2561±0.06523.93±1.130.3662±0.09135.50±1.01
TRIDENT-Seq0.8214±0.333727.75±5.440.4331±0.07356.61±1.160.4886±0.06729.14±1.85
100% training labels
Scratch0.1148±0.048610.41±5.190.4205±0.06607.81±1.760.6370±0.08058.11±1.25
CoLES (adapted)0.1150±0.15155.87±3.230.4919±0.06058.25±0.770.3865±0.02686.10±0.84
BYB (adapted)0.0525±0.01996.76±2.120.5087±0.02119.24±0.340.7682±0.23579.80±1.47
CPC (adapted)0.3128±0.096812.74±2.740.5057±0.04977.48±3.470.7678±0.189610.89±0.10
TransactionGPT (adapted)0.4447±0.130621.33±5.450.7500±0.308511.39±1.510.7556±0.076114.20±0.37
PANTHER (adapted)0.3484±0.138316.09±0.620.3074±0.02815.18±0.170.4573±0.03866.61±1.00
TRIDENT-Seq0.8355±0.414228.33±3.250.5678±0.04879.61±0.730.8685±0.155314.34±0.42

Table 2. Performance comparison (%). Best results are bold; second-best results are underlined.

Wallet benefits most. Histories cover 99.50% of Wallet test traffic and average 125.8 events. With 10% labels, TRIDENT-Seq reaches 0.8214% AP and 27.75% recall, 24.0 and 8.4 times the scratch values. Both exceed scratch trained on all labels (0.1148% and 10.41%). TRIDENT-Seq also leads the strongest baseline, TransactionGPT, at both budgets. Its 10%-label result already retains 98% of its full-label AP and recall, whereas scratch training with 10% labels retains only 32% of its full-label recall. Wallet AP varies widely across fine-tuning runs, with standard deviations of 41% and 50% of the mean. The training split holds only 732 positives, and a few weighted positives decide the top of the ranking. Recall is steadier, at 20% and 11%.

Shopping and SME are more competitive. TransactionGPT, which predicts the fields of the next event, leads both metrics on full-label Shopping and AP on SME with 10% labels. TRIDENT-Seq leads recall with 10% labels on both businesses, and both metrics on

SME with full labels. Two of these comparisons fall within run-to-run variation: Shopping AP with 10% labels (0.4331% vs. 0.4316%) and SME recall with full labels (14.34% vs. 14.20%). SME deserves a closer look. Of its test traffic, 76.91% has no history, yet pretraining nearly doubles recall with 10% labels, from 4.67% to 9.14%. The reason is concentration: the history-covered 23.09% of traffic carries 85.51% of the weighted risk.

The advantage persists under longer adaptation. Each fine-tuning run above uses 5,120 updates, learning-rate search included. On full-label Wallet we extend this to 14,336 updates for both models. TRIDENT-Seq then reaches 2.53 times the recall and 1.79 times the AP of scratch training (Appendix § 14), close to the recall ratio of 2.72 under the standard schedule.

Label Efficiency (RQ1)

Figure 3 sweeps five label budgets on Shopping and SME. Points and error bars show three-run means and standard deviations; dashed lines mark scratch training with all labels. With 25% of the training labels, TRIDENT-Seq exceeds full-label scratch in mean AP and recall on both businesses. On Shopping it reaches 0.5246% AP and 8.33% recall, against 0.4205% and 7.81%. On SME it reaches 0.6928% and 10.16%, against 0.6370% and 8.11%.

Figure 3. Label efficiency on Shopping and SME.

Pretraining also flattens the label curve. With 25% of the labels, TRIDENT-Seq keeps 87% of its full-label recall on Shopping and 71% on SME; scratch training keeps 73% and 62%. TRIDENT-Seq improves both metrics over same-budget scratch at every budget on SME and from 5% upward on Shopping. At 1% of the Shopping labels, it trails scratch. The relative gain in both metrics peaks at 25% on both businesses: 46% in AP and 47% in recall on Shopping, 69% and 102% on SME. With full labels it narrows as scratch training catches up. Appendix § 12 lists all values.

Cross-Business Transfer (RQ2)

The main pretraining pool includes Shopping histories. To test transfer without target-business data [34], we pretrain separate checkpoints on Shopping-only histories, SME-only histories, or an equal mixture. Each pool holds 1,288,542 distinct histories with matched daily counts. Each checkpoint receives 24,000 updates, and adaptation follows the main protocol at 10% and 25% labels.

Pretraining only on the other business improves AP and recall over no pretraining in all four target–budget settings (Table 3). The two directions differ. For Shopping, SME histories match Shopping’s own in recall at 10% and beat them in both metrics at 25%. For SME, Shopping histories help more than SME’s own with 10% labels (0.5791% vs. 0.4857% AP; 8.67% vs. 6.13% recall) but less with 25%. SME histories are short, averaging 7.8 events against 29.5 on Shopping, so richer histories from another business can partly substitute for in-domain ones. Mixing the two sources beats target-only pretraining in both metrics on both businesses at 25% labels; at 10%, it raises recall but lowers AP. Bold in Table 3 marks the best mean per target and budget, and Appendix C adds standard deviations and AUROC.

Pretraining source10% labels25% labels
AP[email protected]%AP[email protected]%
Target: Shopping
No pretraining0.30674.790.35915.68
Shopping only0.39945.970.43617.85
SME only0.36685.960.46638.70
Shopping + SME0.33316.460.45117.98
Target: SME
No pretraining0.34764.670.41035.04
SME only0.48576.130.50957.86
Shopping only0.57918.670.43196.94
Shopping + SME0.43157.150.63799.05

Table 3. Effect of the pretraining source (%).

Ablation Study (RQ3)

We ablate PFC on Wallet, whose histories are the most complete and where pretraining matters most (Table 4). Each variant modifies Full PFC in one respect. Two change how the contrast is built. Random negatives keeps each row’s candidate count but draws candidates without profile matching. Shuffled pairs keeps the prefixes and summaries but pairs each prefix with another history’s future. Three change the auxiliary terms: w/o activity and w/o dispersion remove one term, and PFC only removes both. All variants share the encoder, data, and 24,000 pretraining updates, and each is pretrained and fine-tuned once with the learning rate selected on full labels.

Variant / budget10% labels100% labels
0.1%0.5%1.0%0.1%0.5%1.0%
Full PFC8.5424.6232.7011.2628.4436.29
Random negatives3.775.648.983.747.3813.10
Shuffled pairs1.3214.6224.792.4516.2220.04
PFC only7.0214.3720.659.3316.0721.28
w/o activity7.8515.1022.5010.3116.3824.07
w/o dispersion7.3416.1430.219.7617.2132.65

Table 4. Wallet ablation: recall (%) at three intervention budgets.

Profile matching matters most. Random negatives give the lowest recall at the 0.5% and 1% budgets: 5.64% and 7.38% at 0.5%. They fall below even shuffled pairs, whose targets carry no information about the prefix. At these budgets, random negatives with full labels stay below every other variant with only 10% of the labels. We read this as evidence for the activity shortcut of § 4.3: when candidates can be separated by volume, pretraining appears to favor cues that transfer poorly to risk ranking. The ablation measures downstream recall; probing which cues the encoder relies on would test this reading directly.

Correspondence matters. Shuffled pairs reduce R@0.5%[email protected]\% to 14.62% and 16.22%, about the level of PFC only, and give the lowest recall of all variants at the 0.1% budget. Comparable candidates help only when the prefix must find its own future among them. Without the true target, the contrast cannot teach how a particular history continues.

Combining the auxiliary terms gives the highest recall. Adding either term alone to PFC only raises R@0.5%[email protected]\% by at most 1.8 points with 10% labels: from 14.37% to 15.10% with dispersion and 16.14% with activity. Adding both raises it to 24.62%. With full labels the pattern repeats: 16.38%, 17.21%, and 28.44%, from 16.07%. Activity prediction supplies explicit statistical supervision, while dispersion regularization penalizes low average variation in the encoder outputs. Their combination achieves the largest recall gain in Table 4.

The two removals also differ across budgets. Removing dispersion causes its largest drop at the 0.5% budget, 8–11 points, against at most 4 points at 0.1% and 1%. Removing activity prediction lowers recall by 10–12 points at both 0.5% and 1%.

The components mainly shape the top of the ranking. At the 0.1% budget, PFC only and the single-term variants stay within 2 points of Full PFC. AUROC, which summarizes the whole ranking, differs by less than 2.5 points across these variants (Appendix F). The gains concentrate at the 0.5% and 1% budgets, around the production operating point.

Case Study

Evasion and account warming. These two risk patterns unfold on different time scales. Evasion changes payment resources or attempt timing to get past risk controls; it shows up as rapid adjustments across consecutive attempts. Account warming builds routine-looking activity before later misuse; it shows up as slow accumulation. We inspect the pretrained representations of 2,880 annotated histories. They include evasion and account-warming cases, together with legitimate histories that look similar. Figure 4 colors evasion with evasion-like legitimate histories, and account warming with warming-like ones. In PCA, the evasion group concentrates on the left branch and the warming group on the right. The two overlap. In t-SNE [44], the outlined region of 374 histories is dominated by evasion-type histories.

PCA and t-SNE plots of pretrained representations of annotated histories

Figure 4. Pretrained representations of annotated histories.

Rapid retries at the same merchant characterize this region. Among its 361 annotated feedback–adjustment pairs, 95.6% stay at the same merchant, versus 70.7% among 916 pairs outside the surrounding island. Median intervals are 4.8 minutes versus 22.8 hours. Figure 5 follows one history from the region. C, D, and I identify anonymous cards, devices, and IP addresses; thought bubbles sketch the likely intent at each step. After a rejection, the next attempt uses a new card on the same device and IP address. After a second rejection, card and device both change while the IP address stays. The third attempt, 120 seconds after the first, succeeds. Each switch appears in the event tokens as a new bit pattern in the card or device field. The encoder never sees risk labels, merchant links, or payment outcomes; these were attached only for inspection. The region thus reflects structure learned from transaction histories alone. Appendix H specifies the selection rule.

Card and device switching after rejection diagram

Figure 5. Card and device switching after rejection.

Online Deployment (RQ4)

Serving. Ant International deploys TRIDENT-Seq across multiple payment businesses; SME deployment began on June 8, 2026 (Figure 1(c)). SME has the sparsest histories of our three businesses, and pretraining leads both offline metrics there with full labels (Table 2). The feature platform retrieves the available history, and the service applies the same event encoding as training [38]. The adapted encoder and risk head return a score. The decision system maps it to interventions under predefined rules for different traffic profiles. With quantization and Cython optimizations on an A10 GPU, model inference averages 46.66 ms, with P95 of 55.86 ms and P99 of 80.16 ms. The inference budget is 120 ms. History retrieval takes 50–60 ms of the 250 ms end-to-end budget.

A/B test design. At Ant International, we compared TRIDENT-Seq with XGB-AutoRefit, an iteratively refitted gradient-boosted tree model [8], and a SAINT-style deep tabular model [41]. From June 8 to October 14, 2026, 30% of platform transactions, about 28.20 million, were randomly assigned in equal shares to the three arms at launch [25]. The amount-based chargeback (CB) rate divides chargeback amount by successful transaction amount. The overall loss rate uses financial losses after dispute-related adjustments over the same denominator. Portfolio rates pool recorded amounts across businesses and transaction dates within each arm. Traffic shares shifted briefly during load testing and staged rollout; assignment stayed random.

SME evaluation. The SME experiment separates scoring from intervention, because blocked transactions cannot produce chargebacks. In Stage I (June 8–August 2), all arms scored without intervening; subsequent risk feedback measures recall among the

0.5% highest-scoring transactions. In Stage II (August 3–October 14), each arm made production decisions under the same business policies and a 0.5% intervention budget.

Outcome timing. Financial outcomes in Table 5 and Table 17 include reports recorded through October 25, 2026, giving SME Stage II transactions 11–83 days of follow-up. SME estimates use 66 common transaction dates with CB amounts and positive successful amounts in all arms. Appendix I reports historical label-count delays and paired calendar-week bootstrap intervals for the observed financial snapshot.

MethodTraffic (M)CB rate change ↓Loss rate change ↓
XGB-AutoRefit9.06basebase
SAINT-style10.56−13.21%−18.18%
TRIDENT-Seq8.58−37.74%−37.88%

Table 5. Portfolio-level online A/B results at Ant International. Pooled arm-level rate changes relative to XGB.

MethodPooledDate-weighted
SAINT-style12.66 [2.58, 22.75]12.49 [1.43, 23.16]
TRIDENT-Seq28.28 [10.69, 42.38]26.09 [9.24, 41.34]

Table 17. SME transaction-date CB reduction versus XGB (%); approximate 95% CIs in brackets.

Results. Across the portfolio, TRIDENT-Seq records 37.74% lower CB and 37.88% lower overall loss rates than XGB-AutoRefit; reductions versus SAINT-style are 28.26% and 24.07%. All gaps exceed the business thresholds of 4% for CB and 10% for loss (Table 5). In SME Stage I, TRIDENT-Seq captures 29.79% of risk transactions within the 0.5% budget, versus 7.39% for XGB-AutoRefit and 16.52% for SAINT-style. In SME Stage II, its pooled CB reduction versus XGB is 28.28% (95% CI: 10.69–42.38%); common date weights give 26.09% (9.24–41.34%). SME Stage I recall follows TRIDENT-Seq > SAINT-style > XGB-AutoRefit in all routinely monitored segments.

Data governance. Transaction data are used for authorized fraud prevention, with access restricted to authorized personnel in an internal environment. Online experiments follow existing risk policies, monitor approval rates and false declines, and support rollback. We report aggregate results and omit identifying details from illustrative cases.

Conclusion

TRIDENT-Seq pretrains a shared transaction encoder for payment risk with PFC. PFC selects future summaries with similar activity profiles, narrowing coarse activity differences among contrastive candidates. One pretrained encoder improves risk ranking across three payment businesses. It surpasses full-label scratch training in mean AP and recall with 10% to 25% of the training labels, and it transfers when the target business is excluded from pretraining.

The benefit depends on history coverage. On SME, 76.91% of traffic has no history, and the encoder receives no events for it. Our results rest on one pretrained checkpoint, and Wallet AP varies considerably across fine-tuning runs. Natural next steps are to probe directly which cues the encoder relies on, to scale the pretraining data and model, and to combine sequence representations with production risk indicators. More broadly, our results suggest that the choice of contrastive candidates deserves as much attention as the prediction target.

Implementation Details

This appendix specifies event encoding, pretraining targets, and optimization. Table 6 summarizes encoder and pretraining settings, Table 7 defines the future-summary coordinates, and Table 8 lists downstream optimization settings.

SettingValue
Layers / hidden size / heads8 / 1,024 / 8
Encoder parameters / history cap92.92M / 300 events
Hash bits / probes128 / 4 per field
Eligible history / prefixAt least 2 events / older 60%
Future summary24 dimensions (Table 7)
ProfileThree coordinates (Equation 4)
Eligibility / temperatureL1 distance ≤1.5\le1.5 / 0.2
Activity weightλact=0.30\lambda_{\mathrm{act}} = 0.30
Dispersion weight / thresholdλdisp=0.05\lambda_{\mathrm{disp}} = 0.05 / σ0=0.02\sigma_0 = 0.02
Optimizer / learning rateAdamW / 1.5×10−41.5 \times10^{-4}
Updates / global batch24,000 / 128

Table 6. Encoder and pretraining configuration.

CoordinatesDefinition
1Constant 1
2min⁡(10,Std⁡(Δδ)/max⁡(Mean⁡(∣Δδ∣),10−6))/10\min(10,\operatorname{Std}(\Delta\delta)/\max(\operatorname{Mean}(|\Delta\delta|),10^{-6}))/10
3–5Mean⁡(u)/16\operatorname{Mean}(u)/16, Std⁡(u)/16\operatorname{Std}(u)/16, max⁡(u)/16\max(u)/16
6–7Mean⁡(δ)/92\operatorname{Mean}(\delta)/92, Std⁡(δ)/92\operatorname{Std}(\delta)/92
8∑j,khj,k/(1536m)\sum_{j,k} h_{j,k}/(1536m)
9Field-level switching rate SW between adjacent events
10Number of occupied bits in ⋁jhj\bigvee_j h_j, divided by 1,536
11–18Eight equal-width histogram bins of uu on [0,16][0,16]
19–24Six equal-width histogram bins of δ\delta on [0,92][0,92]

Table 7. Future-summary coordinates.

SettingValue
Optimizer / weight decayAdamW [31] / 0.01
Encoder learning rates3×10−53\times10^{-5}, 10−410^{-4}, 3×10−43\times10^{-4}
Risk-head learning rate10−310^{-3}
Global batch size128
Updates per LR / final run1,024 / 2,048
Warmup updates40
Schedule after warmupCosine [30] to 0.1 of initial LR
Gradient-norm limit1.0
LossClass-balanced binary cross-entropy
Fine-tuning runs3

Table 8. Downstream optimization settings.

Event Encoding and Network Configuration

Event encoding. For each field value, MurmurHash3 [39] maps the string field-name:value to a 128-bit hash with four 32-bit slices s0,…,s3s_0,\ldots,s_3. Probe k∈{0,1,2,3}k \in\{0,1,2,3\} sets bit ok=32k+(sk mod 32)o_k = 32k + (s_k \bmod32) of the 128-bit field vector, so each probe addresses its own 32-bit block and each nonempty value sets one bit per block. Missing values produce an all-zero vector. For example, block-local indices (3,7,12,2)(3,7,12,2) set positions (3,39,76,98)(3,39,76,98).

Prediction heads. The prefix head uses layer normalization and a 1024→10241024 \to1024 linear layer. The future head uses layer normalization and 24→1024→102424 \to1024 \to1024 linear layers with GELU between them. The activity head uses 1024→1024→251024 \to1024 \to25 layers with GELU. The risk head uses layer normalization, a 256-unit GELU layer, dropout 0.1, and a scalar output.

Pretraining Targets

Future summary. A history of n≥2n \ge2 events has a prefix of ⌊0.6n⌋\lfloor0.6n \rfloor events, clipped to [1,n−1][1,n-1]. For a future of mm events, amounts enter through uj=log⁡(1+max⁡(aj,0))u_j = \log(1+\max(a_j,0)) as in (4), and we let hj=[hj,1∥⋯∥hj,12]\mathbf{h}_j = [\mathbf{h}_{j,1}\mathbin\Vert\cdots\mathbin\Vert\mathbf{h}_{j,12}] concatenate the twelve 128-bit field hashes of event jj. Table 7 defines the 24 coordinates; histogram counts are normalized by mm. Moments use population standard deviations and exclude padding; amounts and ages are clipped before these calculations. The switching rate of mm events is the fraction of field values that change between adjacent events,

SW=112(m−1)∑j=2m∑k=1121[hj,k≠hj−1,k].(11)\mathrm{SW} = \frac{1}{12(m-1)}\sum_{j=2}^{m}\sum_{k=1}^{12}\mathbf{1}[\mathbf{h}_{j,k}\ne\mathbf{h}_{j-1,k}]. \tag*{(11)}

Adjacent-event statistics are zero for a one-event future. Let Δδ\Delta\delta contain consecutive valid age differences.

Activity target. For each window width w∈{75,150,300}w \in\{75,150,300\}, the window holds the ww most recent events of the full training history, or all events if fewer. Let nwn_w count its events, UwU_w be its union hash occupancy divided by 1,536, and CwC_w its switching rate SW. The six window statistics are

Kw=clip⁡[0,1][nww,log⁡(1+∑uj)16,Mean⁡(u)16,Mean⁡(δ)92,Uw,Cw].(12)K_w = \operatorname{clip}_{[0,1]}\left[\frac{n_w}{w},\frac{\log(1+\sum u_j)}{16},\frac{\operatorname{Mean}(u)}{16},\frac{\operatorname{Mean}(\delta)}{92},U_w,C_w\right]. \tag*{(12)}

The 25-dimensional target A(H)A(H) concatenates K75K_{75}, K150K_{150}, K300K_{300}, coordinates 2, 4, 5, and 6 of K300−K75K_{300}-K_{75}, which contrast the most recent window with the longer history, and three zeros. Empty-window and undefined statistics are zero. Smooth L1 uses β=1\beta=1 and averages over the batch and the 25 coordinates.

Optimization and Protocol

Ablation variants. Random negatives retain each row’s matched-candidate count, including the fallback count. Shuffled pairs apply a one-position cyclic shift to the future summaries and their profiles before the mask is constructed.

Downstream adaptation. The encoder and risk head are fine-tuned jointly with class-balanced binary cross-entropy, with class weights computed within each training-label subset. Weighted validation AP selects learning rates and checkpoints. Table 8 lists the settings.

Baselines

CoLES. Two contiguous crops from one history form a positive pair; negatives come from other users. Unit-normalized embeddings use a Euclidean contrastive loss with margin 1 and the five closest eligible negatives. Crop lengths range from one quarter of the history to its full length, with a minimum of two events. The shared Transformer replaces the original recurrent encoder, such as an LSTM [18], and two crops per anchor replace lifetime-level multi-crop sampling.

BYB. A strictly time-separated older prefix predicts the representation of a recent event window produced by a teacher whose parameters follow an exponential moving average. The teacher updates at 0.995, and a two-layer predictor uses soft-target cross-entropy at temperature 0.1. A 60/40 event-count split with one disjoint pair per anchor replaces fixed daily windows; the teacher averages event representations instead of using daily pooling.

CPC. The context encoder receives only the prefix and predicts future event representations at horizons 1, 2, and 4 using horizon-specific bilinear scores and cross-user in-batch negatives. Both event and context encoders receive gradients; missing horizons are omitted. CoLES, BYB, and CPC each use 24,000 pretraining updates at batch size 128 and one pretrained checkpoint.

TransactionGPT. The adapted system uses two-layer metadata and feature encoders and an 18-layer causal history encoder with 640 hidden units and eight attention heads. Two virtual tokens produce a 1,280-dimensional history representation. Next-event pretraining averages categorical cross-entropy and two numerical mean-squared-error losses.

PANTHER. The adapted encoder uses ten layers, eight attention heads, and 64 sequence patterns. Event tokens combine a 400-dimensional behavior embedding with three 80-dimensional field embeddings. The behavior and field vocabularies contain 60,003 and 7,912 tokens, respectively. Next-event contrastive prediction uses 32 in-batch negatives and temperature 0.05.

TransactionGPT and PANTHER are pretrained from scratch on the same history pool for 24,000 updates at batch size 128 and a history cap of 300. Calendar features and user-profile modules are disabled. Adaptation uses the search and update budget in Table 8, with microbatches of 32 and a new risk head. All representation parameters are fine-tuned; pretraining-only prediction heads are frozen.

XGBoost reference. XGB is trained on risk indicators accumulated by Ant International’s production system over several years rather than on event histories. Because its inputs differ from those of every other method, we report it as a reference (Table 9) rather than in the main comparison. It uses the same label budgets and weighted test metrics; the table gives its means and sample standard deviations, with the scratch and TRIDENT-Seq means from Table 2 for comparison. XGB trails scratch training in all six settings; on full-label Wallet, its recall is 4.31%, against 10.41% for scratch and 28.33% for TRIDENT-Seq.

SettingAP XGBAP ScratchAP Ours[email protected]% XGB[email protected]% Scratch[email protected]% Ours
Wallet 10%0.0133±0.00270.03420.82142.01±0.373.3127.75
Wallet 100%0.1042±0.01090.11480.83554.31±1.1610.4128.33
Shopping 10%0.2146±0.00980.30670.43313.41±0.944.796.61
Shopping 100%0.3573±0.03070.42050.56786.25±0.417.819.61
SME 10%0.2810±0.04110.34760.48863.97±0.334.679.14
SME 100%0.5210±0.06520.63700.86856.88±0.258.1114.34

Table 9. XGBoost on Ant International’s production risk indicators (%).

Pretraining Source Composition

Table 10 reports the controlled-source results. Each source has one pretrained checkpoint and three downstream fine-tuning runs, summarized by means and sample standard deviations. These checkpoints use the matched pools of Section 5.5 and are separate from the main pretraining run. The no-pretraining baseline uses the same downstream training and test sets.

TargetPretraining source10% labels: AP10% labels: AUROC10% labels: [email protected]%25% labels: AP25% labels: AUROC25% labels: [email protected]%
ShoppingNo pretraining0.3067±0.037573.90±0.664.79±0.510.3591±0.059774.91±1.405.68±1.73
Shopping only0.3994±0.065075.10±0.565.97±0.780.4361±0.108074.73±2.007.85±2.06
SME only0.3668±0.110771.13±6.865.96±2.480.4663±0.043575.57±1.258.70±0.76
Shopping + SME0.3331±0.115071.71±5.846.46±1.810.4511±0.103374.93±0.467.98±1.99
SMENo pretraining0.3476±0.079867.84±13.674.67±0.510.4103±0.049469.52±13.105.04±1.25
SME only0.4857±0.061573.00±8.246.13±0.150.5095±0.088358.75±3.977.86±0.61
Shopping only0.5791±0.051977.71±5.438.67±1.530.4319±0.054365.48±12.376.94±0.26
Shopping + SME0.4315±0.109767.15±17.087.15±0.530.6379±0.057677.18±6.479.05±1.73

Table 10. Cross-business transfer results (%).

Data Splits and Label Budgets

Table 11 lists the sampled split sizes and positive counts. Positive rates differ across splits because of negative sampling; validation and test metrics reweight each example by its inverse sampling probability. Label budgets subsample the training split, and Table 12 gives the resulting positive counts. Wallet is evaluated at 10% and 100% only, because its 1% and 5% subsets contain 7 and 34 positives.

DataSplitEventsPositivesPositive rate
WalletTrain30,2327322.42%
Validation46,8078071.72%
Test50,3363,3366.63%
ShoppingTrain283,040183,39864.80%
Validation20,5833731.81%
Test198,2752,9491.49%
SMETrain147,40146,74031.71%
Validation20,5237023.42%
Test203,6763,3811.66%

Table 11. Sampled split sizes and positives.

Data1%5%10%25%100%
Wallet73476172732
Shopping1,8819,26518,42345,859183,398
SME4692,3824,67111,60846,740

Table 12. Training positives at each label budget.

Results at All Label Budgets

Table 13 reports the values plotted in Figure 3 as three-run means and sample standard deviations. All methods use the same training-label subsets and the full weighted test population.

Ablation: AP and AUROC

Table 14 reports AP and AUROC for the component variants. Full PFC has the highest AP at both label budgets. AP and top-budget recall need not move together: for the three partial variants, AP decreases from 10% to 100% labels while [email protected]% increases. We observe such divergences repeatedly on Wallet, where weighted positives are rare and AP varies widely across runs (Table 2). AUROC summarizes the whole ranking, varies by less than 2.5 points across variants, and does not favor Full PFC; the components mainly change the top of the ranking, where interventions act.

Longer Adaptation

On full-label Wallet, each learning-rate trial receives 2,048 updates and the final run receives 8,192 updates, giving 14,336 selection-and-training updates per method and run. Table 15 reports means and sample standard deviations over three runs, scaled so that the scratch mean under this schedule is 100 for each metric.

ModelAP ↑AUROC ↑[email protected]% ↑
Scratch100.0±156.1100.0±25.4100.0±36.1
TRIDENT-Seq178.8±94.8115.4±18.2252.7±48.4

Table 15. Longer adaptation on full-label Wallet, relative to scratch.

Case Inspection Details

The region in Figure 4 is a post-hoc 55%-peak class-density contour on a fixed 140×140 Gaussian KDE grid over t-SNE. It includes 374 histories; the 2,312-history comparison set excludes the surrounding island. Feedback statistics use 361 and 916 annotated event pairs, respectively. Merchant links and outcomes come from event inspection and are not encoder inputs.

Reporting Delays and SME CB Estimates

Table 16 reports business-reporting delays for April–May 2026 transaction cohorts, using labels observed in the October 26 extract. Percentages count valid observed labels; future unreported labels are excluded. Fraud union combines bank-reported fraud and fraud chargebacks.

CohortLabel30d60d90d120dD95D99
AprilUnion67.1685.2993.5497.9099148
CB65.4185.3194.3499.3793119
MayUnion64.0986.0694.2898.7092124
CB63.0285.3494.5199.4392117
Apr–MayUnion65.5385.7093.9398.3295135
CB64.1485.3294.4399.4092119

Table 16. Observed label-reporting delays (%); D95/D99 in days.

DataLabelsAP: TRIDENT-SeqAP: Scratch[email protected]%: TRIDENT-Seq[email protected]%: Scratch
Shopping1%0.2344±0.10870.2609±0.04963.31±2.184.76±0.38
5%0.3546±0.09390.3049±0.07035.87±1.625.11±1.46
10%0.4331±0.07350.3067±0.03756.61±1.164.79±0.51
25%0.5246±0.05660.3591±0.05978.33±1.015.68±1.73
100%0.5678±0.04870.4205±0.06609.61±0.737.81±1.76
SME1%0.3684±0.07590.2853±0.02724.84±0.474.50±1.13
5%0.5292±0.00970.4109±0.02406.19±2.045.44±0.30
10%0.4886±0.06720.3476±0.07989.14±1.854.67±0.51
25%0.6928±0.09650.4103±0.049410.16±2.055.04±1.25
100%0.8685±0.15530.6370±0.080514.34±0.428.11±1.25

Table 13. Shopping and SME results across label budgets (%).

Table 17 uses 66 common SME transaction dates, with amounts recorded by October 25. Pooled rates divide total CB by total successful amount. Date-weighted rates average daily CB rates using combined daily successful amounts across arms as common

Variant10% labels: AP10% labels: AUROC10% labels: [email protected]%100% labels: AP100% labels: AUROC100% labels: [email protected]%
Full PFC0.837391.4624.621.272591.6328.44
PFC only0.591390.3314.370.370391.0516.07
w/o activity0.650891.4115.100.439992.1216.38
w/o dispersion0.792192.0516.140.415393.3517.21

Table 14. Wallet ablation: AP, AUROC, and [email protected]% (%).

weights. Approximate 95% CIs use 50,000 paired resamples of 10 calendar-week blocks for the observed snapshot.

References

  1. [1]John Affaki. 2025. Using AI to Optimize Payments Performance with the Payments Intelligence Suite. Stripe Blog. https://stripe.com/blog/using-ai-optimize-payments-performance-payments-intelligence-suite
  2. [2]Dmitrii Babaev et al. 2022. CoLES: Contrastive Learning for Event Sequences with Self-Supervision. In Proceedings of the 2022 International Conference on Management of Data. ACM, New York, NY, USA, 1190–1199. doi:10.1145/3514221.3526129DOI
  3. [3]Alejandro Correa Bahnsen, Djamila Aouada, Aleksandar Stojanovic, and Björn Ottersten. 2016. Feature Engineering Strategies for Credit Card Fraud Detection. Expert Systems with Applications 51 (2016), 134–142.DOI
  4. [4]Adrien Bardes, Jean Ponce, and Yann LeCun. 2022. VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learning. In ICLR.arxiv.org/abs/2105.04906
  5. [5]Burton H. Bloom. 1970. Space/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM 13, 7 (1970), 422–426.DOI
  6. [6]Fabrizio Carcillo, Andrea Dal Pozzolo, Yann-Aël Le Borgne, Olivier Caelen, Yann-Isma Zgr, and Gianluca Bontempi. 2018. SCARFF: A Scalable Framework for Streaming Credit Card Fraud Detection with Spark. Information Fusion 41 (2018), 182–194.DOI
  7. [7]Chiao-Ting Chen, Chi Lee, Szu-Hao Huang, and Wen-Chih Peng. 2024. Credit Card Fraud Detection via Intelligent Sampling and Self-supervised Learning. ACM Transactions on Intelligent Systems and Technology 15, 2, Article 35 (2024), 29 pages. doi:10.1145/3641283DOI
  8. [8]Tianqi Chen and Carlos Guestrin. 2016. XGBoost: A Scalable Tree Boosting System. In KDD. 785–794.DOI
  9. [9]Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020. A Simple Framework for Contrastive Learning of Visual Representations. In ICML. 1597–1607.arxiv.org/abs/2002.05709
  10. [10]Raghu Chetlapalli and Wen Yao. 2026. Learning the Grammar of Money with a Sequential Foundation Model. Plaid Engineering Blog. https://plaid.com/blog/sequential-foundation-model/
  11. [11]Andrea Dal Pozzolo et al. 2018. Credit Card Fraud Detection: A Realistic Modeling and a Novel Learning Strategy. IEEE Transactions on Neural Networks and Learning Systems 29, 8 (2018), 3784–3797.DOI
  12. [12]Jesse Davis and Mark Goadrich. 2006. The Relationship Between Precision-Recall and ROC Curves. In ICML. 233–240.DOI
  13. [13]Yingtong Dou et al. 2026. TransactionGPT: Toward Foundational Transaction Modeling. In Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining. V.2. ACM, New York, NY, USA, 7185–7196. doi:10.1145/3770855.3818496DOI
  14. [14]Yingtong Dou, Zhiwei Liu, Li Sun, Yutong Deng, Hao Peng, and Philip S. Yu. 2020. Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters. In CIKM. 315–324.DOI
  15. [15]Zichuan Fu, Xiangyang Li, Chuhan Wu, Yichao Wang, Kuicai Dong, Xiangyu Zhao, Mengchen Zhao, Huifeng Guo, and Ruiming Tang. 2025. A Unified Framework for Multi-Domain CTR Prediction via Large Language Models. ACM Transactions on Information Systems 43, 5, Article 117 (2025).
  16. [16]Yuqi Gong et al. 2023. An Unified Search and Recommendation Foundation Model for Cold-Start Scenario. arXiv:2309.08939.DOI
  17. [17]Jean-Bastien Grill et al. 2020. Bootstrap Your Own Latent: A New Approach to Self-Supervised Learning. In NeurIPS.
  18. [18]Sepp Hochreiter and Jürgen Schmidhuber. 1997. Long Short-Term Memory. Neural Computation 9, 8 (1997), 1735–1780.
  19. [19]D. G. Horvitz and D. J. Thompson. 1952. A Generalization of Sampling Without Replacement from a Finite Universe. J. Amer. Statist. Assoc. 47, 260 (1952), 663–685.DOI
  20. [20]Yupeng Hou, Shanlei Mu, Wayne Xin Zhao, Yaliang Li, Bolin Ding, and Ji-Rong Wen. 2022. Towards Universal Sequence Representation Learning for Recommender Systems. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM, New York, NY, USA, 585–593. doi:10.1145/3534678.3539381DOI
  21. [21]Chris Jin. 2026. Fraud Foundation Model: The Next Chapter in Fraud Prevention for Plaid. Plaid Blog. https://plaid.com/blog/introducing-fraud-foundation-model-for-protect/
  22. [22]Johannes Jurgovsky et al. 2018. Sequence Classification for Credit-Card Fraud Detection. Expert Systems with Applications 100 (2018), 234–245.DOI
  23. [23]Seyed Mehran Kazemi et al. 2019. Time2Vec: Learning a Vector Representation of Time. arXiv:1907.05321.arxiv.org/abs/1907.05321
  24. [24]Ian Keil, Vangro, and Jan Grau. 2014. Area under Precision-Recall Curves for Weighted and Unweighted Data. PLOS ONE 9, 3 (2014), e92209.
  25. [25]Ron Kohavi, Randal M. Henne, and Dan Sommerfield. 2007. Practical Guide to Controlled Experiments on the Web: Listen to Your Customers not to the HiPPO. In KDD. 959–967.
  26. [26]Guilin Li et al. 2025. PANTHER: Generative Pretraining Beyond Language for Sequential User Behavior Modeling. In Advances in Neural Information Processing Systems, Vol. 38. Neural Information Processing Systems Foundation, 181532–181553. doi:10.52202/085713-5462DOI
  27. [27]Mingfu Liang et al. 2025. External Large Foundation Model: How to Efficiently Serve Trillions of Parameters for Online Ads Recommendation. In Companion Proceedings of the ACM on Web Conference 2025. ACM, New York, NY, USA, 344–353. doi:10.1145/3701716.3715223DOI
  28. [28]Yang Liu, Xiang Ao, Zidi Qin, Jianfeng Chi, Jinghua Feng, Hao Yang, and Qing He. 2021. Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud Detection. In WWW. 3168–3177.DOI
  29. [29]Ziqi Liu, Chaochao Chen, Xinxing Yang, Jun Zhou, Xiaolong Li, and Le Song. 2018. Heterogeneous Graph Neural Networks for Malicious Account Detection. In CIKM. 2077–2085.arxiv.org/abs/2002.12307
  30. [30]Ilya Loshchilov and Frank Hutter. 2017. SGDR: Stochastic Gradient Descent with Warm Restarts. In ICLR.arxiv.org/abs/1608.03983
  31. [31]Ilya Loshchilov and Frank Hutter. 2019. Decoupled Weight Decay Regularization. In ICLR.
  32. [32]Maxim Ostroukhhov et al. 2026. PRAGMA: Revolut Foundation Model. arXiv:2604.08649. doi:10.48550/arXiv.2604.08649DOI
  33. [33]Inkit Padhi et al. 2021. Tabular Transformers for Modeling Multivariate Time Series. In ICASSP. 3565–3569.arxiv.org/abs/2011.01843
  34. [34]Sinno Jialin Pan and Qiang Yang. 2010. A Survey on Transfer Learning. IEEE TKDE 22, 10 (2010), 1345–1359.DOI
  35. [35]Joshua W. Robinson, Li Sun, Ke Yu, Kayhan Batmanghelich, Stefanie Jegelka, and Suvrit Sra. 2021. Contrastive Learning with Hard Negative Samples. In ICLR.arxiv.org/abs/2010.04592
  36. [36]Joshua W. Robinson, Li Sun, Ke Yu, Kayhan Batmanghelich, Stefanie Jegelka, and Suvrit Sra. 2021. Can Contrastive Learning Avoid Shortcut Solutions? In NeurIPS.arxiv.org/abs/2106.11230
  37. [37]Takaya Saito and Marc Rehmsmeier. 2015. The Precision-Recall Plot Is More Informative than the ROC Plot When Evaluating Binary Classifiers on Imbalanced Datasets. PLOS ONE 10, 3 (2015), e0118432.DOI
  38. [38]D. Sculley et al. 2015. Hidden Technical Debt in Machine Learning Systems. In Advances in Neural Information Processing Systems, Vol. 28. 2503–2511.
  39. [39]Hajime Senuma. 2025. mmh3: A Python extension for MurmurHash3. Journal of Open Source Software 10, 105 (2025), 6124. doi:10.21105/joss.06124DOI
  40. [40]Piotr Skalski et al. 2023. Towards a Foundation Purchasing Model: Pretrained Generative Autoregression on Transaction Sequences. In Proceedings of the Fourth ACM International Conference on AI in Finance. ACM, New York, NY, USA, 141–149. doi:10.1145/3604237.3626850DOI
  41. [41]Gowthami Somepalli, Micah Goldblum, Avi Schwarzschild, C. Bayan Bruss, and Tom Goldstein. 2021. SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Training. arXiv:2106.01342.
  42. [42]Dan Svenstrup, Jonas Milentsev Hansen, and Ole Winther. 2017. Hash Embeddings for Efficient Word Representations. In Advances in Neural Information Processing Systems, Vol. 30. 4928–4936.
  43. [43]Aaron van den Oord, Yazhe Li, and Oriol Vinyals. 2018. Representation Learning with Contrastive Predictive Coding. arXiv:1807.03748.arxiv.org/abs/1807.03748
  44. [44]Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing Data using t-SNE. JMLR 9 (2008), 2579–2605.
  45. [45]Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017. Attention Is All You Need. In Advances in Neural Information Processing Systems, Vol. 30. 5998–6008.arxiv.org/abs/1706.03762
  46. [46]Tongzhou Wang and Phillip Isola. 2020. Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hypersphere. In ICML. 9929–9939.arxiv.org/abs/2005.10242
  47. [47]Kilian Weinberger, Anirban Dasgupta, John Langford, Alex Smola, and Josh Attenberg. 2009. Feature Hashing for Large Scale Multitask Learning. In ICML. 1113–1120.arxiv.org/abs/0902.2206
  48. [48]Weicheng Wu, Xiaolu Zhang, Jun Zhou, Yuchen Li, and Wenwen Xia. 2025. Bootstrapping Your Behavior: A New Pretraining Strategy for User Behavior Sequence Data. arXiv:2506.11053. doi:10.48550/arXiv.2506.11053DOI
  49. [49]Zhihan Yue, Yujing Wang, Juanyong Duan, Tianmeng Yang, Congrui Huang, Yunhai Tong, and Bixiong Xu. 2022. TS2Vec: Towards Universal Representation of Time Series. In AAAI. 8980–8987.
  50. [50]Zhongjian Zhang, Mengmei Zhang, Dehua Xu, Rongjun Shi, Jiafeng Liu, Fuli Meng, Huajian Xu, Xiao Wang, Ruijia Wang, Junze Chen, Minwei Tang, and Chuan Shi. 2026. FRiskGPT: A Generative Foundation Model for Financial Risk Detection. In Proceedings of the ACM Web Conference 2026. ACM, New York, NY, USA, 7733–7744. doi:10.1145/3774904.3792832

Paper details

vlnc:W_49f3mtgq
Version
v2 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents