Link-Sequential R-SafeBayes: Robust Graph Inference

• The paper presents a robust Bayesian method that adapts the learning rate in latent space random geometric graph models using sequential prequential risk minimization.
• It tackles geometric and link-function misspecification by tempering the likelihood and exploiting dyadic conditional independence for stable, calibrated inference.
• Empirical studies show significant improvements in prediction accuracy, with reductions in cumulative log-loss and squared loss compared to standard Bayesian approaches.

Link-Sequential R-SafeBayes is a SafeBayes-style procedure for latent space random geometric graph (RGG) models that uses the conditional independence of dyads to build a sequential, prequential risk criterion and adaptively choose the learning rate $\eta$ of a generalized posterior, thereby repairing standard Bayes under severe geometric and link-function misspecification. In the formulation studied in "Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors" (Labarthe, 18 May 2026), the method is defined for undirected, unweighted graphs and is used both to improve calibration and link prediction and to select latent geometries across Euclidean, spherical, and hyperbolic spaces. A broader sequential-risk perspective is provided by "Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss" (Wu et al., 2024), which analyzes linked sequential updates through recursive excess-risk decompositions and high-probability guarantees.

1. Model class and the source of the problem

The underlying model class is a latent space RGG for an observed undirected, unweighted graph $G=(V,E)$ with $|V|=N$ and adjacency matrix $A \in \{0,1\}^{N \times N}$. The observable space is

$\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$

A parameter $\theta$ consists of a metric latent space $(\mathcal{Z}, d_{\mathcal{Z}})$, a strictly monotonically decreasing link function $f:\mathbb{R}_{\ge 0}\to[0,1]$, and latent node positions $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$. Under dyadic conditional independence, the likelihood factorizes over dyads: $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$ The associated model class is $G=(V,E)$0, and its convex hull $G=(V,E)$1 consists of mixtures

$G=(V,E)$2

For the robustification procedure and experiments, the model is specialized to a logistic “soft-threshold” RGG. Latent positions are taken in $G=(V,E)$3, $G=(V,E)$4, or $G=(V,E)$5 with the appropriate geodesic distance $G=(V,E)$6. A global radius is given a half-normal prior $G=(V,E)$7, the sharpness parameter $G=(V,E)$8 is treated as fixed, and the edge likelihood is

$G=(V,E)$9

with $|V|=N$0 the logistic function. Given $|V|=N$1, edges $|V|=N$2 are conditionally independent Bernoulli (Labarthe, 18 May 2026).

The central difficulty is misspecification. The paper identifies two pervasive sources. The first is geometric mismatch, where the true network’s growth or curvature cannot be embedded faithfully in the model geometry. The second is link-function mismatch, where the true edge mechanism violates strict monotonicity or the imposed link form. The paper’s Theorem 1 states that if the true distribution $|V|=N$3 generates a geometry whose volume growth exceeds the packing capacity of the model metric space $|V|=N$4, then the KL minimizer

$|V|=N$5

resides strictly in the convex hull: $|V|=N$6. Theorem 2 states that if the true distribution $|V|=N$7 generates edges that violate the strict monotonicity of the model’s link function $|V|=N$8, then again $|V|=N$9 (Labarthe, 18 May 2026).

This places standard Bayesian inference in a structurally adverse regime. The paper argues that under such misspecification standard Bayes concentrates on a single $A \in \{0,1\}^{N \times N}$0 even though the relevant KL projection lies in $A \in \{0,1\}^{N \times N}$1, leading to overconfident, miscalibrated posteriors and “sure-but-wrong” predictions.

2. Generalized posteriors and the R-SafeBayes principle

To reduce the impact of a misspecified likelihood, the method replaces the ordinary posterior with a generalized or tempered posterior: $A \in \{0,1\}^{N \times N}$2 Here $A \in \{0,1\}^{N \times N}$3 is the learning rate, with $A \in \{0,1\}^{N \times N}$4 recovering standard Bayes and $A \in \{0,1\}^{N \times N}$5 flattening the posterior by down-weighting the likelihood relative to the prior. In the paper’s interpretation, when the true KL minimizer lies in $A \in \{0,1\}^{N \times N}$6, a tempered posterior with $A \in \{0,1\}^{N \times N}$7 behaves more like an implicit mixture over multiple pure states and thereby better approximates convex combinations that cannot be represented by any single configuration (Labarthe, 18 May 2026).

The SafeBayes perspective used is explicitly the R-SafeBayes perspective of Grunwald & van Ommen. In that formulation, $A \in \{0,1\}^{N \times N}$8 is chosen by minimizing prequential risk, namely cumulative predictive loss on a sequence of observations using sequentially updated generalized posteriors. The paper emphasizes that “R-SafeBayes” refers specifically to minimizing predictive log-risk, not posterior risk under the model.

A useful contrast is provided by recursive PAC-Bayes. In (Wu et al., 2024), sequential prior updates are analyzed through a decomposition of expected loss into an excess loss relative to a downscaled prior risk plus the downscaled prior risk itself: $A \in \{0,1\}^{N \times N}$9 That paper addresses “sequential prior updates with no information loss” in PAC-Bayesian analysis. Link-Sequential R-SafeBayes is not presented as a PAC-Bayes method, but this suggests a close conceptual affinity: both frameworks link sequential updates to a predictive or excess-risk criterion rather than relying on a single terminal fit (Wu et al., 2024).

3. Link-sequential construction

Link-Sequential R-SafeBayes adapts R-SafeBayes to graph data by exploiting dyadic conditional independence. The method works with a generalized $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$0-posterior, factors the likelihood over edges, and defines a sequence of dyadic blocks $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$1, where $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$2 is an initial training block and $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$3 are test or evaluation blocks. For each candidate $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$4 and each candidate geometry $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$5, the procedure repeatedly fits the $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$6-posterior on the observed blocks so far, predicts edges in the next block via the posterior predictive, accumulates prequential log-loss, and then adds the block to the training set (Labarthe, 18 May 2026).

The link sequence is constructed by extracting all upper-triangular dyads

$\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$7

randomly shuffling $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$8, and partitioning it into an initial training block $\mathcal{Y} = \{0,1\}^{\binom{N}{2}}.$9 and test blocks $\theta$0. The fraction of dyads in $\theta$1 is an input hyperparameter $\theta$2 denoted $\theta$3 in experiments, and $\theta$4 is another hyperparameter.

For a block $\theta$5, if the posterior after training on $\theta$6 is $\theta$7, the predictive edge probability is

$\theta$8

where $\theta$9 is a Monte Carlo sample from the tempered posterior. The block log-loss is

$(\mathcal{Z}, d_{\mathcal{Z}})$0

and the cumulative prequential risk is

$(\mathcal{Z}, d_{\mathcal{Z}})$1

The method selects

$(\mathcal{Z}, d_{\mathcal{Z}})$2

on a discrete grid $(\mathcal{Z}, d_{\mathcal{Z}})$3. It also tracks squared loss through the Brier score

$(\mathcal{Z}, d_{\mathcal{Z}})$4

to quantify calibration and link prediction quality (Labarthe, 18 May 2026).

The procedure depends on the factorization

$(\mathcal{Z}, d_{\mathcal{Z}})$5

which justifies treating edges as conditionally independent observations for prequential evaluation and allows sequential assimilation of random subsets of dyads without violating the model.

4. Learning-rate adaptation and geometry selection

The operational objective is to select, for each geometry $(\mathcal{Z}, d_{\mathcal{Z}})$6, the learning rate that minimizes cumulative prequential log-loss: $(\mathcal{Z}, d_{\mathcal{Z}})$7 Algorithm 1 in the paper specifies the full loop: dyads are extracted and randomly partitioned; for each geometry and each candidate $(\mathcal{Z}, d_{\mathcal{Z}})$8, cumulative risk is initialized, NUTS is used to draw samples from the generalized posterior at each stage, predictive probabilities are computed for the next block, block log-loss is accumulated, and the block is incorporated into the training set (Labarthe, 18 May 2026).

Because the procedure computes a prequential log-loss for each geometry, it is also used as a model selection criterion. On synthetic data where the true geometry is known, the paper reports that the Poincaré synthetic network is best fit by hyperbolic latent space with lowest log- and squared-loss $(\mathcal{Z}, d_{\mathcal{Z}})$9, the spherical synthetic network is best fit by the spherical model with $f:\mathbb{R}_{\ge 0}\to[0,1]$0 and $f:\mathbb{R}_{\ge 0}\to[0,1]$1, and 5-SBM is best fit by Euclidean geometry with $f:\mathbb{R}_{\ge 0}\to[0,1]$2 (Labarthe, 18 May 2026).

The geometry-selection role is significant because the prequential criterion responds to latent curvature and volume growth rather than only to within-model fit. The paper notes a particularly informative case: the true generative model for the Poincaré synthetic network uses Poincaré disk coordinates, whereas inference uses the Lorentz or hyperboloid model, yet the method still identifies hyperbolic geometry as best. This suggests that the criterion is sensitive to global curvature structure rather than coordinate artifacts.

A possible misconception is that link ordering itself determines the selected learning rate. The paper explicitly studies this issue. In Figure 1, varying the number of blocks $f:\mathbb{R}_{\ge 0}\to[0,1]$3, varying $f:\mathbb{R}_{\ge 0}\to[0,1]$4, and varying random dyad orderings affect absolute risk but not the location of the minimum in $f:\mathbb{R}_{\ge 0}\to[0,1]$5; on the Dolphins network in Euclidean geometry, the prequential log-loss curves overlap tightly and all minimize at the same $f:\mathbb{R}_{\ge 0}\to[0,1]$6, for example $f:\mathbb{R}_{\ge 0}\to[0,1]$7 (Labarthe, 18 May 2026). The empirical conclusion is therefore not that order is irrelevant in every respect, but that the minimizer in $f:\mathbb{R}_{\ge 0}\to[0,1]$8 is stable under randomization in the reported experiments.

5. Empirical behavior under misspecification

The empirical picture reported in (Labarthe, 18 May 2026) is that across all real-world and synthetic datasets, the optimal $f:\mathbb{R}_{\ge 0}\to[0,1]$9 found by Link-Sequential R-SafeBayes is strictly less than $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$0. Examples from Table 1 include Dolphins (Euclidean) with $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$1, Moreno Train (Hyperboloid) with $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$2, and 5-SBM (Euclidean) with $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$3. The paper interprets this uniform shrinkage as indicating pervasive misspecification.

Standard Bayes with $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$4 is reported to overfit: it minimizes in-sample loss with sharp posteriors but performs significantly worse out of sample. By contrast, selecting $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$5 via Link-Sequential R-SafeBayes yields, on average in Euclidean models, approximately $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$6 reduction in cumulative log-loss and approximately $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$7 reduction in squared loss compared to $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$8. Similar improvements are reported for other geometries (Labarthe, 18 May 2026).

The paper’s analysis of per-dyad log-loss differences locates the main gain in avoiding “sure-but-wrong” predictions. These are dyads for which the standard Bayes model assigns extremely low probability to an observed edge or high probability to a non-edge, producing huge log-loss. The tempered approach spreads posterior mass more broadly, incurring what the paper calls a small “regularization tax” on easy dyads in order to drastically reduce losses on high-error dyads.

These findings support the paper’s claim that the method improves calibration as well as predictive performance. The improvement is not presented as a generic consequence of posterior tempering in every graph model; rather, it is specifically tied to the setting in which the KL minimizer lies in $Z=(z_1,\dots,z_N)\in \mathcal{Z}^N$9 and a single pure latent configuration is inadequate.

6. Computation, implementation, and broader context

Inference under the $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$0-posterior is performed using No-U-Turn Sampler (NUTS) via JAX/NumPyro. Because the likelihood is invariant to isometries such as translation and rotation, the posterior is highly multimodal. The paper therefore does not impose identifiability constraints, allows NUTS to explore freely in latent space, and relies on the invariance of predictive probabilities $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$1 to these symmetries. For visualization, post-hoc Procrustes alignment is used, but it does not affect predictive evaluation (Labarthe, 18 May 2026).

Several numerical and geometric implementation details are emphasized. Hyperbolic geometry is implemented in the Lorentz model in $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$2, and “shielded Taylor expansions” are used near singularities to stabilize HMC. For stable log-likelihood computation in logistic tails, the identity

$$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$3

is used. Computation is parallelized across candidate $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$4 and geometries using JAX’s pmap.

The computational burden is dominated by latent-space MCMC and repeated sequential refits. Evaluating a full dyadic likelihood per MCMC step is $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$5, and the repeated NUTS runs across $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$6 candidate learning rates, $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$7 candidate geometries, and $$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$8 sequential blocks lead to overall scaling approximately

$$P_{\theta}(A) \;=\; \prod_{i<j} f\bigl(d_{\mathcal{Z}}(z_i, z_j)\bigr)^{a_{ij}} \bigl(1 - f(d_{\mathcal{Z}}(z_i, z_j))\bigr)^{1-a_{ij}}.$$9

The paper explicitly notes that this is manageable for small or medium networks but not for very large graphs, and suggests that future work might adapt Generalized Variational Inference to the prequential objective, while also noting that current GVI methods are less reliable on non-Euclidean manifolds (Labarthe, 18 May 2026).

In the broader literature, the method is conceptually anchored in SafeBayes and in generalized or power posteriors

$G=(V,E)$00

which are related in the paper to PAC-Bayesian bounds and Gibbs posteriors. The recursive PAC-Bayes framework of (Wu et al., 2024) supplies a complementary sequential viewpoint: it shows how posterior-to-prior linking can be analyzed without losing confidence information, using generalized split-kl inequalities for discrete losses and recursive bounds of the form

$G=(V,E)$01

This does not make Link-Sequential R-SafeBayes a PAC-Bayes procedure, but it does clarify a broader methodological pattern: sequentially linked updates can be judged through predictive or excess-risk criteria rather than through marginal likelihood alone.

A plausible implication is that Link-Sequential R-SafeBayes occupies a bridging position between robust generalized posteriors and latent geometric network modeling. Within the scope studied in (Labarthe, 18 May 2026), its defining contribution is not simply posterior tempering, but the combination of tempering, dyad-wise prequential evaluation, and adaptive learning-rate selection for graphs whose geometry and link mechanism may both be misspecified.