GTGIB: Temporal Graph Information Bottleneck

• GTGIB is a framework for inductive representation learning on continuous-time dynamic graphs that couples structural enhancement with temporal graph information bottlenecking to improve link prediction.
• It employs a two-step graph structure learning method—combining global random and local hop-based sampling—to expand sparse temporal neighborhoods and accommodate unseen nodes.
• The framework further refines enriched graphs using a variational bottleneck that compresses redundant interactions while preserving essential temporal dependencies.

GTGIB is a framework for inductive representation learning on continuous-time dynamic graphs that combines graph structure learning with a temporal graph information bottleneck. Its defining objective is to improve temporal link prediction when graphs evolve over time and previously unseen nodes appear after training, a setting in which many temporal graph models either fail to represent new nodes adequately or overfit noisy, redundant, or task-irrelevant interactions. Architecturally, GTGIB is not a standalone temporal encoder; it is a general, backbone-agnostic pre-representation-learning layer that first enriches temporal neighborhoods through a two-step structural enhancer and then refines the resulting graph through bottleneck-based edge and feature regularization (Xiong et al., 20 Aug 2025).

1. Formal setting and target task

GTGIB is formulated for the continuous-time dynamic graph setting, where a temporal graph is written as

$G(t) = (V(t), E(t), \mathcal{X}, \mathcal{E}),$

with $V(t)\subseteq V$ denoting active nodes at time $t$, and

$$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$

denoting timestamped interaction events observed up to time $t$. Nodes may have initial features $x_i\in\mathcal X$, edges may have features $e_{ij}(t)\in\mathcal E$, and a node’s temporal neighborhood is

$$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$

The primary downstream task is temporal link prediction, with a sharp distinction between transductive prediction, where future links are inferred among nodes seen during training, and inductive prediction, where links involving unseen nodes must be predicted (Xiong et al., 20 Aug 2025).

The motivation for GTGIB is explicitly twofold. First, new nodes may enter the system with few or no historical neighbors, which weakens temporal encoders that depend on node identity or on well-populated temporal neighborhoods. Second, real temporal graphs contain spurious and redundant interactions, and GTGIB’s own neighborhood-enrichment stage can introduce additional candidate edges that are not useful. The framework therefore addresses coverage and selectivity jointly: it expands the candidate temporal context available to a node, especially an unseen node, and then compresses the enriched graph so that only predictive temporal structure is retained (Xiong et al., 20 Aug 2025).

This combination is central to the framework’s scope. GTGIB is designed to operate before temporal representation learning, rather than to replace the temporal backbone itself. In the reported instantiations, it wraps both TGN and CAW, representing message-passing-with-memory and causal-anonymous-walk paradigms respectively, while preserving the same end task and evaluation protocol (Xiong et al., 20 Aug 2025).

2. Structural enhancement through sampling-based graph structure learning

The graph structure learning component in GTGIB is a two-step structural enhancer. Its purpose is not to learn a dense adjacency matrix over all node pairs, but to construct additional candidate edges efficiently so that sparse or previously unseen nodes gain richer temporal neighborhoods. The enhancer combines two sampling modes: global random sampling, which can expose long-range or otherwise missed relations, and local hop-based sampling, which enlarges neighborhoods through multi-hop temporal structure (Xiong et al., 20 Aug 2025).

For the $m$-th sample, if $X_m$ indicates whether a sampled candidate hits a ground-truth edge in the time window $V(t)\subseteq V$0, GTGIB defines

$V(t)\subseteq V$1

where the time-aware random-sampling success probability is

$V(t)\subseteq V$2

and the temporal hop-based probability is

$V(t)\subseteq V$3

With $V(t)\subseteq V$4 sampling iterations and $V(t)\subseteq V$5, the framework derives

$V(t)\subseteq V$6

where $V(t)\subseteq V$7, and thus the threshold

$V(t)\subseteq V$8

guarantees finding a ground-truth edge with probability at least $V(t)\subseteq V$9 (Xiong et al., 20 Aug 2025).

The second step assigns timestamps and edge features to newly generated edges. For each added edge, the timestamp is sampled as

$t$0

and edge features are generated by

$t$1

where $t$2 denotes concatenation and $t$3 is the generic time encoding from TGAT. The output is an enriched graph

$t$4

This makes the enhancer explicitly temporal: new edges are not inserted as static structure, but as timestamped interactions with generated temporal attributes (Xiong et al., 20 Aug 2025).

A common misunderstanding is to treat this stage as full graph optimization. GTGIB’s own formulation is narrower. The enhancer performs expansion or enrichment; fine-grained pruning is deferred to the bottleneck stage. Its stated complexity is $t$5 for random sampling, $t$6 for hop-based sampling, and thus $t$7 overall, which is presented as substantially cheaper than denser temporal graph structure learning approaches (Xiong et al., 20 Aug 2025).

3. Temporal Graph Information Bottleneck

The second core component is the Temporal Graph Information Bottleneck, or TGIB, which extends the information bottleneck principle to continuous-time temporal graphs. GTGIB introduces a temporal local dependence assumption under a continuous-time Markov chain view:

$t$8

Under this assumption, the temporal graph bottleneck objective becomes

$t$9

The first term preserves predictive information about the task label $$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$0; the second penalizes excess dependence on graph history in the observation window, thereby compressing nuisance temporal information (Xiong et al., 20 Aug 2025).

The framework then derives tractable variational bounds. The prediction term is upper-bounded by

$$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$1

while the compression term is decomposed layerwise as

$$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$2

with

$$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$3

and

$$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$4

The relaxed objective is therefore

$$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$5

where the original $$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$6 is split into separate coefficients $$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$7 and $$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$8, so that edge compression and feature compression can be tuned independently (Xiong et al., 20 Aug 2025).

GTGIB also states a nuisance-invariance lemma: if the structure enhancer introduces nuisance information $$E(t)\subseteq \{(i,j,t') \mid i,j\in V(t),\ t'\le t\}$$9 unrelated to the label, then

$t$0

The intended implication is that bottleneck refinement can suppress irrelevant edges introduced during structural enhancement, rather than merely regularizing the original graph. This theoretical role is important because GTGIB’s performance depends on the interaction of enrichment and compression, not on either one alone (Xiong et al., 20 Aug 2025).

4. Practical instantiation and backbone integration

In the implemented model, edge regularization is realized through time-dependent Bernoulli retention variables. For each edge $t$1,

$t$2

with a differentiable concrete relaxation

$t$3

where $t$4 and $t$5 is the temperature. The retention probability is parameterized as

$t$6

A straight-through rule with threshold $t$7 selects edges whose probabilities exceed the threshold, and the instantiated edge bottleneck penalty is

$t$8

with $t$9 a Bernoulli prior hyperparameter (Xiong et al., 20 Aug 2025).

Node-representation regularization uses a Gaussian latent bottleneck. GTGIB assumes

$x_i\in\mathcal X$0

After TGIB filtering, the refined graph is passed to the backbone. For TGN,

$x_i\in\mathcal X$1

and for CAW,

$x_i\in\mathcal X$2

Sampling uses the standard reparameterization

$x_i\in\mathcal X$3

and the feature bottleneck penalty is

$x_i\in\mathcal X$4

This makes GTGIB a variational wrapper around the backbone rather than an alternative temporal encoder (Xiong et al., 20 Aug 2025).

The final training objective is

$x_i\in\mathcal X$5

The algorithm iterates over times $x_i\in\mathcal X$6, samples positive and negative edges, applies random and hop-based enhancement, generates timestamps and edge features, samples edge-retention variables layerwise, constructs refined graphs, produces $x_i\in\mathcal X$7 and $x_i\in\mathcal X$8, samples latent embeddings, predicts positive and negative link probabilities, and optimizes the final loss end to end (Xiong et al., 20 Aug 2025).

The reported implementation uses four datasets—Wikipedia, MOOC, UCI, and Social Evolution—with temporal splits of $x_i\in\mathcal X$9 for train, validation, and test; Average Precision as the main metric; five runs; batch size $e_{ij}(t)\in\mathcal E$0; five negative samples; concrete temperature $e_{ij}(t)\in\mathcal E$1; Bernoulli prior $e_{ij}(t)\in\mathcal E$2; straight-through threshold $e_{ij}(t)\in\mathcal E$3; random sampling of 10 nodes; and hop-based sampling within $e_{ij}(t)\in\mathcal E$4, described as 20 one-hop and 30 two-hop neighbors. All datasets use zero vectors for node features in the experiments, a detail that materially shapes the relative importance of structural versus feature compression (Xiong et al., 20 Aug 2025).

5. Empirical behavior, ablations, and limitations

GTGIB is evaluated under both transductive and inductive temporal link prediction. Its strongest gains occur in the inductive setting, which is also the framework’s main target. The reported inductive Average Precision results are as follows (Xiong et al., 20 Aug 2025):

Dataset	TGN $e_{ij}(t)\in\mathcal E$5 GTGIB-TGN	CAW $e_{ij}(t)\in\mathcal E$6 GTGIB-CAW
UCI	76.70 $e_{ij}(t)\in\mathcal E$7 81.54	93.56 $e_{ij}(t)\in\mathcal E$8 94.95
Social Evolution	85.27 $e_{ij}(t)\in\mathcal E$9 87.26	88.67 $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$0 92.75
MOOC	89.01 $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$1 89.29	80.86 $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$2 90.77
Wikipedia	97.81 $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$3 98.13	98.52 $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$4 99.05

Averaged over datasets, the framework reports inductive gains of $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$5 over TGN and $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$6 over CAW. In the transductive setting, GTGIB also improves both wrapped backbones, with average gains of $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$7 over TGN and $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$8 over CAW. The paper notes, however, that GTGIB does not always surpass stronger specialized temporal architectures such as FreeDyG or DyGFormer in transductive mode, where abundant historical observations make backbone design itself more dominant (Xiong et al., 20 Aug 2025).

The ablation on UCI clarifies the interaction between the enhancer and TGIB. In the inductive ablation setting, the TGN baseline is $$\mathcal N_i(t)=\{(j,t')\mid \exists (j,i,t')\in G(t),\ t'<t\}.$$9 AP, “rand only” reaches $m$0, “hop only” $m$1, “w/o enhancer” $m$2, “w/o TGIB” $m$3, and full GTGIB-TGN $m$4. In the corresponding transductive ablation, TGN is $m$5, “rand only” $m$6, “hop only” $m$7, “w/o enhancer” $m$8, “w/o TGIB” $m$9, and full GTGIB-TGN $X_m$0. The inductive pattern is the more revealing one: TGIB alone is insufficient when neighborhood coverage is poor, while enhancement alone helps but leaves noise unfiltered. The full method works best because enrichment and bottlenecking are complementary (Xiong et al., 20 Aug 2025).

A separate sampling-size study on UCI reports that increasing the number of sampled neighbors yields strong improvements before saturation: with 0 samples, transductive AP is $X_m$1 and inductive AP $X_m$2; with 30 samples, they rise to $X_m$3 and $X_m$4; with 75 samples, to $X_m$5 and $X_m$6. Hyperparameter analysis is described as hump-shaped: too much regularization degrades performance; $X_m$7 should be relatively large because structural noise is substantial; and $X_m$8 should be much smaller because node features are comparatively less noisy, especially when initial node features are zero vectors. On UCI, the reported optima are $X_m$9 for GTGIB-TGN and $V(t)\subseteq V$00 for GTGIB-CAW (Xiong et al., 20 Aug 2025).

The framework’s limitations are also explicit. Its derivation depends on the temporal local dependence assumption and a CTMC-style Markov view. Synthetic timestamps for generated edges are drawn uniformly from $V(t)\subseteq V$01, which is simple but not necessarily realistic. The evaluation is restricted to link prediction and to two backbones, TGN and CAW. The paper also notes an empirical failure mode: TGIB alone can slightly hurt inductive performance if the graph is not first enriched, indicating that compression without adequate structural coverage may remove too much signal from unseen nodes (Xiong et al., 20 Aug 2025).

6. Nomenclature, related concepts, and common conflations

The exact acronym GTGIB refers to the framework “Graph Structure Learning with Temporal Graph Information Bottleneck for Inductive Representation Learning,” and not to several adjacent acronyms that are easy to confuse with it. GTG, for example, denotes “Generalizable Trajectory Generation” for cross-city urban mobility; that model uses Space Syntax, disentangled adversarial travel-cost prediction, and shortest-path-based preference learning, but it does not define any “IB” component and does not introduce a method called GTGIB (2502.01107).

A closer but still distinct term is TGIB, used in “Self-Explainable Temporal Graph Networks based on Graph Information Bottleneck.” That framework also applies an information bottleneck to temporal graphs, but its purpose is built-in explanation of event occurrences by selecting explanatory historical events, not inductive temporal link prediction through neighborhood enhancement and graph refinement (Seo et al., 2024). GTGIB’s TGIB component is thus not interchangeable with TGIB the self-explainable model, even though both operate on temporal graphs and both use bottleneck terminology.

Outside temporal graph learning, the acronym family becomes even broader. GIBLy is an architecture-agnostic geometric inductive bias layer for 3D semantic segmentation, centered on learnable primitive-shape alignment in point clouds rather than graph bottlenecking (Lavado et al., 22 May 2026). GIB, in “Gated Information Bottleneck for Generalization in Sequential Environments,” is a deterministic feature-gating bottleneck for out-of-distribution generalization under sequential environment shifts, not a temporal-graph framework (Alesiani et al., 2021). There is also graph-information-bottleneck work on task-oriented graph communication, including a VQ-GIB extension for digital transmission, but that line addresses graph compression for communication systems rather than continuous-time dynamic graphs with unseen nodes (Li et al., 2024).

This terminology matters because GTGIB occupies a very specific niche. It is neither a generic graph information bottleneck nor a general temporal explanation model. Its distinctive contribution is the coupling of a sampling-based structural enhancer with layerwise temporal graph bottlenecking, aimed specifically at inductive temporal link prediction where unseen nodes and noisy temporal interactions must be handled simultaneously (Xiong et al., 20 Aug 2025).