Geometric Alignment of Representations

• Geometric alignment of representations is the process of comparing and mapping learned embedding spaces as geometric objects to reveal shared structure and internal consistency.
• It employs varied techniques such as rigid transformations, kernel alignment, hyperbolic mapping, and topological methods to match models, modalities, or layers.
• The field leverages specific metrics like Earth Mover’s Distance, normalized Frobenius inner products, and curvature-based measures to quantify alignment quality and guide optimization.

Searching arXiv for relevant papers on geometric alignment of representations to ground the article. arxiv_search(query="geometric alignment of representations", max_results=10) Geometric alignment of representations denotes the comparison, mapping, or co-registration of learned representation spaces as geometric objects rather than as isolated feature vectors. In the cited literature, this notion appears in several forms: alignment between weighted point sets under rigid transformations, kernel alignment of representation-induced similarity structure, latent-space matching between modalities, set-to-set similarity in hyperbolic space, curvature- and topology-based comparison, and shared-universe constructions for many models (Ding et al., 2018, Insulla et al., 19 Feb 2025, Medbouhi et al., 2024, Shu et al., 2024, Achara et al., 5 Feb 2026, Yan et al., 25 May 2026). Across these formulations, the common aim is to determine whether different systems, modalities, layers, or training conditions preserve compatible internal distances, neighborhoods, directions, subspaces, or higher-order structure.

1. Conceptual scope and problem settings

One foundational formulation treats geometric alignment as the problem of aligning two weighted point sets in high-dimensional Euclidean space. Given weighted point sets $A=\{a_1,\dots,a_{n_1}\}$ and $B=\{b_1,\dots,b_{n_2}\}$, the task is to find a rigid transformation $\mathcal{T}$ for $B$ minimizing $\mathcal{EMD}(A,\mathcal{T}(B))$, with Earth Mover’s Distance defined using squared Euclidean ground distance (Ding et al., 2018). In that setting, geometric alignment is a direct optimization problem over rotations, translations, reflections, or combinations thereof.

A second formulation treats alignment as similarity between representation-induced kernels, distances, or operators. In this view, kernel alignment is the central geometric notion: it measures whether two representations induce similar pairwise similarity structure, and it connects metric, probabilistic, and spectral viewpoints (Insulla et al., 19 Feb 2025). A related task-aware variant is stitching, in which a simple adapter $s_{1,2}$ is inserted between two models to test whether one learned representation can support the downstream head of another (Insulla et al., 19 Feb 2025).

A third formulation treats alignment as explicit latent-space matching across modalities. In proteins, for example, the problem is framed as a latent-space matching problem between two very different kinds of encoders: LLMs, which encode protein text descriptions, and geometric deep models, which encode protein structure (Shu et al., 2024). The core idea is that these modalities should not be fused only heuristically; instead, their embeddings should be explicitly mapped into a shared space where corresponding proteins are close and non-matching proteins are far apart (Shu et al., 2024).

Other work generalizes the notion beyond Euclidean latent spaces. HyperDGA defines geometric alignment as whether two sets are intermingled in hyperbolic space, using the proportion of heterogeneous Delaunay edges in the Delaunay graph of the union (Medbouhi et al., 2024). TopoAlign argues that neighborhood similarity and cluster similarity do not directly reveal global shape, branching, merging/splitting, or the correspondence of entire substructures, and therefore models each representation as a mapper graph to compare structure across models, layers, epochs, or modalities (Yan et al., 25 May 2026). Shesha, by contrast, distinguishes extrinsic similarity from intrinsic geometric stability, defining stability as the self-consistency of pairwise dissimilarity geometry under controlled perturbation or resampling (Raju, 14 Jan 2026).

2. Mathematical objectives and similarity measures

Several mathematically distinct objectives recur in this literature. For kernel alignment, the empirical quantity is

$$\widehat{A}(K_{1,n},K_{2,n})= \frac{\langle K_{1,n},K_{2,n}\rangle_F} {\sqrt{\langle K_{1,n},K_{1,n}\rangle_F\langle K_{2,n},K_{2,n}\rangle_F}},$$

a normalized Frobenius inner product between Gram matrices (Insulla et al., 19 Feb 2025). The population form is

$$A(K_1,K_2)= \frac{\operatorname{Tr}(L_{K_1}L_{K_2})} {\sqrt{\operatorname{Tr}(L_{K_1}^2)\operatorname{Tr}(L_{K_2}^2)}},$$

which gives an operator-theoretic interpretation of alignment (Insulla et al., 19 Feb 2025).

In protein multimodal alignment, the training objective is a modified InfoNCE loss over projected text and graph representations, with cosine similarity adjusted into $[0,1]$ via

$\frac{\text{sim}(g_i,t_j)+1}{2},$

temperature $B=\{b_1,\dots,b_{n_2}\}$0, and an evaluation score defined as the difference between average positive-pair similarity and average absolute negative-pair similarity (Shu et al., 2024). The design choice is explicit: the goal is to push positive pairs toward cosine similarity $B=\{b_1,\dots,b_{n_2}\}$1, while pushing negative pairs toward $B=\{b_1,\dots,b_{n_2}\}$2 rather than $B=\{b_1,\dots,b_{n_2}\}$3 (Shu et al., 2024). This makes “non-alignment,” rather than opposition, the relevant negative relation.

HyperDGA defines a set-to-set similarity score in hyperbolic space as

$B=\{b_1,\dots,b_{n_2}\}$4

where $B=\{b_1,\dots,b_{n_2}\}$5 is the edge set of the Delaunay graph of $B=\{b_1,\dots,b_{n_2}\}$6 and $B=\{b_1,\dots,b_{n_2}\}$7 is the subset of heterogeneous edges connecting the two sets (Medbouhi et al., 2024). A score close to $B=\{b_1,\dots,b_{n_2}\}$8 indicates few cross edges, strong separation, and poor alignment; a score close to $B=\{b_1,\dots,b_{n_2}\}$9 indicates many cross edges, strong geometric intermixing, and better alignment (Medbouhi et al., 2024).

Graph-based geometric analysis introduces curvature-based quantities. Using Ollivier-Ricci curvature, the edge curvature is

$\mathcal{T}$0

where $\mathcal{T}$1 is Wasserstein-1 distance between local neighborhood distributions (Torbati et al., 1 Jan 2025). The same work uses discrete Ricci flow with update rule

$\mathcal{T}$2

as a community-detection probe for representational geometry (Torbati et al., 1 Jan 2025).

A further line of work formalizes alignment via measure evolution. In the large-batch limit, unimodal InfoNCE converges to a deterministic energy

$\mathcal{T}$3

while the intrinsic unimodal functional

$\mathcal{T}$4

is strictly convex and admits a unique Gibbs equilibrium (Cai et al., 27 Jan 2026). In the symmetric multimodal case, the intrinsic functional contains a persistent negative symmetric divergence term,

$\mathcal{T}$5

and the paper argues that this induces a structural modality gap (Cai et al., 27 Jan 2026).

3. Geometric spaces, invariances, and structural descriptors

The literature does not assume that all representations should be compared in a single Euclidean geometry. Hyperbolic space is used for hierarchical data, and HyperDGA computes Delaunay structure in the Klein–Beltrami model because geodesics are straight lines there, which makes Delaunay computation reducible to Euclidean computational geometry (Medbouhi et al., 2024). The same paper treats neighborhood connectivity, not only pointwise proximity, as the relevant object of comparison.

GraphShaper makes the geometric-diversity claim explicit. It argues that current graph-text alignment methods force all local graph structures into one Euclidean latent space before aligning them with text embeddings, even though different graph motifs have different intrinsic geometry (Zhang et al., 14 Oct 2025). Hyperbolic space is best for hierarchical or tree-like structures, spherical space is appropriate for cycles and other closed, rotationally symmetric patterns, and Euclidean space remains suitable for regular, grid-like, locally uniform connectivity (Zhang et al., 14 Oct 2025). Its core claim is that preserving these intrinsic geometries during graph encoding helps produce embeddings that are more faithful and therefore easier to align with text semantics (Zhang et al., 14 Oct 2025).

Other work describes geometry through discrete curvature, intrinsic dimension, or topology. The curvature-based comparison between human judgments and neural face representations argues that standard representational similarity methods like RSA are not enough if one wants to compare not just global similarity but the local intrinsic geometry of representational spaces (Torbati et al., 1 Jan 2025). Local intrinsic dimension provides another descriptor: lower local intrinsic dimension is associated with stronger AI–AI alignment, stronger AI–brain alignment, and better generalization, whereas global dimension measures fail to capture these effects (Yu et al., 30 Jan 2026). This suggests that the relevant geometry is local structure, not global volumetric dimension.

Topology-aware comparison pushes beyond geometric neighborhoods and clusters. TopoAlign converts high-dimensional point clouds into mapper graphs by applying a filter function, covering the filter range with overlapping intervals, clustering points in each interval with DBSCAN, and constructing nodes and edges from cluster overlaps (Yan et al., 25 May 2026). In that framework, structural correspondence includes one-to-one, fan-out, fan-in, crossing, and vanishing/appearance motifs (Yan et al., 25 May 2026). The emphasis shifts from distance preservation to how knowledge is arranged.

Invariant structure also matters. Barycentric alignment formalizes nuisance symmetries such as permutation of units and orthogonal transformations, and constructs a universal embedding space by computing a Procrustes barycenter in the quotient space induced by orthogonal transformations (Saha et al., 9 Feb 2026). Orthogonal alignment is preferred because it removes rotations while preserving Euclidean distances, so the internal geometry of each model’s representation is not distorted (Saha et al., 9 Feb 2026).

4. Alignment mechanisms and architectural strategies

Projection-based alignment remains a standard mechanism. In the protein setting, each LLM–GDM pair uses two projection heads, one for the LLM embedding and one for the GDM embedding, initially as simple linear layers that map from the source embedding dimension into the LLM embedding dimension, followed by normalization (Shu et al., 2024). The baseline is therefore a projection-and-contrastive objective, but the empirical study shows that the mapping from GDM space to LLM space is not purely linear, and that a 2-layer projection head offers the best tradeoff between expressiveness and overfitting (Shu et al., 2024).

Geometry-aware specialization appears in graph-text transfer. GraphShaper uses three geometric experts—a Euclidean expert, a hyperbolic expert, and a spherical expert—then computes dynamic fusion weights by softmax and mixes the experts adaptively (Zhang et al., 14 Oct 2025). Boundary nodes are not forced into a single geometry; they receive a learned mixture that can preserve multiple constraints simultaneously (Zhang et al., 14 Oct 2025). A diversity regularizer, the minimum hyperspherical separation loss, encourages distinct geometric roles among the experts (Zhang et al., 14 Oct 2025).

Dynamic feature realignment is another pattern. GeoAlign argues that injecting geometric features from one fixed deep layer of a 3D foundation model induces a task misalignment bias, because the best layer depends on the spatial task (Liu et al., 14 Apr 2026). It therefore builds a hierarchical geometric feature bank from multiple intermediate layers, uses the MLLM’s original visual tokens as content-aware queries, applies Top-$\mathcal{T}$6 sparse routing, and aggregates selected features before residual injection back into the visual stream (Liu et al., 14 Apr 2026). The paper reports that Top-2 is the best balance, and that injecting geometric features before the LLM is best (Liu et al., 14 Apr 2026).

Explicit geometric correspondence is used where geometry is directly observable. SGANet’s Multi-View Geometric Alignment uses calibrated multi-view geometry to identify corresponding patches across views and minimizes Euclidean feature distance between matched locations across both 2D and 3D modalities (Bai et al., 7 Apr 2026). Selfi trains a lightweight feature adapter on top of a frozen VGGT backbone so that pixels corresponding to the same 3D point across views have similar features; the key loss is a reprojection-based consistency loss using VGGT’s own depth and pose outputs as pseudo-ground-truth (Deng et al., 9 Dec 2025). In both cases, the aligned space is explicitly trained so that feature similarity corresponds to spatial proximity in 3D (Bai et al., 7 Apr 2026, Deng et al., 9 Dec 2025).

A related strategy appears in molecule generation. LENSEs introduces a representation head that aggregates multi-layer encoder features, a molecule perceptual loss, and a node-level representation alignment loss $\mathcal{T}$7 that explicitly aligns the generator’s hidden states with encoder node representations using cosine similarity (Yan et al., 8 May 2026). The paper frames this as bridging the semantic gap between the pretrained encoder and the generator (Yan et al., 8 May 2026).

Task-specific semantic-geometric alignment can also be prototype-based. In open-vocabulary 3D affordance grounding, part-aware instructions generated by an LLM create a semantic anchor, while Affordance Prototype Aggregation captures cross-object geometric consistency for each affordance and Intra-Object Relational Modeling refines geometric differentiation within objects (Gou et al., 18 Mar 2026). The point is not generic feature matching, but aligning language to part-aware geometry and then aligning region geometry to canonical affordance prototypes (Gou et al., 18 Mar 2026).

5. Determinants of alignment quality and empirical regularities

Empirical studies repeatedly show that alignment quality depends on the geometry encoded before alignment, not only on the alignment layer itself. In proteins, the strongest alignment comes from GDMs that mix graph structure with richer geometric information: ScanNet and GearNet consistently outperform GVP and GAT, and GAT remains near zero even after training (Shu et al., 2024). The explanation given is that ScanNet and GearNet encode not only connectivity but also 3D geometric cues, such as angular information, atomic-level structure, and spatial relations (Shu et al., 2024). The same study finds that larger LLMs align better, that increasing GDM embedding dimension improves alignment across all LLMs, and that fine-tuning LLMs on protein-specific data further improves alignment (Shu et al., 2024).

Data properties can dominate model-side effects. In the protein study, sequence length turns out not to matter much and single-chain versus multi-chain status shows no clear relationship, but rarity matters a lot: popular proteins align much better than rare proteins (Shu et al., 2024). The paper links this to dataset bias, and emphasizes that “negative” pairs are not always truly unrelated because homologous proteins can be structurally similar despite different IDs (Shu et al., 2024). This suggests that alignment quality is partly a data curation problem.

HyperDGA provides a task-free evaluation signal for hyperbolic representations. On synthetic tree-like protein-evolution data with noise, HyperDGA changes monotonically as noise increases; in Hyperbolic VAE evaluation, it shows the strongest correlation with both training loss and a supervised performance score, and it exhibits jumps when the latent space forms new clusters during training (Medbouhi et al., 2024). The paper interprets this as sensitivity not only to geometry but also to topological changes (Medbouhi et al., 2024).

Local intrinsic dimension is presented as a unifying empirical regularity. Lower local intrinsic dimension is consistently associated with stronger model–model alignment, stronger model–brain alignment, and better generalization; increasing model capacity and training data scale systematically reduces local intrinsic dimension (Yu et al., 30 Jan 2026). In that account, scaling drives representations toward lower local dimension (Yu et al., 30 Jan 2026).

Safety-alignment work adds a different empirical regularity. Skin-Deep argues that harmful-request refusal is encoded in a low-dimensional geometric signature in the residual stream, visible before any attack or fine-tuning is applied (Lee et al., 21 Jun 2026). Its Geometric Fragility Score,

$\mathcal{T}$8

compresses layer-wise safety geometry into a single scalar (Lee et al., 21 Jun 2026). The paper reports that GFS identifies, before any fine-tuning, the initially safe model that retains the most refusal after small-scale LoRA fine-tuning (Lee et al., 21 Jun 2026).

6. Shared reference spaces, multi-way alignment, and instance-level comparison

Pairwise alignment is often insufficient when $\mathcal{T}$9. Multi-Way Representation Alignment argues that standard pairwise alignment scales quadratically with the number of models, yields no global reference, and can violate cycle consistency (Achara et al., 5 Feb 2026). It therefore adapts Generalized Procrustes Analysis to learn a shared orthogonal universe,

$B$0

with induced pairwise maps $B$1 (Achara et al., 5 Feb 2026). Because $B$2, GPA preserves pairwise distances, angles, and the internal topology of each representation space (Achara et al., 5 Feb 2026).

That work also argues that strict isometric alignment is suboptimal for retrieval, where agreement-maximizing methods like GCCA typically prevail (Achara et al., 5 Feb 2026). Geometry-Corrected Procrustes Alignment is proposed to bridge this gap: first build a robust orthogonal GPA universe, then apply a shared correction map in universe space to reduce residual directional mismatch (Achara et al., 5 Feb 2026). The result is geometry-aware but not geometry-rigid (Achara et al., 5 Feb 2026).

Barycentric alignment develops a related but distinct universal-space construction. For $B$3 models with representation matrices $B$4, it computes a Procrustes barycenter by alternating between orthogonal alignment,

$B$5

and template update,

$B$6

until convergence (Saha et al., 9 Feb 2026). Because the framework quotients out nuisance symmetries, it enables instance-level similarity scores,

$B$7

for individual stimuli rather than only global dataset-level summaries (Saha et al., 9 Feb 2026).

The instance-level perspective yields substantive findings. In vision model pools, high-consistency images are typically visually unambiguous, canonical, and category-consistent, whereas low-consistency images are often cluttered, atypical, or perceptually ambiguous (Saha et al., 9 Feb 2026). In LLM pools, high-consistency sentences tend to be conventional, scene-based, lexically frequent, semantically grounded, and syntactically simple (Saha et al., 9 Feb 2026). The same framework aligns brain responses across subjects and cortical regions, and also yields a shared image-text space from independently trained unimodal models with retrieval and human-correlation performance approaching CLIP (Saha et al., 9 Feb 2026).

7. Tradeoffs, limitations, and competing diagnostics

A recurrent controversy is whether alignment should be defined by similarity alone. Shesha explicitly rejects that equivalence: similarity is extrinsic, stability is intrinsic (Raju, 14 Jan 2026). Across 2,463 configurations in seven domains, stability and similarity are empirically uncorrelated, with $B$8, and the paper argues that similarity metrics collapse after removing just the top principal components, while Shesha remains sensitive to fine-grained manifold structure distributed across the spectral tail (Raju, 14 Jan 2026). This makes stability a complement to, not a substitute for, alignment (Raju, 14 Jan 2026).

Another tension concerns retrieval versus geometry preservation. GPA preserves geometry, but retrieval often benefits from reshaping the space to increase agreement between matched items; GCCA improves retrieval but distorts geometry (Achara et al., 5 Feb 2026). A plausible implication is that “good alignment” is task-dependent: model stitching, retrieval, probing, and topology-preserving comparison do not impose identical geometric requirements.

Objective-level tradeoffs can also be written geometrically. “What Is the Geometry of the Alignment Tax?” defines the alignment tax rate as

$B$9

the squared projection of the safety direction onto the capability subspace (Young, 9 Feb 2026). In the single-capability case, $\mathcal{EMD}(A,\mathcal{T}(B))$0, where $\mathcal{EMD}(A,\mathcal{T}(B))$1 is the angle between safety and capability (Young, 9 Feb 2026). The paper derives an exact safety-capability Pareto frontier parameterized by this angle and argues that the tax decomposes into an irreducible component $\mathcal{EMD}(A,\mathcal{T}(B))$2 and a packing residual $\mathcal{EMD}(A,\mathcal{T}(B))$3 that vanishes as $\mathcal{EMD}(A,\mathcal{T}(B))$4 under random packing (Young, 9 Feb 2026). This extends geometric alignment language from model comparison to tradeoffs between directions in representation space.

Contrastive multimodal learning introduces a different limitation. The geometric mechanics analysis argues that the symmetric multimodal objective contains a persistent negative symmetric divergence term that remains even after kernel sharpening, so exact marginal matching is unstable and a population-level modality gap becomes a structural geometric necessity rather than an initialization artifact (Cai et al., 27 Jan 2026). This directly opposes views in which cross-modal contrastive learning should converge to a single undifferentiated shared distribution.

Finally, many papers identify data and correspondence quality as limiting factors. Protein alignment is distorted by database bias and homologous negatives (Shu et al., 2024). HyperDGA is rational-valued, discrete, discontinuous, and non-differentiable (Medbouhi et al., 2024). TopoAlign’s local alignment discovery is exploratory rather than globally optimal, and current support is pairwise rather than multi-graph (Yan et al., 25 May 2026). These caveats indicate that geometric alignment is not one method but a family of representational analyses whose meaning depends on the geometry being preserved, the invariances being quotiented out, the supervision available, and the downstream criterion by which “alignment” is judged.