Replace uniform minibatch sampling by a fixed-size determinantal point process whose similarity matrix is a diffusion kernel on the training-data k-NN graph. The sampler repels nearby or redundant examples while preserving multiple diffusion modes, so a small batch should cover intrinsic data geometry and provide lower-variance estimates of losses and gradients.
Replace the arbitrary labelled target graph in each flow-matching pair by the node permutation that minimizes its Euclidean distance to the source graph. Construct the conditional interpolation and velocity target using this aligned representative, so the model learns transport in graph quotient space rather than wasting capacity on node-order mismatches.
Train one functional flow-matching network against conditional velocity targets formed from randomly varying finite-rank reconstructions, including sensor sets that are not nested across training examples. Decode predictions from two sensor layouts into a common function representation and add a cross-layout consistency penalty. The paper's convergence result predicts that this remains statistically valid as reconstruction error decreases, unlike methods that implicitly rely on changing grids…
Replace uniform node minibatches in a GNN with a coreset selected from a small random candidate set using local Laplacian-column coherence. Select nodes whose connectivity signatures are least redundant with already selected nodes, while retaining inverse-probability weights for unbiased loss estimates. This should improve coverage of weakly connected graph clusters and preserve smooth graph signals at the same batch size.
Use a minibatch-level transport plan that jointly decides which source graph should be paired with which target graph and how each target should be node-aligned. This can reduce total flow-matching displacement beyond per-example matching, producing shorter and less conflicting training trajectories without modifying the architecture.
Attach a local BCM-trained binary adapter to a pretrained or frozen encoder, allowing new graph nodes or streaming examples to acquire representations without backpropagating through the main network. The adapter learns only from positive co-occurrence statistics and maintains sparse codes, providing a low-memory continual-learning path.
Generate relational training examples by first coupling two graphs or kernels and then interpolating every matched pair of node or edge attributes along a geodesic in Z. Unlike ordinary mixup, this preserves the intrinsic Gromov-Wasserstein correspondence and produces constant-speed paths in the relational metric when Z is geodesic.
Train a finite-element surrogate by minimizing the assembled discrete potential energy rather than a loss against solved displacement labels. The objective uses only the sparse stiffness matrix and load vector, while its exact energy-gap identity makes it equivalent to supervised regression in the stiffness norm.
Represent every pairwise training interaction as a directed edge and edge-color the interaction graph. Use one color class, or a small set of colors, as a microbatch: because a color class is a matching, no data example participates in two pairwise terms within that microbatch. This removes within-batch gradient collisions and provides a graph-dependent estimate of how many dependent strata are being combined.
Use a constant-sum point vector to encode ordered pairwise outcomes and train a neural scorer with an adjacent-categories ordinal likelihood whose slope parameters are tied to those points. The accumulated point score is then a theoretically motivated compressed statistic for repeated comparisons, rather than an arbitrary regression target or one-hot label.
Use a multivariate generating function to construct training examples or network variants with an exactly controlled amount of a structural attribute, such as graph branching, routing depth, skip connections, or the number of experts activated. Train by gradually changing the target coefficient slice instead of relying on an uncontrolled random curriculum.