A Filtered Mixture-of-Generators for Fully Synthetic Survival Training


1 Introduction↩︎

Survival models guide clinical decision-making across oncology, cardiology, transplantation, and other specialties, supporting treatment stratification, follow-up scheduling, and clinical-trial design [1], [2]. Their inputs are right-censored time-to-event data: tuples of covariates, observed time, and an event indicator, with the event time only partially known for subjects still under observation at study end [3], [4]. Training survival models is constrained by structural properties of the data itself: clinically meaningful events accrue only over years of follow-up, which keeps cohort sizes small, and privacy regulations restrict sharing across institutions. These constraints make the curation of a sufficiently large training cohort the slowest and most expensive step in deploying a survival model in practice.

Synthetic tabular generation has been proposed as a remedy, with model fidelity steadily improving across the heterogeneous architectures developed for structured data. In principle, a high-quality synthetic cohort serves two complementary roles: augmenting scarce real-data training sets to improve downstream model robustness, and enabling cohort sharing across institutions without disclosing patient-level records [5]. The viability of either role depends on whether synthetic data, when substituted for real training data, preserves the downstream task performance achievable on real data.

Yet tabular generative approaches remain imperfect even on large-scale datasets, and the relatively small cohorts typical of survival data amplify the problem. With few examples, generators cannot learn a faithful representation of the underlying population distribution, and the resulting synthetic data fails to cover the regions of the data manifold on which downstream models depend. Train-on-synthetic, test-on-real (TSTR) evaluation with single generative models consistently underperforms training on real data, both in survival generation [6], [7] and in broader tabular and image domains [8], [9]. Closing this gap requires reframing the construction of a synthetic survival training set: not as the output of a single generator, but as a selection problem optimized against the downstream task it is meant to serve.

We introduce FoGS (Filtered Mixture-of-Generators for Survival analysis): a two-level pipeline that reframes synthetic-data construction as a sample-selection problem rather than a sample-generation problem. A heterogeneous pool of synthetic samples is drawn from four architecturally distinct tabular generators, and each sample is scored by an ensemble of survival models trained on real data. An outer optimization loop tunes the selection policy (generator quotas, scorer weights, a random complement, and stratified balancing) against held-out downstream performance, while an inner loop reproduces the standard survival-modeling pipeline a practitioner would apply to the resulting synthetic dataset (Fig. 1). This nested design ensures the outer-loop signal reflects the downstream utility actually obtainable in standard practice. On 16 public survival datasets, FoGS improves both downstream metrics on 9 cohorts and at least one on 13, matching or exceeding real-data training on most of the collection and supporting synthetic data as a substitute for real cohorts in privacy-restricted clinical settings.

This paper makes three contributions. First, we introduce FoGS, to our knowledge the first pipeline that optimizes synthetic-data construction for survival analysis, recasting the problem as sample selection over a heterogeneous generator pool, driven by a per-sample plausibility signal. Second, we benchmark FoGS across 16 public survival datasets, demonstrating improvements in downstream performance on the majority of cohorts. Third, we identify two structural phenomena that govern synthetic-data selection in this regime: a trade-off between per-sample plausibility and population coverage, and a dataset-dependence under which no single strategy prevails across cohorts.

Table 1: Statement of significance
Problem or issue Survival models for clinical decision-making require large training cohorts, but events accrue over years, cohorts stay small, and privacy rules restrict cross-institution data sharing.
What is already known Tabular generative models can produce synthetic cohorts, but a single generator trained on small survival data yields synthetic sets whose train-on-synthetic, test-on-real utility falls below real-data training.
What this paper adds FoGS reframes synthetic-data construction as sample selection over a pool of four heterogeneous generators, scoring each sample with real-data survival models and tuning the selection policy against downstream utility. It matches or exceeds real-data training on most of 16 public datasets without degrading the nearest-neighbour privacy margin.
Who would benefit Clinical researchers and data scientists building survival models from scarce, privacy-restricted cohorts, and institutions seeking to share synthetic cohorts safely.

2 Related Work↩︎

2.1 Synthetic Tabular Generation↩︎

Tabular data generation has been approached through several distinct directions: explicit factorization via Bayesian networks [10], adversarial training in GAN-family architectures including ADS-GAN [5] and CTGAN [11], and latent-variable modelling via variational autoencoders [12], [13]. More recently, invertible transformations via normalizing flows [14], denoising diffusion [15], [16], and non-parametric density estimation via adversarial random forests [17] have extended this landscape. Quality has improved steadily across paradigms, yet no single architecture dominates across tabular structures, with each capturing different aspects of feature dependence. FoGS exploits this fragmentation by pooling samples from four generators spanning these families: a Bayesian network [10], [18], adversarial random forests [17], TabDDPM [16], and a survival-aware CTGAN variant [6]. FoGS leverages their complementary inductive biases rather than committing to any one.

2.2 Synthetic Survival Generation and Utility Evaluation↩︎

Survival generation must reproduce both covariates and the censored time-to-event signal, and existing approaches handle censoring in two distinct ways. Dedicated architectures are primarily GAN-based, with SurvivalGAN as the canonical instance [6]. These models handle censoring explicitly: covariates are generated by a GAN component and event times are derived through a separate survival head. General-purpose tabular generators have instead been adapted to survival by jointly estimating the event indicator and observed time alongside the covariates, absorbing censoring into the joint distribution rather than modelling it explicitly [7]. TSTR utility under either strategy is commonly reported below real-data baselines, and evaluation practice treats utility as a post-hoc quality-control measurement [7]. FoGS departs from both lines: rather than introducing a new survival-specific generator or treating utility as a post-hoc check, it composes generators of both kinds and reframes synthetic dataset construction as policy-tuned selection over their pooled output. TSTR utility is treated as the outer optimization objective.

3 Method↩︎

FoGS constructs a high-utility synthetic survival training set by generating and selecting the samples that best serve a downstream survival model. We cast this as a two-level optimization (Fig. 1): an outer level searches over selection policies to maximize downstream utility on real data, and an inner level trains a representative downstream model to guide the outer search.

Figure 1: Overview of the FoGS pipeline. Stage 1 (left) draws a candidate pool from the four generators and scores every sample with the survival-model ensemble trained on the real cohort. Stage 2 (right) filters the pool under the selection policy and trains the downstream model, with the two-level optimization driven by feedback on the real validation split.

3.1 Synthetic Data and Generator Pool↩︎

Let \(\mathcal{D}_r = \{(\mathbf{x}_i, t_i, \delta_i)\}_{i=1}^{N_r}\) denote the real training split, with \(\mathbf{x}_i\) features, \(t_i\) observed time, and \(\delta_i\) event indicator. \(\mathcal{D}_r\) is held out from the validation and test splits, used respectively for hyperparameter tuning and final out-of-sample evaluation. FoGS starts from a generator pool \(\mathcal{G}\), where each generator \(g \in \mathcal{G}\) is trained on \(\mathcal{D}_r\) and defines a sampling distribution over synthetic instances. From each \(g\) we draw a candidate pool \(\mathcal{D}_g\) of size \(N_g = \lceil\kappa\,N_r\rceil\), where \(\kappa \geq 1\) controls the size of the candidate pool relative to the real cohort. The union \(\mathcal{D}_{\mathrm{synth}} = \bigcup_{g \in \mathcal{G}} \mathcal{D}_g\) is the candidate set. In our experiments, the generator pool is instantiated with four generators spanning the principal paradigms of tabular generation—explicit factorization, adversarial training, denoising diffusion, and non-parametric density estimation—so that \(\mathcal{D}_{\mathrm{synth}}\) is not tied to the inductive bias of any single generator. The generators included in \(\mathcal{G}\) are the following:

  • ARF [17]: non-parametric density estimation via iterative adversarial training of a random-forest classifier, appropriate for mixed continuous and categorical features.

  • Bayesian Network [10], [18]: explicit factorization with hill-climbing structure learning, providing an interpretable factorized representation with native support for discrete variables.

  • TabDDPM [16]: denoising diffusion with multinomial and Gaussian forward processes for categorical and numerical features respectively.

  • SurvivalCTGAN: CTGAN [11] adapted to censored survival data following SurvivalGAN methodology [6], with features generated by the GAN component and event times derived through a survival head.

3.2 Per-Sample Plausibility Scoring↩︎

After generating \(\mathcal{D}_{\mathrm{synth}}\), FoGS uses a set of survival models, defined as scorers, to assess the plausibility of each synthetic sample. Let \(\mathcal{M}\) be the scorer pool. Each scorer \(m \in \mathcal{M}\), trained on \(\mathcal{D}_r\), assigns to the \(i\)-th synthetic sample two per-sample losses, the integrated Brier score (IBS) \(\ell_{m,\mathrm{IBS},i}\) and the negative log-likelihood (NLL) \(\ell_{m,\mathrm{NLL},i}\). Both IBS and NLL are proper scoring rules [19], [20], whose expected per-sample value is minimized exactly at the true conditional distribution. A sample to which a real-data-trained scorer assigns low loss is therefore plausible with respect to the real population.

In our experiments, the scorer pool is instantiated with seven survival models—Cox [3], DeepSurv [21], DeepHit [22], RSF [23], FPBoost [24], XGBoost-Cox [25], and a weighted ensemble of the previous six—covering linear, tree-based, and neural survival methods. Training and hyperparameter tuning are performed once per dataset.

3.3 Selection Policy↩︎

The filtered synthetic dataset is \[\mathcal{D}_s^{*} \;=\; \Phi(\mathcal{D}_{\mathrm{synth}};\, \pi), \label{eq:framework}\tag{1}\] where \(\Phi\) is a selection operator defined by a policy vector \[\pi \;=\; \big(\{p_g\},\; \{w_{m,k}\},\; \rho,\; \mathrm{bal}_t,\; \mathrm{bal}_c\big). \label{eq:policy}\tag{2}\] Here, \(\pi\) collects the sample-selection parameters. The quotas \(p_g \in [0,1]\), for each \(g \in \mathcal{G}\), set the number of samples drawn from each candidate pool \(\mathcal{D}_g\) as \(\lceil p_g\,N_g\rceil\). Each sample is assigned an aggregated composite loss \[\mathcal{L}_i \;=\; \frac{\sum_{m,k}\, w_{m,k}\, \ell_{m,k,i}}{\sum_{m,k}\, w_{m,k}}, \label{eq:perSampleLoss}\tag{3}\] where \(m \in \mathcal{M}\) are the scorer survival models, \(\ell_{m,k,i}\) is the per-sample loss of type \(k\in \{\mathrm{IBS}, \mathrm{NLL}\}\), and \(w_{m,k} \in [0,1]\) the aggregation weights from \(\pi\).

Within each per-generator draw, a fraction \((1-\rho)\) is selected deterministically among the most plausible samples, and the remaining fraction is drawn uniformly at random from the leftover pool. Thus, the selected set is \[\mathcal{D}_s^{*} \;=\; \bigcup_{g \in \mathcal{G}} ( \mathcal{T}_g \cup \mathcal{R}_g ), \label{eq:selection}\tag{4}\] where \(\mathcal{T}_g\) is selected so that \(\lvert\mathcal{T}_g\rvert = \lceil(1-\rho)\,p_g\,N_g\rceil\), and \(\mathcal{R}_g\) is sampled uniformly from \(\mathcal{D}_g \setminus \mathcal{T}_g\), with \(\lvert\mathcal{R}_g\rvert = \lfloor\rho\,p_g\,N_g\rfloor\). The fraction \(\rho\) thus tunes how strongly selection relies on plausibility versus uniform coverage.

Finally, the flags \(\mathrm{bal}_t, \mathrm{bal}_c \in \{0, 1\}\) optionally constrain the selection to be stratified: \(\mathrm{bal}_t\) enables stratification with respect to the event-time distribution of \(\mathcal{D}_r\), while \(\mathrm{bal}_c\) stratifies with respect to the censoring rate.

3.4 Two-Level Optimization↩︎

At a high level, FoGS optimizes the selection policy \(\pi\) with two nested optimizations. The inner optimization mimics a practitioner training a representative survival model and provides feedback for the outer policy search; at convergence, \(\pi\) is the selection policy under which a generic survival model attains its best validation performance.

In particular, the inner loop trains a downstream survival model \(\sigma_\theta\) on the selected set \(\mathcal{D}_s^{*}\) and tunes its hyperparameters \(\theta\). In our experiments, the downstream model is instantiated as XGBoost-Cox [25], a strong and widely-used tabular survival model that serves as an efficient, representative proxy for a standard survival pipeline. Although XGBoost-Cox also appears in the scorer pool \(\mathcal{M}\), the two roles are distinct: scorers are trained on real data to rank synthetic candidates, whereas the downstream model is trained on the selected synthetic set. The inner loop returns \[\theta^{*} \;=\; \arg\max_{\theta} \big( \mathrm{C}_{\mathrm{val}}(\sigma_\theta) \;-\; 2\,\mathrm{IBS}_{\mathrm{val}}(\sigma_\theta) \big), \label{eq:innerObj}\tag{5}\] where \(\mathrm{C}_{\mathrm{val}}\) and \(\mathrm{IBS}_{\mathrm{val}}\) are the concordance index and IBS of \(\sigma_\theta\) computed on the real validation split. The factor of 2 normalizes the two metrics to comparable scales.

The outer loop, instead, optimizes the selection policy \[\pi^{*} \;=\; \arg\min_{\pi} \;\mathrm{IBS}_{\mathrm{val}}\big( \sigma_{\theta^{*}} \big), \label{eq:outerObj}\tag{6}\] where, for each \(\pi\), the candidate set is filtered into \(\mathcal{D}_s^{*} = \Phi(\mathcal{D}_{\mathrm{synth}};\, \pi)\), the inner loop 5 yields \(\theta^{*}\) on \(\mathcal{D}_s^{*}\), and the resulting model \(\sigma_{\theta^{*}}\) is evaluated on the real validation split. We adopt \(\mathrm{IBS}_{\mathrm{val}}\) as the outer objective, in preference to \(\mathrm{C}_{\mathrm{val}}\) alone or the composite \(\mathrm{C}_{\mathrm{val}} - 2\,\mathrm{IBS}_{\mathrm{val}}\). This choice is verified empirically on three representative datasets in Appendix 9. Both loops are optimized using Optuna [26] under a Tree-structured Parzen Estimator (TPE) sampler.

4 Experiments and Results↩︎

4.1 Experimental Setup↩︎

We evaluate FoGS on 16 public survival datasets spanning oncology, cardiology, and clinical-trial cohorts, with cohort sizes, feature counts, event rates, and missingness varying widely across the collection; aggregated per-dataset statistics are reported in Appendix 10 (Table 5). Each dataset is split into training, validation, and test with a 60-20-20 proportion, and generators and scorers are fit on the training partition only. FoGS produces \(\mathcal{D}_s^{*}\) via the pipeline of Section 3, after which the inner loop trains the downstream XGBoost-Cox model on \(\mathcal{D}_s^{*}\); the final model is evaluated on the held-out real test set by Harrell’s C-index [27] and IBS [19]. Both metrics are always reported on a 0-100 scale instead of a 0-1 scale to improve readability. Synthetic-data privacy, instead, is assessed by the nearest-neighbour distance ratio (NNDR), \[\mathrm{NNDR}(x^{\mathrm{syn}}) \;=\; \frac{d_1(x^{\mathrm{syn}}, \mathcal{D}_r)}{d_2(x^{\mathrm{syn}}, \mathcal{D}_r)}, \label{eq:nndr}\tag{7}\] the ratio of the Euclidean distances from a synthetic sample to its first- and second-nearest real neighbours in \(\mathcal{D}_r\), where a lower value indicates a smaller nearest-neighbour privacy margin. The FoGS configuration adopts \(\lvert\mathcal{G}\rvert = 4\) generators, \(\lvert\mathcal{M}\rvert = 7\) scorers, and pool multiplier \(\kappa = 100\); for each dataset we run 300 outer trials over the 21-parameter policy search space, each with 100 inner XGBoost-Cox configurations (Appendix 8).

4.2 Downstream Utility↩︎

Under TSTR with the XGBoost-Cox downstream model (Table ¿tbl:tab:results?, Fig. 2), FoGS improves both metrics on \(9/16\) datasets and at least one on \(13/16\), with a C-index tie on breast_cancer; only whas, aids, and prostate improve on neither. Median gains are \(\Delta\mathrm{C}=+0.99\) and \(\Delta\mathrm{IBS}=+0.50\) (means \(+2.17\) and \(+0.67\)). A one-sided Wilcoxon signed-rank test over the 16 paired differences gives \(p=0.039\) (\(\Delta\mathrm{C}\)) and \(p=0.035\) (\(\Delta\mathrm{IBS}\)).

Figure 2: Per-dataset change of FoGS over the real-data baseline, \Delta\mathrm{C} (horizontal) against \Delta\mathrm{IBS} (vertical), one point per dataset. The shaded upper-right quadrant contains the datasets that improve on both metrics; breast_cancer lies on the \Delta\mathrm{C}=0 axis.

Two ablations on the same candidate pool isolate the contribution of the generator pool and of the selection policy. Restricting FoGS to a single generator lowers aggregate utility below the full four-generator pool: the strongest single generator (ARF) reaches \(\Delta\mathrm{C}=+1.48\) and \(\Delta\mathrm{IBS}=+0.51\) against \(+2.17\) and \(+0.67\) for the pool, and the per-dataset best generator is split across all four (Tables ¿tbl:tab:ablation-aggregate? and 8). Replacing the selection policy with a random draw of equal size from the pool drops utility below the real-data baseline (\(\Delta\mathrm{C}=-0.50\), \(\Delta\mathrm{IBS}=-0.35\)); measured directly against this random baseline, FoGS gains \(\Delta\mathrm{C}=+2.67\) (\(13/16\) datasets, \(p=0.007\)) and \(\Delta\mathrm{IBS}=+1.03\) (\(11/16\), \(p=0.018\)) (Table ¿tbl:tab:results95unfiltered?).

The outer objective is examined on three representative datasets (metabric, pbc, gbsg): minimizing \(\mathrm{IBS}_{\mathrm{val}}\) yields the strongest aggregate on both metrics (\(\Delta\mathrm{C}=+2.87\), \(\Delta\mathrm{IBS}=+1.03\)), ahead of the composite \(\mathrm{C}_{\mathrm{val}}-2\,\mathrm{IBS}_{\mathrm{val}}\) (\(+1.48\), \(+0.78\)) and of maximizing \(\mathrm{C}_{\mathrm{val}}\) (\(-0.55\), \(-0.26\)) (Table 4).

@l*7Y@ & & &
(lr)2-4 (lr)5-7 (lr)8-8 Dataset & Real & FoGS & \(\boldsymbol{\Delta}\) & Real & FoGS & \(\boldsymbol{\Delta}\) & FoGS
gbsg & \(\mathbf{70.05}\) & \(69.72\) & \(-0.33\) & \(10.55\) & \(\mathbf{9.99}\) & \(+0.56\) & \(74.30\)
metabric & \(61.73\) & \(\mathbf{64.28}\) & \(+2.55\) & \(10.87\) & \(\mathbf{9.91}\) & \(+0.96\) & \(80.79\)
whas & \(\mathbf{75.19}\) & \(73.28\) & \(-1.92\) & \(\mathbf{10.61}\) & \(11.08\) & \(-0.47\) & \(85.20\)
aids & \(\mathbf{71.88}\) & \(63.23\) & \(-8.65\) & \(\mathbf{4.68}\) & \(4.75\) & \(-0.07\) & \(82.49\)
breast_cancer & \(\mathbf{71.65}\) & \(\mathbf{71.65}\) & \(0.00\) & \(8.85\) & \(\mathbf{7.87}\) & \(+0.98\) & \(71.41\)
cost & \(66.39\) & \(\mathbf{67.45}\) & \(+1.06\) & \(16.52\) & \(\mathbf{16.45}\) & \(+0.07\) & \(57.44\)
d_oropha_rec & \(56.17\) & \(\mathbf{56.49}\) & \(+0.32\) & \(\mathbf{15.92}\) & \(16.40\) & \(-0.49\) & \(64.31\)
hepatocellular & \(60.86\) & \(\mathbf{76.91}\) & \(+16.06\) & \(14.50\) & \(\mathbf{11.25}\) & \(+3.25\) & \(84.13\)
melanoma & \(82.02\) & \(\mathbf{82.94}\) & \(+0.92\) & \(9.28\) & \(\mathbf{7.41}\) & \(+1.88\) & \(71.02\)
mgus & \(70.78\) & \(\mathbf{71.31}\) & \(+0.53\) & \(11.76\) & \(\mathbf{11.24}\) & \(+0.52\) & \(82.21\)
nki70 & \(71.82\) & \(\mathbf{74.55}\) & \(+2.73\) & \(\mathbf{10.36}\) & \(11.15\) & \(-0.79\) & \(70.57\)
pbc & \(78.04\) & \(\mathbf{84.43}\) & \(+6.40\) & \(8.54\) & \(\mathbf{6.96}\) & \(+1.58\) & \(59.98\)
pbc3 & \(77.87\) & \(\mathbf{80.98}\) & \(+3.11\) & \(6.59\) & \(\mathbf{6.33}\) & \(+0.26\) & \(79.22\)
prostate & \(\mathbf{60.45}\) & \(58.84\) & \(-1.61\) & \(\mathbf{17.46}\) & \(18.45\) & \(-0.99\) & \(90.50\)
stagec & \(61.86\) & \(\mathbf{70.16}\) & \(+8.30\) & \(13.32\) & \(\mathbf{10.27}\) & \(+3.05\) & \(70.52\)
uis & \(56.69\) & \(\mathbf{61.87}\) & \(+5.18\) & \(10.40\) & \(\mathbf{9.93}\) & \(+0.47\) & \(84.36\)
Mean & – & – & \(\boldsymbol{+2.17}\) & – & – & \(\boldsymbol{+0.67}\) & \(75.53\)
Median & – & – & \(\boldsymbol{+0.99}\) & – & – & \(\boldsymbol{+0.50}\) & \(76.76\)
\(p\) (Wilcoxon) & – & – & \(0.039\) & – & – & \(0.035\) & –
Wins & – & – & \(11/16\) & – & – & \(11/16\) & –

Figure 3: Best-trial selection policy for each of the 16 datasets. Top row: the four generator quotas p_g. Bottom row: the random complement \rho and the two stratification flags \mathrm{bal}_t and \mathrm{bal}_c. Binary panels are offset at zero for visibility.

4.3 Structure of the Selection Policy↩︎

The best-trial policies expose a consistent structure (Fig. 3, Table 6). The random-complement fraction \(\rho\) has mean \(0.36\) and saturates the upper bound of its search range (\(0.5\)) on \(6/16\) datasets, while pure top-loss selection (\(\rho=0\)) occurs only on cost; event-time and censoring stratification are each active on \(8/16\) datasets.

The scorer-loss weights, by contrast, do not concentrate on any single signal (Table 7, Fig. 4): the most frequent row-dominant combination (DeepSurv-NLL) leads on only \(3/16\) datasets, \(11\) of the \(14\) combinations are row-dominant on at least one dataset, five appear among the top three weights on at least five datasets, and the cross-dataset mean weights span a narrow \(0.046\)\(0.089\) band.

4.4 Nearest-Neighbour Privacy↩︎

The FoGS-filtered set has mean NNDR \(0.755\) (Eq. 7 ). Relative to the unfiltered (random) draw from the generator pool, the value is higher on \(12/16\) datasets (lower on the other four) and differs by \(+2.82\) on average, a difference that is not significant (\(p=0.087\)) (Table ¿tbl:tab:results95unfiltered?).

5 Discussion↩︎

Earlier survival generators produce synthetic data that underperforms real-data training under TSTR [6], [7]. FoGS reaches or exceeds the real-data baseline on most cohorts with the same generators, improving downstream utility by selecting among their outputs rather than by changing how those outputs are produced. Two ablations on the candidate pool locate the source of this improvement. The first isolates the generator pool: the four-generator pool outperforms every single-generator restriction (Table ¿tbl:tab:ablation-aggregate?), and although its margin over the strongest single generator (ARF) is modest, the per-dataset best generator varies across the four (Table 8), so pooling removes the need to identify the most suitable generator for a cohort in advance; Appendix 11 (Figs. 5 and 6) shows the real, FoGS-selected, and per-generator distributions side by side for every dataset. The second ablation isolates the selection policy: a random draw of equal size from the same pool falls below the real-data baseline (\(\Delta\mathrm{C}=-0.50\)), whereas the tuned policy converts the pool into a clear gain (\(\Delta\mathrm{C}=+2.17\)), an improvement of \(+2.67\) measured directly against the random draw (Table ¿tbl:tab:results95unfiltered?). The improvement over real-data training therefore originates in how samples are selected rather than in the generators themselves.

The optimal policies expose a quality–coverage trade-off. On all but one dataset the best policy retains a sizeable random fraction (mean \(\rho=0.36\)), and selecting exclusively the most plausible samples was optimal on a single cohort only. A plausible explanation is distributional: per-sample loss is lowest in the densest, most typical regions of the covariate space, so a purely top-ranked selection over-represents those regions and under-samples the rarer cases in the tails on which a survival model relies to generalize, while the random complement restores this coverage. The mean random fraction \(\rho=0.36\) stays well above zero across cohorts of widely differing size, dimensionality, and event rate suggests a broader behaviour: when synthetic samples are filtered by a plausibility score, a non-trivial degree of randomness is required to preserve population coverage.

A second pattern emerges in how the seven scorers combine in the selected policies. No fixed scorer–loss pairing prevails across datasets. In fact, we observe that no single pairing is the dominant one on more than \(3/16\) cohorts, and the weights averaged over all datasets are nearly uniform (Table 7). Within any single cohort, by contrast, the weight distribution is far from uniform: a few scorer–loss pairings carry most of the weight, but their identity changes from one cohort to the next. Because averaging across datasets hides these cohort-specific selections, the informative signal resides at the level of the individual dataset. This also indicates that the per-cohort tuning captures genuine structure rather than fitting validation noise. The weights consequently cannot be fixed a priori without degrading transfer to a new cohort, which is precisely why FoGS exposes them as parameters of the outer search.

The magnitude of the gain varies widely across cohorts (Fig. 2). Performance ranges from \(+16.06\) \(\Delta\mathrm{C}\) on hepatocellular to \(-8.65\) \(\Delta\mathrm{C}\) on aids. However, both of these extremes admit an interpretable explanation. hepatocellular is small (\(N=227\)), high-dimensional (\(P=43\)), and heavily incomplete (\(32.07\%\) missing), a setting in which the real-data XGBoost-Cox baseline overfits and the larger, smoother synthetic pool acts as a regularizer; aids, by contrast, has an event rate of only \(8.34\%\), so the generators observe too few events and the synthetic event-time signal degrades, biasing the downstream model toward predicting non-occurrence. To assess whether such outcomes are predictable from cohort properties, we examined the association between the per-dataset gain and cohort size, dimensionality, event rate, missingness, and real-data baseline difficulty; none showed a significant relationship with either the sign or the magnitude of the gain. The benefit of FoGS is thus broad but not deducible a priori from dataset structure.

The one-sided Wilcoxon test confirms the improvement over real-data training (\(p=0.039\) for \(\Delta\mathrm{C}\), \(p=0.035\) for \(\Delta\mathrm{IBS}\)). With the two most extreme datasets (hepatocellular and aids) excluded, the C-index gain remains significant under the two-sided test (\(p=0.033\)). The strongest evidence, however, comes from the comparison that isolates the selection policy: against a random draw from the same pool, FoGS improves the C-index by \(+2.67\) (\(p=0.007\)), a result that holds two-sided and remains significant under leave-one-cohort-out.

Finally, because plausibility-based selection draws the synthetic set toward the real records, and proximity to those records is what lowers the nearest-neighbour distance ratio, the fidelity gain might be expected to come at the cost of privacy margin. However, there is no significant statistical evidence for this pattern: on average the filtered set is no closer to the real cohort than an unfiltered draw (\(\Delta\,\mathrm{NNDR}=+2.82\), \(p=0.087\)). The tuned policy assigns consistent quota to ARF (Table 6), the generator that preserves the widest nearest-neighbour margin (Table ¿tbl:tab:ablation-aggregate?), and this allocation counterbalances the inward pull of low-loss selection. This compensation is only an aggregate effect: on the four cohorts where the filtered set sits closer to the real data than the random draw (gbsg, breast_cancer, cost, nki70; Table ¿tbl:tab:results95unfiltered?), the fidelity gain does come at the cost of a narrower privacy margin.

Aggregate utility and privacy of FoGS restricted to each single generator, of random sampling, and of the full four-generator pool. \(\Delta\mathrm{C}\) and \(\Delta\mathrm{IBS}\) are the mean per-dataset gains over the real-data baseline (\(\times 100\)); NNDR is the cohort-mean nearest-neighbour distance ratio.
Variant \(\boldsymbol{\Delta\mathrm{C}} \uparrow\) \(\boldsymbol{\Delta\mathrm{IBS}} \uparrow\) NNDR \(\uparrow\)
ARF \(+1.48\) \(+0.51\) \(\mathbf{89.2}\)
BN \(-1.64\) \(+0.14\) \(43.7\)
TabDDPM \(-0.44\) \(0.00\) \(73.0\)
SurvCTGAN \(-3.95\) \(-1.20\) \(85.4\)
Random Sampling \(-0.50\) \(-0.35\) \(72.7\)
FoGS \(\boldsymbol{+2.17}\) \(\boldsymbol{+0.67}\) \(75.5\)

6 Limitations and Future Directions↩︎

Generator quality on hard cohorts. Three of the 16 datasets (whas, aids, prostate) improve on neither metric, for two distinct reasons. The first is the capacity of the generators: in aggregate, only ARF yields an improvement over the real-data baseline among the single generators (Table ¿tbl:tab:ablation-aggregate?), and on whas and prostate even the full pool does not reproduce the data distribution closely enough to overtake real-data training. The second reason is intrinsic to the cohort: aids couples a very low event rate (\(8.34\%\)) with correspondingly heavy censoring, so the binding factor is the scarcity of observed events in the data itself rather than the fidelity of any generator.

A single optimization run per dataset. Each result is obtained from one outer-Optuna trajectory. The full pipeline couples four-generator and seven-scorer pretraining with a 300-trial policy search, which makes repeated runs across random seeds computationally impractical; we therefore report a single seeded run per dataset rather than a variance estimate over seeds. The fixed seed makes each reported result exactly reproducible, and quantifying the sensitivity of the per-dataset estimates to the seed is left to future work.

The policy search bounds the random fraction. The random complement \(\rho\) is searched only up to \(0.5\), and on 6 of the 16 datasets the optimum saturates this bound. On those cohorts the true optimum may therefore lie beyond \(0.5\), and because their values are truncated at the bound, the cross-dataset mean of \(0.36\) understates the randomness the policy favours and should be read as a lower bound.

A single downstream model. The selection policy is tuned exclusively against XGBoost-Cox. Although XGBoost-Cox is a strong, state-of-the-art tabular survival model, it remains a single choice of downstream learner: early experiments on a subset of datasets showed no significant difference in downstream model selection, but the tuned policy may still carry a bias toward XGBoost-Cox in the full experiment set.

Computational cost of the nested search. Because the two levels are nested, the cost of a single run is the product of the two trial budgets: every outer trial launches a full inner hyperparameter search to obtain an unbiased validation signal for its candidate policy, so the \(300\) outer and \(100\) inner trials amount to roughly \(3\times10^{4}\) downstream XGBoost-Cox fits per dataset. This is incurred on top of the one-time pretraining of the four generators and seven scorers and the scoring of the \(\kappa\lvert\mathcal{G}\rvert N_r\) candidate pool. The inner validation loop is the bottleneck and cannot be bypassed without biasing the outer objective. Cheaper surrogates for the inner loop would lower the cost, but each weakens the validation signal that drives the selection-policy search.

A single privacy proxy. Privacy is assessed only through the nearest-neighbour distance ratio. Membership-inference and attribute-inference attacks, and formal differential-privacy guarantees, lie outside the scope of this work.

Several of these limitations point directly to future work. The pool accepts new generators without any change to the pipeline, so the framework can track improvements in tabular generation and incorporate foundation-model-based survival scorers as they mature. Widening the policy search, and the range of \(\rho\) in particular, would locate the true coverage optimum on the cohorts that currently reach the bound. Because the framework does not depend on the downstream task, it extends beyond survival to other tabular clinical problems, including regression, class-imbalanced classification, and competing-risks modelling, as well as to other downstream survival models. Finally, a fuller privacy assessment, with inference attacks and formal guarantees, would define the conditions under which the released cohorts can be shared safely.

7 Conclusions↩︎

We presented FoGS, a pipeline that builds a synthetic survival training set by pooling four tabular generators, scoring every candidate sample with seven survival models trained on real data, and tuning the selection policy—generator quotas, scorer weights, stratification, and a random complement—against held-out real-validation performance through a two-level optimization. Across 16 public datasets FoGS matches or exceeds real-data training on most cohorts, and its comparison against random selection shows that the improvement comes from how the samples are selected rather than from the generators themselves. Two findings recur across datasets: a quality–coverage trade-off, which requires retaining a non-trivial random fraction so that the rare cases in the tails are not discarded, and a dataset-conditional structure in the scorer combination, under which the weighting of plausibility signals must be tuned per cohort rather than fixed in advance. The filtered cohorts show no significant change in nearest-neighbour privacy margin relative to unfiltered sampling. Because it requires only publicly available generators and standard survival scorers, FoGS can be directly applied to new cohorts.

8 Search Spaces and Per-Sample Loss Formulas↩︎

8.1 Outer-Optuna Search Space↩︎

The 21 policy parameters are jointly optimized over 300 trials per dataset by a TPE multivariate sampler with constant-liar for parallel-worker safety, seeded for reproducibility (Table 2).

8.2 Inner-Optuna Search Space↩︎

The downstream XGBoost-Cox model (objective survival:cox) is tuned over 100 trials per outer trial against \(\mathrm{C} - 2\,\mathrm{IBS}\) on real validation, with a fixed per-dataset seed (Table 3).

8.3 Per-Sample Loss Formulas↩︎

For a synthetic sample \(i = (\mathbf{x}_i, t_i, \delta_i)\) scored by model \(m\) with predicted survival function \(S_m(\cdot \mid \mathbf{x}_i)\), evaluated on a time grid \(\{\tau_1, \dots, \tau_K\}\) spanning \([0, \max(t_{\mathrm{real}})]\), the per-sample integrated Brier score is \[\begin{align} \mathrm{IBS}_{m,i} &= \frac{1}{K}\sum_{j=1}^{K} \mathrm{BS}_{m,i}(\tau_j), \label{eq:ibs95per95sample} \\ \mathrm{BS}_{m,i}(\tau_j) &= \mathbb{1}(t_i \le \tau_j, \delta_i = 1)\, S_m(\tau_j \mid \mathbf{x}_i)^2 \notag \\ &\quad + \mathbb{1}(t_i > \tau_j)\,\big(1 - S_m(\tau_j \mid \mathbf{x}_i)\big)^2. \notag \end{align}\tag{8}\] Inverse probability of censoring weighting (IPCW) is omitted to prevent inconsistent reweighting from repeated synthetic data sampling. The per-sample negative log-likelihood is \[\mathrm{NLL}_{m,i} = -\big[\, \delta_i \log h_m(t_i \mid \mathbf{x}_i) - H_m(t_i \mid \mathbf{x}_i) \,\big], \label{eq:nll95per95sample}\tag{9}\] where \(h_m\) and \(H_m\) are the hazard and cumulative hazard predicted by model \(m\); for models providing only \(S_m\), these are computed by finite-difference approximation on the time grid.

Table 2: Outer-Optuna search space (21 parameters). The 14 scorer weights are normalized by their sum, as in Eq. [eq:perSampleLoss].
Parameter Domain Range Interpretation
\(p_{\mathrm{ARF}}\) continuous \([0, 0.20]\) ARF quota
\(p_{\mathrm{BN}}\) continuous \([0, 0.20]\) Bayesian Network quota
\(p_{\mathrm{TabDDPM}}\) continuous \([0, 0.20]\) TabDDPM quota
\(p_{\mathrm{SurvCTGAN}}\) continuous \([0, 0.20]\) SurvivalCTGAN quota
\(w_{m,\mathrm{IBS}}\) continuous \([0, 1]\) 7 IBS weights
\(w_{m,\mathrm{NLL}}\) continuous \([0, 1]\) 7 NLL weights
\(\rho\) continuous \([0, 0.5]\) random complement
\(\mathrm{bal}_t\) binary \(\{0, 1\}\) event-time stratification
\(\mathrm{bal}_c\) binary \(\{0, 1\}\) censoring stratification
Table 3: Inner-Optuna search space for the downstream XGBoost-Cox model, identical for FoGS and the real-data baseline.
Parameter Domain Range Sampling
learning_rate continuous \([0.01, 0.3]\) log-uniform
max_depth integer \([3, 10]\) uniform
n_estimators integer \([50, 500]\) uniform (step 25)
subsample continuous \([0.5, 1.0]\) uniform
colsample_bytree continuous \([0.5, 1.0]\) uniform
gamma continuous \([0, 5]\) uniform
min_child_weight integer \([1, 10]\) uniform
reg_alpha continuous \([10^{-3}, 10]\) log-uniform
reg_lambda continuous \([10^{-3}, 10]\) log-uniform

9 Outer-Objective Ablation↩︎

Three representative datasets (metabric, pbc, gbsg) are evaluated under three outer-Optuna objectives: minimize \(\mathrm{IBS}_{\mathrm{val}}\) (the main pipeline), maximize the composite \(\mathrm{C}_{\mathrm{val}} - 2\,\mathrm{IBS}_{\mathrm{val}}\), and maximize \(\mathrm{C}_{\mathrm{val}}\). Each cell uses 300 outer trials with inner-Optuna XGBoost-Cox tuning identical to the search space of Appendix 8 (Table 4).

Table 4: Outer-objective ablation on three datasets under three outer objectives (\(300\) trials each): per-dataset real and FoGS values with the signed differences \(\Delta\) (\(\times 100\)), and the per-objective means.
Outer objective Dataset C-Real C-FoGS \(\boldsymbol{\Delta\mathrm{C}}\) IBS-Real IBS-FoGS \(\boldsymbol{\Delta\mathrm{IBS}}\)
Min \(\mathrm{IBS}_{\mathrm{val}}\) (main) gbsg \(70.05\) \(69.72\) \(-0.33\) \(10.55\) \(9.99\) \(+0.56\)
Min \(\mathrm{IBS}_{\mathrm{val}}\) (main) metabric \(61.73\) \(64.28\) \(+2.55\) \(10.87\) \(9.91\) \(+0.96\)
Min \(\mathrm{IBS}_{\mathrm{val}}\) (main) pbc \(78.04\) \(84.43\) \(+6.40\) \(8.54\) \(6.96\) \(+1.58\)
Mean (Min \(\mathrm{IBS}_{\mathrm{val}}\)) - - - \(\boldsymbol{+2.87}\) - - \(\boldsymbol{+1.03}\)
Max \(\mathrm{C}_{\mathrm{val}} - 2\,\mathrm{IBS}_{\mathrm{val}}\) gbsg \(70.05\) \(70.87\) \(+0.82\) \(10.55\) \(9.58\) \(+0.97\)
Max \(\mathrm{C}_{\mathrm{val}} - 2\,\mathrm{IBS}_{\mathrm{val}}\) metabric \(61.73\) \(61.36\) \(-0.37\) \(10.87\) \(10.67\) \(+0.20\)
Max \(\mathrm{C}_{\mathrm{val}} - 2\,\mathrm{IBS}_{\mathrm{val}}\) pbc \(78.04\) \(82.04\) \(+4.00\) \(8.54\) \(7.37\) \(+1.17\)
Mean (composite) - - - \(+1.48\) - - \(+0.78\)
Max \(\mathrm{C}_{\mathrm{val}}\) gbsg \(70.05\) \(68.06\) \(-1.98\) \(10.55\) \(11.02\) \(-0.48\)
Max \(\mathrm{C}_{\mathrm{val}}\) metabric \(61.73\) \(62.80\) \(+1.08\) \(10.87\) \(10.75\) \(+0.12\)
Max \(\mathrm{C}_{\mathrm{val}}\) pbc \(78.04\) \(77.29\) \(-0.75\) \(8.54\) \(8.96\) \(-0.42\)
Mean (Max \(\mathrm{C}_{\mathrm{val}}\)) - - - \(-0.55\) - - \(-0.26\)

Minimizing \(\mathrm{IBS}_{\mathrm{val}}\) aggregates to \(+2.87\) \(\Delta\mathrm{C}\) and \(+1.03\) \(\Delta\mathrm{IBS}\), dominating both alternatives on both metrics. The composite objective produces a moderate \(\Delta\mathrm{C}\) gain but underperforms \(\mathrm{IBS}_{\mathrm{val}}\) on calibration. Maximizing \(\mathrm{C}_{\mathrm{val}}\) is the worst configuration, producing a net negative aggregate on both metrics, consistent with rank-based optimization being sensitive to validation-set finite-sample noise.

10 Datasets and Extended Per-Dataset Results↩︎

Table 5 reports aggregated statistics for the 16 datasets. Table 6 is the numeric expansion of Fig. 3. Table 7 and Fig. 4 report the normalized best-trial scorer-loss weights; per-dataset NNDR for the filtered and random sets is included in Table ¿tbl:tab:results95unfiltered?.

Table 5: Descriptors for the 16 survival datasets: cohort size \(N\), feature count \(P\), event and censoring rates (%) and missingness (%).
Dataset N P event % cens. % miss. %
gbsg 686 8 43.59 56.41 0.00
metabric 1904 9 57.93 42.07 0.00
whas 461 16 38.18 61.82 0.00
aids 1151 11 8.34 91.66 0.00
breast_cancer 198 80 25.76 74.24 0.00
cost 518 13 77.99 22.01 0.00
d_oropha_rec 192 12 72.40 27.60 0.00
hepatocellular 227 43 42.73 57.27 32.07
melanoma 205 5 27.80 72.20 0.00
mgus 241 9 93.36 6.64 9.51
nki70 144 75 33.33 66.67 0.00
pbc 312 6 40.06 59.94 0.00
pbc3 349 12 17.48 82.52 0.53
prostate 502 15 70.52 29.48 0.32
stagec 146 7 36.99 63.01 0.76
uis 628 8 80.89 19.11 0.88
Table 6: Best-trial selection-policy parameters per dataset: generator quotas \(p_g\) (fractions of \(N_g\)), the random complement \(\rho\), and the stratification flags \(\mathrm{bal}_t\), \(\mathrm{bal}_c\) ( active, inactive).
Dataset \(p_{\mathrm{ARF}}\) \(p_{\mathrm{BN}}\) \(p_{\mathrm{TabDDPM}}\) \(p_{\mathrm{SurvCTGAN}}\) \(\rho\) \(\mathrm{bal}_t\) \(\mathrm{bal}_c\)
gbsg \(0.155\) \(0.090\) \(0.200\) \(0.010\) \(0.50\)
metabric \(0.185\) \(0.020\) \(0.190\) \(0.000\) \(0.50\)
whas \(0.195\) \(0.010\) \(0.200\) \(0.130\) \(0.45\)
aids \(0.105\) \(0.060\) \(0.010\) \(0.075\) \(0.20\)
breast_cancer \(0.065\) \(0.160\) \(0.075\) \(0.165\) \(0.20\)
cost \(0.050\) \(0.110\) \(0.045\) \(0.010\) \(0.00\)
d_oropha_rec \(0.195\) \(0.015\) \(0.145\) \(0.030\) \(0.50\)
hepatocellular \(0.185\) \(0.065\) \(0.170\) \(0.035\) \(0.45\)
melanoma \(0.130\) \(0.050\) \(0.165\) \(0.165\) \(0.10\)
mgus \(0.180\) \(0.010\) \(0.155\) \(0.010\) \(0.40\)
nki70 \(0.135\) \(0.195\) \(0.150\) \(0.025\) \(0.20\)
pbc \(0.130\) \(0.020\) \(0.170\) \(0.105\) \(0.40\)
pbc3 \(0.085\) \(0.050\) \(0.120\) \(0.200\) \(0.30\)
prostate \(0.130\) \(0.000\) \(0.020\) \(0.010\) \(0.50\)
stagec \(0.200\) \(0.010\) \(0.190\) \(0.085\) \(0.50\)
uis \(0.165\) \(0.010\) \(0.030\) \(0.025\) \(0.50\)
Mean / Count \(\mathbf{0.143}\) \(\mathbf{0.055}\) \(\mathbf{0.127}\) \(\mathbf{0.068}\) \(\mathbf{0.356}\) \(\mathbf{8/16}\) \(\mathbf{8/16}\)
Table 7: Best-trial scorer-loss weights per dataset, normalized to row-sum one; bold marks the largest weight in each row. Each scorer (Cox, DSv = DeepSurv, DHt = DeepHit, RSF, FPb = FPBoost, XGB = XGBoost-Cox, Ens = Ensemble) is paired with IBS and NLL.
Dataset Cox-IBS Cox-NLL DSv-IBS DSv-NLL DHt-IBS DHt-NLL RSF-IBS RSF-NLL FPb-IBS FPb-NLL XGB-IBS XGB-NLL Ens-IBS Ens-NLL
gbsg \(0.058\) \(0.047\) \(0.198\) \(0.012\) \(0.128\) \(0.023\) \(0.081\) \(0.000\) \(0.105\) \(0.047\) \(0.000\) \(0.023\) \(\mathbf{0.233}\) \(0.047\)
metabric \(0.114\) \(0.030\) \(0.030\) \(0.121\) \(0.023\) \(\mathbf{0.152}\) \(0.083\) \(0.061\) \(0.030\) \(0.023\) \(0.015\) \(0.136\) \(0.106\) \(0.076\)
whas \(0.000\) \(0.012\) \(0.018\) \(0.095\) \(\mathbf{0.113}\) \(0.024\) \(0.083\) \(0.101\) \(0.101\) \(0.089\) \(0.089\) \(0.071\) \(0.101\) \(0.101\)
aids \(0.067\) \(0.101\) \(0.087\) \(0.067\) \(0.128\) \(0.074\) \(0.054\) \(0.107\) \(0.013\) \(0.081\) \(0.007\) \(0.074\) \(0.007\) \(\mathbf{0.134}\)
breast_cancer \(0.128\) \(0.096\) \(0.072\) \(0.008\) \(0.056\) \(0.024\) \(0.072\) \(0.016\) \(0.000\) \(0.152\) \(0.104\) \(\mathbf{0.160}\) \(0.008\) \(0.104\)
cost \(0.081\) \(0.041\) \(0.073\) \(\mathbf{0.146}\) \(0.073\) \(0.049\) \(0.073\) \(0.000\) \(0.089\) \(0.146\) \(0.000\) \(0.138\) \(0.041\) \(0.049\)
d_oropha_rec \(0.052\) \(0.034\) \(0.086\) \(0.052\) \(0.060\) \(0.078\) \(\mathbf{0.147}\) \(0.000\) \(0.147\) \(0.009\) \(0.112\) \(0.009\) \(0.103\) \(0.112\)
hepatocellular \(0.113\) \(0.020\) \(0.013\) \(0.033\) \(0.107\) \(0.127\) \(0.067\) \(0.047\) \(\mathbf{0.133}\) \(0.053\) \(0.113\) \(0.033\) \(0.120\) \(0.020\)
melanoma \(0.086\) \(0.050\) \(0.058\) \(0.014\) \(0.108\) \(0.014\) \(0.101\) \(0.022\) \(0.115\) \(\mathbf{0.144}\) \(0.014\) \(0.129\) \(0.122\) \(0.022\)
mgus \(\mathbf{0.157}\) \(0.122\) \(0.087\) \(0.148\) \(0.113\) \(0.052\) \(0.061\) \(0.078\) \(0.035\) \(0.052\) \(0.000\) \(0.043\) \(0.009\) \(0.043\)
nki70 \(0.021\) \(0.007\) \(\mathbf{0.137}\) \(0.027\) \(0.089\) \(0.103\) \(\mathbf{0.137}\) \(0.021\) \(0.116\) \(0.000\) \(0.062\) \(0.048\) \(0.123\) \(0.110\)
pbc \(0.060\) \(0.030\) \(0.007\) \(\mathbf{0.142}\) \(0.022\) \(0.067\) \(0.052\) \(0.067\) \(\mathbf{0.142}\) \(0.045\) \(0.037\) \(0.075\) \(0.134\) \(0.119\)
pbc3 \(0.168\) \(0.080\) \(0.000\) \(0.018\) \(\mathbf{0.177}\) \(0.018\) \(0.097\) \(0.053\) \(0.159\) \(0.027\) \(0.142\) \(0.044\) \(0.009\) \(0.009\)
prostate \(0.087\) \(0.072\) \(0.130\) \(0.065\) \(0.036\) \(0.007\) \(0.087\) \(0.072\) \(0.087\) \(0.022\) \(0.022\) \(0.094\) \(\mathbf{0.145}\) \(0.072\)
stagec \(0.101\) \(0.043\) \(0.036\) \(0.129\) \(0.129\) \(0.022\) \(0.065\) \(0.029\) \(0.050\) \(0.094\) \(0.065\) \(\mathbf{0.137}\) \(0.058\) \(0.043\)
uis \(0.063\) \(0.063\) \(0.046\) \(\mathbf{0.114}\) \(0.063\) \(0.091\) \(0.034\) \(0.069\) \(0.103\) \(0.057\) \(0.091\) \(0.091\) \(0.034\) \(0.080\)
Mean \(0.085\) \(0.053\) \(0.067\) \(0.075\) \(0.089\) \(0.058\) \(0.081\) \(0.046\) \(0.089\) \(0.065\) \(0.055\) \(0.082\) \(0.085\) \(0.071\)
Figure 4: Best-trial scorer-loss weights for each dataset over the 14 combinations (columns). Colour encodes the weight; each row sums to one.
Table 8: Per-dataset C-index \(\times 100\) of FoGS restricted to each single generator; bold identifies the best model per dataset.
Dataset ARF BN TabDDPM SurvCTGAN
gbsg \(65.70\) \(64.69\) \(\mathbf{70.30}\) \(67.99\)
metabric \(61.10\) \(58.18\) \(60.63\) \(\mathbf{64.19}\)
whas \(73.78\) \(67.08\) \(\mathbf{76.88}\) \(71.96\)
aids \(\mathbf{70.89}\) \(59.99\) \(69.01\) \(63.87\)
breast_cancer \(67.05\) \(\mathbf{69.35}\) \(64.94\) \(29.12\)
cost \(\mathbf{66.31}\) \(65.22\) \(64.95\) \(59.25\)
d_oropha_rec \(56.82\) \(\mathbf{65.26}\) \(62.18\) \(54.46\)
hepatocellular \(\mathbf{77.22}\) \(61.54\) \(69.72\) \(72.02\)
melanoma \(\mathbf{83.73}\) \(82.02\) \(76.25\) \(76.12\)
mgus \(68.65\) \(\mathbf{70.87}\) \(70.74\) \(70.56\)
nki70 \(73.18\) \(\mathbf{83.64}\) \(66.14\) \(67.73\)
pbc \(\mathbf{82.46}\) \(78.46\) \(79.16\) \(78.68\)
pbc3 \(\mathbf{78.85}\) \(72.30\) \(72.79\) \(\mathbf{78.85}\)
prostate \(\mathbf{59.89}\) \(56.93\) \(55.54\) \(56.81\)
stagec \(\mathbf{69.17}\) \(51.78\) \(66.80\) \(60.47\)
uis \(\mathbf{62.33}\) \(59.83\) \(60.32\) \(58.15\)
Table 9: Per-dataset IBS \(\times 100\) of FoGS restricted to each single generator; bold identifies the best (lowest IBS) model per dataset.
Dataset ARF BN TabDDPM SurvCTGAN
gbsg \(10.69\) \(\mathbf{10.49}\) \(10.65\) \(11.85\)
metabric \(10.42\) \(11.24\) \(10.79\) \(\mathbf{10.40}\)
whas \(10.23\) \(13.28\) \(\mathbf{10.20}\) \(11.49\)
aids \(\mathbf{4.27}\) \(4.81\) \(4.86\) \(5.21\)
breast_cancer \(8.04\) \(\mathbf{7.92}\) \(8.84\) \(14.17\)
cost \(\mathbf{16.78}\) \(16.86\) \(16.86\) \(19.70\)
d_oropha_rec \(14.52\) \(14.76\) \(\mathbf{13.24}\) \(15.03\)
hepatocellular \(14.01\) \(13.73\) \(18.03\) \(\mathbf{13.34}\)
melanoma \(9.12\) \(\mathbf{8.73}\) \(8.81\) \(8.74\)
mgus \(11.21\) \(11.21\) \(\mathbf{10.91}\) \(11.50\)
nki70 \(11.17\) \(\mathbf{7.75}\) \(10.82\) \(10.70\)
pbc \(\mathbf{7.69}\) \(9.00\) \(7.95\) \(8.85\)
pbc3 \(6.70\) \(7.78\) \(7.21\) \(\mathbf{6.61}\)
prostate \(\mathbf{16.57}\) \(17.22\) \(18.54\) \(18.37\)
stagec \(\mathbf{10.82}\) \(13.13\) \(12.50\) \(22.27\)
uis \(\mathbf{9.75}\) \(10.03\) \(10.04\) \(11.13\)
Table 10: Per-dataset NNDR of FoGS restricted to each single generator; bold marks the highest value per dataset.
Dataset ARF BN TabDDPM SurvCTGAN
gbsg \(\mathbf{87.30}\) \(51.70\) \(77.70\) \(83.30\)
metabric \(\mathbf{86.70}\) \(46.70\) \(80.30\) \(85.20\)
whas \(\mathbf{91.50}\) \(41.00\) \(77.10\) \(89.80\)
aids \(\mathbf{89.10}\) \(75.50\) \(72.10\) \(84.50\)
breast_cancer \(96.70\) \(23.80\) \(\mathbf{98.70}\) \(97.20\)
cost \(\mathbf{90.00}\) \(39.10\) \(65.10\) \(84.00\)
d_oropha_rec \(\mathbf{91.30}\) \(22.20\) \(27.70\) \(84.40\)
hepatocellular \(95.10\) \(20.60\) \(\mathbf{97.20}\) \(91.40\)
melanoma \(\mathbf{81.60}\) \(58.30\) \(65.00\) \(76.00\)
mgus \(\mathbf{88.40}\) \(46.00\) \(80.20\) \(86.10\)
nki70 \(96.30\) \(28.50\) \(\mathbf{98.80}\) \(95.10\)
pbc \(\mathbf{74.40}\) \(47.70\) \(52.50\) \(64.70\)
pbc3 \(\mathbf{91.20}\) \(32.80\) \(71.40\) \(89.40\)
prostate \(\mathbf{92.20}\) \(58.50\) \(82.20\) \(91.90\)
stagec \(\mathbf{86.70}\) \(44.10\) \(53.50\) \(78.50\)
uis \(\mathbf{87.90}\) \(62.10\) \(67.70\) \(85.10\)

@l*9Y@ & & &
(lr)2-4 (lr)5-7 (lr)8-10 Dataset & Random & FoGS & \(\boldsymbol{\Delta}\) & Random & FoGS & \(\boldsymbol{\Delta}\) & Random & FoGS & \(\boldsymbol{\Delta}\)
gbsg & \(68.85\) & \(\mathbf{69.72}\) & \(+0.87\) & \(10.85\) & \(\mathbf{9.99}\) & \(+0.86\) & \(\mathbf{75.01}\) & \(74.30\) & \(-0.71\)
metabric & \(63.56\) & \(\mathbf{64.28}\) & \(+0.71\) & \(10.19\) & \(\mathbf{9.91}\) & \(+0.28\) & \(74.61\) & \(\mathbf{80.79}\) & \(+6.19\)
whas & \(\mathbf{74.87}\) & \(73.28\) & \(-1.60\) & \(\mathbf{10.67}\) & \(11.08\) & \(-0.41\) & \(74.85\) & \(\mathbf{85.20}\) & \(+10.34\)
aids & \(\mathbf{65.16}\) & \(63.23\) & \(-1.94\) & \(\mathbf{4.45}\) & \(4.75\) & \(-0.30\) & \(80.27\) & \(\mathbf{82.49}\) & \(+2.22\)
breast_cancer & \(66.67\) & \(\mathbf{71.65}\) & \(+4.98\) & \(9.94\) & \(\mathbf{7.87}\) & \(+2.06\) & \(\mathbf{79.18}\) & \(71.41\) & \(-7.77\)
cost & \(67.21\) & \(\mathbf{67.45}\) & \(+0.24\) & \(16.74\) & \(\mathbf{16.45}\) & \(+0.29\) & \(\mathbf{69.43}\) & \(57.44\) & \(-11.99\)
d_oropha_rec & \(53.25\) & \(\mathbf{56.49}\) & \(+3.25\) & \(16.87\) & \(\mathbf{16.40}\) & \(+0.46\) & \(56.36\) & \(\mathbf{64.31}\) & \(+7.95\)
hepatocellular & \(67.74\) & \(\mathbf{76.91}\) & \(+9.17\) & \(14.81\) & \(\mathbf{11.25}\) & \(+3.56\) & \(75.99\) & \(\mathbf{84.13}\) & \(+8.15\)
melanoma & \(81.89\) & \(\mathbf{82.94}\) & \(+1.05\) & \(9.84\) & \(\mathbf{7.41}\) & \(+2.43\) & \(70.72\) & \(\mathbf{71.02}\) & \(+0.30\)
mgus & \(69.98\) & \(\mathbf{71.31}\) & \(+1.33\) & \(\mathbf{11.15}\) & \(11.24\) & \(-0.08\) & \(75.27\) & \(\mathbf{82.21}\) & \(+6.93\)
nki70 & \(70.91\) & \(\mathbf{74.55}\) & \(+3.64\) & \(12.63\) & \(\mathbf{11.15}\) & \(+1.48\) & \(\mathbf{79.64}\) & \(70.57\) & \(-9.08\)
pbc & \(74.36\) & \(\mathbf{84.43}\) & \(+10.07\) & \(9.33\) & \(\mathbf{6.96}\) & \(+2.37\) & \(58.64\) & \(\mathbf{59.98}\) & \(+1.34\)
pbc3 & \(77.87\) & \(\mathbf{80.98}\) & \(+3.11\) & \(7.42\) & \(\mathbf{6.33}\) & \(+1.10\) & \(71.22\) & \(\mathbf{79.22}\) & \(+8.00\)
prostate & \(57.79\) & \(\mathbf{58.84}\) & \(+1.05\) & \(\mathbf{16.84}\) & \(18.45\) & \(-1.62\) & \(80.97\) & \(\mathbf{90.50}\) & \(+9.53\)
stagec & \(63.04\) & \(\mathbf{70.16}\) & \(+7.11\) & \(14.32\) & \(\mathbf{10.27}\) & \(+4.06\) & \(65.47\) & \(\mathbf{70.52}\) & \(+5.05\)
uis & \(\mathbf{62.21}\) & \(61.87\) & \(-0.34\) & \(\mathbf{9.81}\) & \(9.93\) & \(-0.12\) & \(75.64\) & \(\mathbf{84.36}\) & \(+8.72\)
Mean & – & – & \(\boldsymbol{+2.67}\) & – & – & \(\boldsymbol{+1.03}\) & – & – & \(\boldsymbol{+2.82}\)
Median & – & – & \(\boldsymbol{+1.19}\) & – & – & \(\boldsymbol{+0.66}\) & – & – & \(\boldsymbol{+5.62}\)
\(p\) (Wilcoxon) & – & – & \(0.007\) & – & – & \(0.018\) & – & – & \(0.087\)
Wins & – & – & \(13/16\) & – & – & \(11/16\) & – & – & \(12/16\)

11 UMAP Projections of Real and Synthetic Cohorts↩︎

Figs. 5 and 6 provide a qualitative complement to the quantitative evaluation, projecting the real and synthetic cohorts of all 16 datasets into two dimensions with UMAP. For each dataset a single embedding is fitted on the real event-bearing samples (\(\delta = 1\)) and then applied unchanged to the event-bearing samples of every column; censored samples are not shown, so that the observed time coincides with the event time and can be used to colour the points. The embedding is therefore shared within a dataset, and the axes are directly comparable across its panels. From left to right, the columns show the real training data, the FoGS-selected set \(\mathcal{D}_s^{*}\), and the over-generated candidate pools \(\mathcal{D}_g\) (\(N_g = \kappa N_r\)) of the four single generators (ARF, Bayesian Network, TabDDPM, SurvivalCTGAN). The real cohorts sample the covariate space sparsely, whereas the candidate pools are dense, and the extent to which the four generators differ from one another varies across cohorts.

Figure 5: UMAP projections of the real and synthetic cohorts (part 1 of 2): datasets gbsg, metabric, whas, aids, breast_cancer, cost, d_oropha_rec, and hepatocellular (rows). Columns, left to right: the real training data, the FoGS-selected set \mathcal{D}_s^{*}, and the over-generated candidate pools \mathcal{D}_g of ARF, Bayesian Network, TabDDPM, and SurvivalCTGAN. For each dataset a single UMAP embedding is fitted on the real event-bearing samples and shared across columns, so the axes are comparable within a row; only event-bearing samples are shown, and point colour encodes the observed time, normalized to [0,1] and discretized into five equal-width bins. Datasets melanoma–uis are shown in Fig. 6.
Figure 6: UMAP projections of the real and synthetic cohorts (part 2 of 2): datasets melanoma, mgus, nki70, pbc, pbc3, prostate, stagec, and uis (rows). Columns, embedding, and colour scale are as in Fig. 5.

References↩︎

[1]
P. Wang, Y. Li, and C. K. Reddy, “Machine learning for survival analysis: A survey,” ACM Computing Surveys (CSUR), vol. 51, no. 6, pp. 1–36, 2019.
[2]
J. P. Klein, M. L. Moeschberger, et al., Survival analysis: Techniques for censored and truncated data, vol. 1230. Springer, 2003.
[3]
D. R. Cox, “Regression models and life-tables,” Journal of the Royal Statistical Society. Series B (Methodological), vol. 34, no. 2, pp. 187–220, 1972.
[4]
E. L. Kaplan and P. Meier, “Nonparametric estimation from incomplete observations,” Journal of the American statistical association, vol. 53, no. 282, pp. 457–481, 1958.
[5]
J. Yoon, L. N. Drumright, and M. Van Der Schaar, “Anonymization through data synthesis using generative adversarial networks (ads-gan),” IEEE journal of biomedical and health informatics, vol. 24, no. 8, pp. 2378–2388, 2020.
[6]
A. Norcliffe, B. Cebere, F. Imrie, P. Lio, and M. van der Schaar, “Survivalgan: Generating time-to-event data for survival analysis,” in International conference on artificial intelligence and statistics, 2023, pp. 10279–10304.
[7]
Z. Qian, R. Davis, and M. Van Der Schaar, “Synthcity: A benchmark framework for diverse use cases of tabular synthetic data,” Advances in neural information processing systems, vol. 36, pp. 3173–3188, 2023.
[8]
E. Lomurno, F. Balzarini, F. Benelle, F. P. Panaccione, and M. Matteucci, “Inference-time refinement closes the synthetic-real gap in tabular diffusion,” arXiv preprint arXiv:2605.06261, 2026.
[9]
N. F. Resmini, E. Lomurno, C. Sbrolli, and M. Matteucci, “Your image generator is your new private dataset,” Image and Vision Computing, p. 105727, 2025.
[10]
A. Ankan and J. Textor, “Pgmpy: A python toolkit for bayesian networks,” Journal of Machine Learning Research, vol. 25, no. 265, pp. 1–8, 2024.
[11]
L. Xu, M. Skoularidou, A. Cuesta-Infante, and K. Veeramachaneni, “Modeling tabular data using conditional gan,” Advances in neural information processing systems, vol. 32, 2019.
[12]
D. P. Kingma, M. Welling, et al., “Auto-encoding variational bayes.” Banff, Canada, 2013.
[13]
H. Akrami, S. Aydore, R. M. Leahy, and A. A. Joshi, “Robust variational autoencoder for tabular data with beta divergence,” arXiv preprint arXiv:2006.08204, 2020.
[14]
C. Durkan, A. Bekasov, I. Murray, and G. Papamakarios, “Neural spline flows,” Advances in neural information processing systems, vol. 32, 2019.
[15]
J. Sohl-Dickstein, E. Weiss, N. Maheswaranathan, and S. Ganguli, “Deep unsupervised learning using nonequilibrium thermodynamics,” in International conference on machine learning, 2015, pp. 2256–2265.
[16]
A. Kotelnikov, D. Baranchuk, I. Rubachev, and A. Babenko, “Tabddpm: Modelling tabular data with diffusion models,” in International conference on machine learning, 2023, pp. 17564–17579.
[17]
D. S. Watson, K. Blesch, J. Kapar, and M. N. Wright, “Adversarial random forests for density estimation and generative modeling,” in International conference on artificial intelligence and statistics, 2023, pp. 5357–5375.
[18]
I. Tsamardinos, L. E. Brown, and C. F. Aliferis, “The max-min hill-climbing bayesian network structure learning algorithm,” Machine learning, vol. 65, pp. 31–78, 2006.
[19]
W. B. Glenn et al., “Verification of forecasts expressed in terms of probability,” Monthly weather review, vol. 78, no. 1, pp. 1–3, 1950.
[20]
T. Gneiting and A. E. Raftery, “Strictly proper scoring rules, prediction, and estimation,” Journal of the American statistical Association, vol. 102, no. 477, pp. 359–378, 2007.
[21]
J. L. Katzman, U. Shaham, A. Cloninger, J. Bates, T. Jiang, and Y. Kluger, “DeepSurv: Personalized treatment recommender system using a cox proportional hazards deep neural network,” BMC medical research methodology, vol. 18, pp. 1–12, 2018.
[22]
C. Lee, W. Zame, J. Yoon, and M. Van Der Schaar, “Deephit: A deep learning approach to survival analysis with competing risks,” in Proceedings of the AAAI conference on artificial intelligence, 2018, vol. 32, p. 1.
[23]
H. Ishwaran, U. B. Kogalur, E. H. Blackstone, and M. S. Lauer, Random survival forests,” The Annals of Applied Statistics, vol. 2, no. 3, pp. 841–860, 2008, doi: 10.1214/08-AOAS169.
[24]
A. Archetti, E. Lomurno, D. Piccinotti, and M. Matteucci, “FPBoost: Fully parametric gradient boosting for survival analysis,” arXiv preprint arXiv:2409.13363, 2024.
[25]
T. Chen and C. Guestrin, “Xgboost: A scalable tree boosting system,” in Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining, 2016, pp. 785–794.
[26]
T. Akiba, S. Sano, T. Yanase, T. Ohta, and M. Koyama, “Optuna: A next-generation hyperparameter optimization framework,” in Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, 2019, pp. 2623–2631.
[27]
F. E. Harrell Jr, K. L. Lee, and D. B. Mark, “Multivariable prognostic models: Issues in developing models, evaluating assumptions and adequacy, and measuring and reducing errors,” Statistics in medicine, vol. 15, no. 4, pp. 361–387, 1996.