MATH · IN · MODELS
structures / Manifolds / Curvature profile of the representation manifold

Curvature profile of the representation manifold

PROPERTYmeasurementfunctionaladvancedhow it's classified →

How much a network's representation manifold bends — measured, not assumed as a named shape. Two non-interchangeable notions: extrinsic principal curvature (MAPC, local-PCA fit, ambient bending) and intrinsic graph-Ricci curvature (Ollivier/Forman, optimal-transport/combinatorial). Reported as a profile across depth/training, orthogonal to intrinsic dimension.

Replicationcomputed from the corpus — never hand-assigned
18 papers · no shared authors10 architecture classes · across papers6 domains · across papers17 model families · across papers
Filled = two or more values reported by papers that share no author — replication. Outlined = two or more values, but all from a single study — breadth, not replication. Grey = a single value. Derived from paper authorship and each model's architecture class, domain and family; it updates itself when a paper is added.

Definition

Rather than claiming the representation manifold is some named shape (sphere, torus, paraboloid…), this node covers papers that measure how curved it is at a given layer/training point — a computed quantity, not a geometric object in its own right. Two genuinely different notions of “curvature” appear here, and they must not be merged:

  • Extrinsic principal curvature (mean absolute principal curvature, MAPC/NMAPC): fit local quadratic surfaces (via local PCA on neighborhoods) to the point cloud and measure how much it bends away from its own local tangent plane, embedded in the ambient activation space.
  • Intrinsic graph curvature (Ollivier-Ricci, Forman-Ricci): build a k-NN or similarity graph over activations and compute a discrete, combinatorial/optimal-transport curvature at each vertex or edge, entirely from the graph’s own connectivity and neighbor-mass transport cost — no ambient embedding or ambient ruler is referenced.

These measure different things: extrinsic curvature depends on how the manifold sits inside its ambient space, while intrinsic (graph) Ricci curvature is a property of the graph alone and would be unchanged by any embedding that preserves local neighbor relations. A paper reporting one does not thereby report the other.

Relative to intrinsic-dimension-profile

Intrinsic-dimension profile across depth tracks how many coordinates the manifold needs (its dimensionality) across depth or training; this node tracks how bent the manifold is, independent of its dimension. The two are orthogonal: a 1-dimensional circle embedded in a high-dimensional space has intrinsic dimension 1 at every radius, yet nonzero (and tunable) curvature — dimension and curvature are separate facts about the same manifold, and a flat, zero-curvature object can still have arbitrarily high dimension. Papers in this node should not be read as making any claim about dimensionality, and vice versa.

Key evidence: extrinsic curvature (MAPC)

Kaufman & Azencot (2023) estimate principal curvatures of the latent data manifold at hidden layers of real trained ResNet and VGG image classifiers, via a normalized mean-absolute principal curvature (NMAPC) computed from local-PCA neighborhoods. Trained networks show a characteristic curvature profile across layers — an initial steep increase, a long plateau, then a further increase — absent in untrained networks (which stay flat). The curvature gap between the last two layers correlates strongly with generalization capability, and the paper explicitly notes that intrinsic dimension of the same latent codes is “not necessarily indicative of curvature” — an independent confirmation, from the source paper itself, of this node’s orthogonality claim relative to Intrinsic-dimension profile across depth. See kaufman-azencot-2023-mapc-curvature-tracks-generalization-in-real-resnet-and-vgg-image-classifiers.

Rahman, Barrett & Last (2026) measure a third, simpler extrinsic instrument on Google AlphaEarth’s 64-dimensional satellite embeddings (~12.1 million real CONUS samples): the angle between locally-fit tangent spaces (local PCA) at neighboring points of the manifold. A flat (affine) manifold would show zero tangent-space rotation everywhere; instead, 84% of sampled locations show rotation exceeding 60 degrees between adjacent probe tangent spaces, with the largest instability in mountainous regions with steep environmental gradients. A separate local-versus-global comparison — how far each local tangent space tilts relative to the global principal axes — gives a mean |cos theta| of 0.169, a distinct metric from the adjacent-probe rotation. Both are direct, if cruder, extrinsic-bending signals in the same family as MAPC (both are local-PCA-based), reported alongside (not merged with) the same paper’s separate intrinsic-dimension-profile measurement (effective dimensionality 13.3, local ID ~10). See alphaearths-64-dimensional-embedding-manifold-has-effective-dimensionality-13-3-and-tangent-spaces-that-rotate-over-60-degrees-across-84-percent-of-locations.

Key evidence: intrinsic curvature and Ricci-flow-like evolution

Hehl, von Renesse & Weber (2025) build k-NN graphs from layer-wise activations of real feedforward MLPs (widths 15/25/50, depths 7/10/15, over 20,000 networks total) trained on binary MNIST/Fashion-MNIST/ CIFAR-10 subsets, computing discrete Ollivier-Ricci and augmented Forman-Ricci curvature per vertex, plus a derived local Ricci-evolution coefficient (the correlation, across layers, between curvature and neighborhood-distance change). A majority-negative coefficient pattern (88.7%-98.3% of vertices, architecture-dependent) indicates genuine Ricci-flow-like contraction dynamics in the real trained network’s feature geometry — a dynamical pattern measured on top of the curvature quantity, not a claim that the manifold itself is a dynamical object with attractors or bifurcations of its own (which would instead warrant a dynamical-object role). The coefficient’s trend reverses at the point coinciding with the onset of overfitting and with the depth that maximizes test accuracy. See hehl-etal-2025-discrete-ollivier-ricci-curvature-of-real-trained-mlp-activation-graphs-shows-flow-like-contraction-dynamics-that-reverse-at-the-onset-of-overfitting.

Key evidence: generator/decoder pullback metric (VAEs and GANs)

A third extrinsic instrument, distinct from both MAPC (local-PCA on a static point cloud) and tangent-space rotation, applies specifically to generative models with an explicit differentiable latent-to-data generator map: the Generator/decoder Jacobian pullback metric, M(z)=Jg(z)Jg(z)M(z) = J_g(z)^\top J_g(z). Arvanitidis, Hansen & Hauberg (2018) introduce a stochastic version for real VAEs trained on MNIST and video-frame data, showing geodesics under this metric substantially improve interpolation and density estimation over naive Euclidean latent distance. Shao, Kumar & Fletcher (2018) apply the deterministic version to real VAEs trained on CelebA and SVHN, finding the learned manifold is surprisingly close to zero curvature — linear interpolation nearly matches true geodesics, a notably different emphasis from Arvanitidis et al.’s finding that latent distortion is significant enough to warrant correction. Wang & Ponce (2021) eigen-decompose the same metric across several real pretrained GANs (BigGAN, PGGAN, StyleGAN2, DCGAN and others), finding image variation concentrates along surprisingly few, position-homogeneous major axes. Shukla, Bhagat, Anand & Turaga (2018) compare the metric’s curvature across a vanilla VAE and three disentangling VAE variants trained on MNIST, MultiPIE and 3D Chairs, finding class-distinguishing latent regions carry measurably higher curvature than a vanilla VAE’s latent space. All four are purely observational (no causal intervention on the manifold itself). See arvanitidis-hansen-hauberg-2018-a-real-vaes-decoder-induced-pullback-metric-and-its-geodesics-substantially-improve-interpolation-and-density-estimation-over-naive-euclidean-latent-distance, shao-etal-2018-real-celeba-and-svhn-trained-vae-manifolds-are-surprisingly-close-to-zero-curvature-so-linear-latent-interpolation-nearly-matches-true-geodesics, wang-ponce-2021-image-variation-in-several-real-pretrained-gans-concentrates-along-surprisingly-few-position-homogeneous-major-axes-of-the-pullback-metric, and shukla-etal-2018-class-distinguishing-latent-regions-of-real-disentangled-vae-variants-carry-measurably-higher-pullback-metric-curvature-than-a-vanilla-vaes-latent-space.

Key evidence: Fisher information metric and phase-transition structure

A fourth, intrinsic instrument reconstructs a Fisher information metric from a generative model’s implicit log-partition function (the Hessian of logZ\log Z), rather than fitting a point cloud or pulling back a generator’s Jacobian — see Fisher information metric reconstruction from a log-partition function. Lobashev, Guskov, Larchenko & Tamm (2026) validate this reconstruction against exactly-solvable statistical-physics systems (2D Ising model, TASEP) before applying it to a real Stable Diffusion 1.5 (Dreamshaper8 checkpoint) latent space, finding a fractal structure of phase transitions: geodesic interpolation is locally linear within a phase, but breaks down at phase boundaries, where the local Lipschitz constant diverges — a genuinely different kind of finding from the other entries on this node (discontinuous phase structure, not a smooth curvature number or profile). See lobashev-etal-2026-a-real-stable-diffusion-1-5-latent-space-shows-a-fractal-structure-of-fisher-metric-phase-transitions-with-diverging-lipschitz-constants-at-phase-boundaries.

Key evidence: spin-glass phase diagnostics and attention-weighted graph curvature

Two further instruments extend this node’s intrinsic/regime-detecting side. Ascárate, Lebrat, Santa Cruz, Fookes & Salvado (2026) apply Spin-glass order-parameter diagnostics for latent phase structure (overlap distributions between sampled latent codes, order parameters, susceptibility — tools imported from spin-glass statistical physics) to real trained VAE/ autoencoder latent spaces on CIFAR-10, CelebA64, Mars Rover Mastcam, and Galaxy Zoo 64 image data, finding the latent space organizes into measurably distinct ordered, disordered, and glassy phase regimes; a hyperspherical-compression intervention that shifts the regime toward more order improves downstream anomaly-detection AUROC (Mars Rover: 0.66->0.76 kNN-AUROC; Galaxy Zoo 64: 0.74->0.79). This is a phase-regime finding in the same family as Lobashev et al.’s Fisher-metric phase transitions above, via a different (spin-glass rather than information-geometric) instrument. See ascarate-etal-2026-real-trained-vae-latent-spaces-organize-into-measurably-distinct-ordered-disordered-and-glassy-phases-and-shifting-toward-a-more-ordered-phase-improves-anomaly-detection.

Tori, Bini, Sorbi, Marchand-Maillet & Ginis (2026) apply Attention-weighted graph curvature analysis (Balanced Forman Curvature computed on a real trained graph transformer’s own attention-re-weighted input graph, rather than a k-NN graph built from activations) to real Graph Transformers on ZINC, Tox21, and Long-Range Graph Benchmark peptide datasets, finding a “Curvature Collapse”: the fraction of negatively-curved edges in the attention-weighted effective graph jumps from 57% to 84% (peptides-func) and 57% to 82% (peptides-struct) relative to the raw input graph’s own curvature — attention concentrates on and worsens existing topological bottlenecks rather than smoothing them, confirmed as functionally load-bearing (not an artifact) via causal edge-pruning that spikes loss by 22-27%. This is a genuinely different graph-curvature construction from Hehl et al.’s k-NN-of-activations Ollivier/Forman-Ricci above: it re-weights a pre-existing external graph rather than deriving a graph from the network’s own representation cloud. See tori-etal-2026-a-real-trained-graph-transformers-attention-weighted-effective-graph-undergoes-curvature-collapse-concentrating-on-and-worsening-bottleneck-edges-rather-than-smoothing-them.

Key evidence: hyperbolic-embedding distortion and Gromov delta-hyperbolicity fit

A fifth instrument, Hyperbolic embedding distortion and Gromov delta-hyperbolicity fit, asks a different question than the others on this node: not how curved an arbitrary representation manifold is, but whether a network architecturally given a curved (hyperbolic) embedding space actually achieves a low-distortion, metric-faithful embedding of the graph it is trained on — a genuinely measured, task-conditional property, not a confirmation that the imposed geometry works as designed. Naddeo, Linkerhägner, Toschi, Skenderi & Lachi (2026) train real HGCN (Poincare-ball, learnable curvature) and HyboNet (Lorentz-model) graph neural networks — versus Euclidean GCN/GAT/MLP baselines — on Cora, Citeseer, Pubmed, Disease and Airport (node classification and link prediction), plus synthetic tree/grid graphs, measuring embedding distortion δ(h)=dc(h)/de(h)\delta(h) = d_c(h)/d_e(h) (contraction/expansion of learned latent distances vs. graph shortest-path distances), a normalized Stress Loss, and each dataset’s exact Gromov delta-hyperbolicity (Disease 0.0, Airport 1.0, Pubmed 3.5, Citeseer 4.5, Cora 11.0). The hyperbolic advantage is sharply task-conditional: on synthetic trees, HyboNet/HGCN show markedly lower stress than Euclidean models at low dimension, but the advantage vanishes by d=128d=128 and reverses entirely on grid graphs; critically, on real-world node classification, “none of the models learn metric-preserving embeddings” regardless of architecture, while only link prediction (a geometry-aligned task) shows HGNNs achieving both lower distortion and higher ROC-AUC/AP, especially on low-hyperbolicity datasets (Disease, Airport) — confirmed as functionally load-bearing, not incidental, via a feature-corruption experiment where HGNNs retain higher performance and lower distortion under progressive noise than Euclidean models. See naddeo-etal-2026-hyperbolic-gnns-achieve-low-distortion-embeddings-only-on-tree-like-graphs-under-geometry-aligned-tasks.

Why one node, not two

Kaufman & Azencot’s extrinsic principal curvature and Hehl et al.’s intrinsic graph-Ricci curvature are hosted on the same node deliberately, mirroring Intrinsic-dimension profile across depth (which also hosts several distinct estimators — TwoNN, GRIDE, effective rank, MST-based — under one “what is the dimensionality trajectory” question). Both papers here answer the same higher-level question — “how much, and how, is the representation manifold curved, as a function of depth/training” — with different instruments. Splitting into two separate nodes (principal-curvature-profile / ricci-curvature-profile) is deferred until either notion is independently replicated by a second paper using that same instrument; until then, a single node with the extrinsic/intrinsic distinction carried explicitly in the text (never merged into one number) is the more honest representation of the current evidence base.

Independent contemporaneous discovery of the pullback metric, applied to robot motion and human mocap. Chen, Jiang, Klushyn, Kurle, Bayer & van der Smagt (2018) independently derive the same deterministic pullback metric as Arvanitidis et al. and Shao et al. above, applying an SVD smoothing regularizer and demonstrating it on a real IWAE trained on MNIST, a simulated 6-DOF robot-arm circular-motion dataset, and real CMU motion-capture walking data — geodesics under the pullback metric consistently beat naive Euclidean latent interpolation at producing natural, class-consistent, or physically plausible interpolation paths in all three settings. See chen-etal-2018-a-real-trained-importance-weighted-autoencoders-pullback-riemannian-geodesics-outperform-euclidean-latent-interpolation-on-mnist-a-simulated-robot-arm-and-real-human-motion-capture-data.

Generalizing the pullback metric to a Finsler norm. Pouplin, Eklund, Ek & Hauberg (2023) generalize the expected-pullback-metric approach to a Finsler metric that retains the full distribution of stochastic pullback metrics rather than collapsing it to a single expectation, proving both notions converge at rate O(1/D)O(1/D) as ambient dimension grows, and confirming this convergence empirically on real GP-LVMs trained on a 256-dimensional font-contour dataset and a 48-dimensional qPCR single-cell dataset (with visible divergence only in low-dimensional synthetic settings). See pouplin-etal-2023-a-real-trained-gp-lvms-riemannian-and-finslerian-latent-geodesics-converge-on-high-dimensional-real-datasets-but-diverge-in-low-dimensional-synthetic-settings.

Score-Jacobian spectral gaps in diffusion models, a curvature-adjacent diagnostic along the noise axis. Ventura, Achilli, Silvestri, Lucibello & Ambrogioni (2025) apply a statistical-physics/random-matrix treatment to a diffusion model’s score-function Jacobian, predicting and then empirically confirming — on real diffusion models trained on MNIST, CIFAR-10, and CelebA — that the Jacobian’s eigenvalue spectrum develops gaps as sampling noise decreases, with gap locations tracking each dataset’s sub-manifold dimensionality and marking distinct geometric phase transitions in the generative dynamics. See ventura-etal-2025-real-diffusion-models-trained-on-mnist-cifar10-and-celeba-show-score-jacobian-spectral-gaps-matching-random-matrix-theory-predictions-for-sub-manifold-dimensionality.

Retargeting the score-Jacobian spectral gap from the true score to the empirical score reveals memorization as a dimension-loss process. Achilli, Ventura, Silvestri, Pham, Raya, Krotov, Lucibello & Ambrogioni (2024) reuse Ventura et al.’s score-Jacobian spectral-gap estimator, built above for the true (population) score, on the empirical score of real DDPMs trained from scratch on MNIST, Fashion-MNIST, CIFAR-10, CelebA-HQ and LSUN-Church across 38 training-set-size splits per dataset — new spectral gaps appear that only a theory of the empirical score, not the true score, predicts, and the resulting local intrinsic dimension declines smoothly as training-set size shrinks into a memorization regime before collapsing toward zero (see also Dimensional collapse). See achilli-etal-2024-real-ddpm-spectral-gap-dimension-shrinks-toward-zero-as-training-set-size-falls-tracing-memorization-induced-dimensional-collapse.

The same score-Jacobian curvature diagnostic, mapped onto a Dense Associative Memory energy landscape. Pham, Raya, Negri, Zaki, Ambrogioni & Krotov (2025) identify a diffusion model’s own energy function with a Hopfield-network (Dense Associative Memory) energy and reuse the identical score-Jacobian SVD/spectral-gap curvature diagnostic on real DDPMs trained from scratch on MNIST, Fashion-MNIST, CIFAR-10 and LSUN-Church, finding the resulting memorized/spurious/generalized transition point matches Achilli et al.’s dimensional-collapse critical points on the same checkpoints, and that this transition’s location scales with model capacity (a U-Net width ablation on CIFAR-10 and LSUN-Church) rather than dataset size alone. See pham-etal-2025-mapping-real-trained-ddpm-score-jacobian-curvature-onto-a-densam-energy-landscape-reveals-a-memorized-spurious-generalized-transition-that-shifts-with-model-capacity.

A local, trajectory-level Jacobian-norm diagnostic, complementary to the population-level score-Jacobian spectral gap. Sakamoto & Sakamoto (2026) define a Critical Boundary Detector (CBD), the Frobenius norm of the Jacobian of a diffusion model’s own normalized score/velocity field along a single generation trajectory, and show on a real pretrained DDPM-CIFAR10 checkpoint that this local instrument correlates strongly with LPIPS perceptual distance (mean Pearson r=0.928 across 5 seeds) and, when used to target classifier guidance to a detected “switching band,” matches full-guidance target-class accuracy (0.96-1.00) using only about 4% of the diffusion steps. Real experiments on Stable Diffusion 3.5 Medium, DiT-XL (ImageNet), EDM2-XS (CIFAR-10) and a CelebA-HQ DDPM show the same instability-band structure across architectures. The paper positions CBD explicitly as a complementary, single-trajectory geometric diagnostic to the population-level score-Jacobian spectral-gap technique above, not a replacement for it. See sakamoto-sakamoto-2026-a-real-ddpm-cifar10-checkpoints-critical-boundary-detector-correlates-with-lpips-and-matches-full-classifier-guidance-accuracy-using-only-4-percent-of-diffusion-steps.

Key papers

  • Kaufman, I. & Azencot, O. (2023). Data Representations’ Study of Latent Image Manifolds. ICML 2023, arXiv:2305.19730 — origin of the MAPC/NMAPC extrinsic curvature-profile measurement.
  • Hehl, M., von Renesse, M. & Weber, M. (2025). Neural Feature Geometry Evolves as Discrete Ricci Flow. arXiv:2509.22362 — origin of the discrete Ollivier/Forman-Ricci intrinsic curvature measurement and its Ricci-flow-like evolution across depth.
  • Rahman, M., Barrett, S. J. & Last, C. (2026). Characterizing AlphaEarth Embedding Geometry for Agentic Environmental Reasoning. arXiv:2604.18715 — tangent-space-rotation extrinsic curvature signal on a real satellite-embedding manifold.
  • Arvanitidis, G., Hansen, L. K. & Hauberg, S. (2018). Latent Space Oddity: On the Curvature of Deep Generative Models. ICLR 2018, arXiv:1710.11379 — stochastic generator-pullback-metric curvature on real VAEs.
  • Shao, H., Kumar, A. & Fletcher, P. T. (2018). The Riemannian Geometry of Deep Generative Models. CVPR Workshop 2018, arXiv:1711.08014 — near-zero-curvature finding on real VAE manifolds.
  • Wang, B. & Ponce, C. R. (2021). The Geometry of Deep Generative Image Models and its Applications. arXiv:2101.06006 — pullback-metric eigen-decomposition across several real pretrained GANs.
  • Shukla, A., Bhagat, S., Anand, S. & Turaga, P. K. (2018). Geometry of Deep Generative Models for Disentangled Representations. ICVGIP 2018, arXiv:1902.06964 — comparative curvature across disentangled vs. vanilla real VAEs.
  • Lobashev, A., Guskov, D., Larchenko, M. & Tamm, M. (2026). Hessian Geometry of Latent Space in Generative Models. arXiv:2506.10632 — Fisher-information-metric phase-transition structure in a real Stable Diffusion latent space.
  • Ascárate, A., Lebrat, L., Santa Cruz, R., Fookes, C. & Salvado, O. (2026). High-Dimensional Latents Should Be Diagnosed Through Phase Structure. arXiv:2606.02600 — spin-glass overlap-diagnostic phase regimes in real trained VAE latent spaces.
  • Tori, F., Bini, L., Sorbi, M., Marchand-Maillet, S. & Ginis, V. (2026). Probing Graph Neural Network Activation Patterns Through Graph Topology. arXiv:2602.21092 — attention-weighted graph curvature collapse in real trained graph transformers.
  • Chen, N., Jiang, X., Klushyn, A., Kurle, R., Bayer, J. & van der Smagt, P. (2018). Metrics for Deep Generative Models. AISTATS 2018, arXiv:1711.01204 — independently-discovered pullback metric with SVD smoothing, on real IWAEs (MNIST, robot arm, motion capture).
  • Pouplin, A., Eklund, D., Ek, C. H. & Hauberg, S. (2023). Identifying Latent Distances with Finslerian Geometry. TMLR 2023, arXiv:2212.10010 — Finsler generalization of the pullback metric, on real GP-LVMs (font contours, qPCR).
  • Ventura, E., Achilli, B., Silvestri, G., Lucibello, C. & Ambrogioni, L. (2025). Manifolds, Random Matrices and Spectral Gaps: The Geometric Phases of Generative Diffusion. ICLR 2025, arXiv:2410.05898 — score-Jacobian spectral gaps on real diffusion models (MNIST, CIFAR-10, CelebA).
  • Achilli, B., Ventura, E., Silvestri, G., Pham, B., Raya, G., Krotov, D., Lucibello, C. & Ambrogioni, L. (2024). Losing Dimensions: Geometric Memorization in Generative Diffusion. arXiv:2410.08727 — retargets the score-Jacobian spectral gap to the empirical score, revealing memorization-induced dimensional collapse.
  • Pham, B., Raya, G., Negri, M., Zaki, M. J., Ambrogioni, L. & Krotov, D. (2025). Memorization to Generalization: Emergence of Diffusion Models from Associative Memory. arXiv:2505.21777 — maps the same score-Jacobian curvature diagnostic onto a Dense Associative Memory energy landscape, capacity-dependent memorization transition.
  • Sakamoto, R. & Sakamoto, K. (2026). The Geometry of Phase Transitions in Generative Dynamics via Projection Caustics. arXiv:2606.13191 — Critical Boundary Detector, a local trajectory-level Jacobian-norm curvature diagnostic correlating with LPIPS on a real DDPM-CIFAR10 checkpoint.
  • Naddeo, D., Linkerhägner, J., Toschi, N., Skenderi, G. & Lachi, V. (2026). Hyperbolic Graph Neural Networks Under the Microscope: The Role of Geometry-Task Alignment. arXiv:2602.01828 — embedding distortion and Gromov delta-hyperbolicity fit, showing the hyperbolic advantage is task-conditional in real trained HGCN/HyboNet models.

Found in (18 observations · 17 families)

Achilli/Pham et al. Diffusion Memorization-Transition DDPMs

Losing Dimensions: Geometric Memorization in Generative Diffusion (2024)measured

Real trained DDPMs lose spectral-gap dimension smoothly as training-set size shrinks into a memorization regime

Details

Achilli, Ventura, Silvestri, Pham, Raya, Krotov, Lucibello & Ambrogioni retarget the score-Jacobian spectral-gap estimator from Ventura et al. (2025) -- built for the true (population) score -- to the empirical score of real trained DDPMs, finding new spectral gaps appear that only a theory of the empirical score, not the true score, predicts [achilli-etal-2024-losing-dimensions-geometric-memorization-diffusion] Across real DDPMs (PixelCNN++-backbone U-Nets, 24.5M-61.7M parameters) trained from scratch on MNIST, Fashion-MNIST, CIFAR-10, CelebA-HQ and LSUN-Church at 38 dataset-size splits per dataset, the spectral-gap-estimated local intrinsic dimension declines smoothly across a training-set-size window of roughly 1000-10000 samples (dataset-specific critical points A/B, e.g. CIFAR-10 A=2000/B=16000 of 50000 total) before collapsing toward zero below it [achilli-etal-2024-losing-dimensions-geometric-memorization-diffusion] A secondary participation-ratio diagnostic (effective active-sample count) tracks the same three empirical regimes -- generalization, geometric memorization, and full memorization -- as training-set size shrinks [achilli-etal-2024-losing-dimensions-geometric-memorization-diffusion]

models: DDPM (MNIST, custom-trained, memorization-transition study), DDPM (Fashion-MNIST, custom-trained, memorization-transition study), DDPM (CIFAR-10, custom-trained, memorization-transition study), DDPM (CelebA-HQ, custom-trained, memorization-transition study), DDPM (LSUN-Church, custom-trained, memorization-transition study) · method: Score-Jacobian spectral-gap analysis
Memorization to Generalization: Emergence of Diffusion Models from Associative Memory (2025)measured

Diffusion-model score-Jacobian curvature maps onto a dense associative-memory energy landscape whose memorized/spurious/generalized transition scales with model capacity

Details

Pham, Raya, Negri, Zaki, Ambrogioni & Krotov map a diffusion model's own energy function E_DM(x_t,t) directly onto a Dense Associative Memory (Hopfield-network) energy E_AM(x), with noise variance playing the role of inverse temperature, and reuse the score-Jacobian SVD/spectral-gap curvature diagnostic from Ventura et al. (2025) and Achilli et al. (2024) to quantify local energy curvature around real DDPM training points [pham-etal-2025-memorization-generalization-diffusion-associative-memory] Across real DDPMs (PixelCNN++-backbone U-Nets) trained from scratch on MNIST, Fashion-MNIST, CIFAR-10 and LSUN-Church at 38 training-set sizes per dataset, nearest-neighbor-distance classification against real and synthetic sample sets identifies memorized, spurious, and generalized regimes whose transition point matches the dimensional-collapse critical points found on the same checkpoints by Achilli et al. (2024) (e.g. CIFAR-10 A=2000/B=16000 of 50000 total) [pham-etal-2025-memorization-generalization-diffusion-associative-memory] A U-Net capacity ablation (widths 64/96/128, 8.9M-109.7M parameters) on CIFAR-10 and LSUN-Church shows the critical training-set size at which the spurious-state fraction peaks scales up with model capacity (CIFAR-10 U-Net64 peak at K=2568 vs. U-Net96 peak at K=5862), directly tying the memorization-geometry transition to model capacity rather than dataset size alone [pham-etal-2025-memorization-generalization-diffusion-associative-memory]

models: DDPM (MNIST, custom-trained, memorization-transition study), DDPM (Fashion-MNIST, custom-trained, memorization-transition study), DDPM (CIFAR-10, custom-trained, memorization-transition study), DDPM (LSUN-Church, custom-trained, memorization-transition study) · method: Score-Jacobian spectral-gap analysis

Earth-Observation / Remote-Sensing Foundation Model

Characterizing AlphaEarth Embedding Geometry for Agentic Environmental Reasoning (2026)measured

AlphaEarth satellite embeddings occupy a low-dimensional, locally rotating manifold

Details

Google AlphaEarth's 64-dimensional satellite embeddings have a participation-ratio effective dimensionality of 13.3 and a local intrinsic dimensionality of about 10 across ~12.1M CONUS samples (2017-2023) [rahman-etal-2026-characterizing-alphaearth-embedding-geometry] This intrinsic-to-ambient ratio is higher than comparable geographic implicit neural representations, whose prior ID was 2-10 in 256-512 ambient dimensions [rahman-etal-2026-characterizing-alphaearth-embedding-geometry] Tangent spaces between adjacent probe locations rotate more than 60 degrees at 84% of sampled locations, indicating a strongly curved (non-affine) manifold [rahman-etal-2026-characterizing-alphaearth-embedding-geometry] A separate local-versus-global comparison finds a mean |cos theta| of 0.169 between local tangent spaces and the global principal axes, a distinct metric from the adjacent-probe rotation [rahman-etal-2026-characterizing-alphaearth-embedding-geometry] Tangent-space instability is highest in mountainous regions with steep environmental gradients [rahman-etal-2026-characterizing-alphaearth-embedding-geometry]

models: AlphaEarth (satellite/Earth-observation foundation model) · method: PCA, Intrinsic dimension estimation (TwoNN)

Custom Research VAE (purpose-built variational autoencoder for representation-geometry studies)

Latent Space Oddity: On the Curvature of Deep Generative Models (2018)measured

A real VAE's decoder-induced pullback metric and its geodesics substantially improve interpolation and density estimation over naive Euclidean latent distance

Details

A stochastic Riemannian pullback metric, derived from a real trained VAE decoder's own Jacobian (accounting for decoder variance), is computed on the latent space of VAEs trained on real MNIST digit subsets and a real video-frame dataset [arvanitidis-hansen-hauberg-2018-latent-space-oddity] Geodesic distances and interpolation paths computed under this metric substantially improve interpolation quality, density estimation, sampling and clustering relative to naive Euclidean latent-space distance [arvanitidis-hansen-hauberg-2018-latent-space-oddity] Decoder variance estimates are found to be systematically poor near the data manifold, and an architecture modification is proposed to correct this before computing the pullback metric [arvanitidis-hansen-hauberg-2018-latent-space-oddity]

models: MLP/convolutional VAE, trained on MNIST digit subsets and video frames (Arvanitidis, Hansen & Hauberg) · method: Generator/decoder Jacobian pullback metric
High-Dimensional Latents Should Be Diagnosed Through Phase Structure (2026)measured

Real trained VAE latent spaces organize into measurably distinct ordered, disordered, and glassy phases, and shifting toward a more ordered phase improves anomaly detection

Details

Spin-glass overlap-distribution diagnostics (order parameters, susceptibility) are applied to real trained VAE/autoencoder latent spaces on CIFAR-10, CelebA64, Mars Rover Mastcam, and Galaxy Zoo 64 real image data, projected onto a hypersphere [ascarate-etal-2026-high-dimensional-latents-phase-structure] The latent space organizes into measurably distinct ordered, disordered, and glassy phase regimes rather than varying along a single smooth curvature or dimension number [ascarate-etal-2026-high-dimensional-latents-phase-structure] A hyperspherical-compression intervention that shifts the latent regime toward greater order improves downstream anomaly-detection AUROC on real data: Mars Rover Mastcam kNN-AUROC rises from 0.66 to 0.76, and Galaxy Zoo 64 kNN-AUROC rises from 0.74 to 0.79 [ascarate-etal-2026-high-dimensional-latents-phase-structure]

models: VAE trained on Mars Rover Mastcam imagery (Ascarate, Lebrat, Santa Cruz, Fookes & Salvado), VAE trained on Galaxy Zoo 64 imagery (Ascarate, Lebrat, Santa Cruz, Fookes & Salvado) · method: Spin-glass order-parameter diagnostics for latent phase structure
The Riemannian Geometry of Deep Generative Models (2018)measured

Real CelebA- and SVHN-trained VAE manifolds are surprisingly close to zero curvature, so linear latent interpolation nearly matches true geodesics

Details

Geodesic curves and parallel-transport algorithms are derived from a Riemannian pullback metric on the latent space of real convolutional VAEs (32-dimensional latent) trained on real CelebA and SVHN image data [shao-kumar-fletcher-2018-riemannian-geometry-deep-generative-models] The learned generator manifold is found to be surprisingly close to zero curvature, so that naive linear (Euclidean) interpolation paths in latent space closely approximate the true geodesics under the pullback metric [shao-kumar-fletcher-2018-riemannian-geometry-deep-generative-models] This is a notably different empirical emphasis from Arvanitidis, Hansen & Hauberg (2018)'s finding on other real VAEs that latent-space distortion is significant enough to require geodesic correction for good interpolation [shao-kumar-fletcher-2018-riemannian-geometry-deep-generative-models]

models: Convolutional VAE (32-dim latent), trained on CelebA and SVHN (Shao, Kumar & Fletcher) · method: Generator/decoder Jacobian pullback metric
Geometry of Deep Generative Models for Disentangled Representations (2018)measured

Class-distinguishing latent regions of real disentangled VAE variants carry measurably higher pullback-metric curvature than a vanilla VAE's latent space

Details

A Riemannian pullback metric is compared across a vanilla VAE and three disentangling-representation VAE variants (Szabo et al., Mathieu et al., and Jha et al.'s cycle-consistent VAE), all trained on real MNIST digits, MultiPIE faces and 3D Chairs data [shukla-etal-2018-geometry-of-deep-generative-models-disentangled-representations] Latent regions carrying class-distinguishing features exhibit measurably higher curvature under the pullback metric in the disentangled-representation models than in a vanilla VAE's latent space [shukla-etal-2018-geometry-of-deep-generative-models-disentangled-representations] Curvature-derived geodesic distances again improve interpolation quality relative to naive Euclidean latent distance, consistent with the same finding on other real VAEs [shukla-etal-2018-geometry-of-deep-generative-models-disentangled-representations]

models: Vanilla VAE and disentangling VAE variants (Szabo et al., Mathieu et al., Jha et al.), trained on MNIST, MultiPIE and 3D Chairs (Shukla, Bhagat, Anand & Turaga) · method: Generator/decoder Jacobian pullback metric

Importance-Weighted Autoencoder (IWAE)

Metrics for Deep Generative Models (2018)measured

A real trained importance-weighted autoencoder's pullback-Riemannian geodesics outperform Euclidean latent interpolation on MNIST, a simulated robot arm, and real human motion-capture data

Details

A deterministic generator-Jacobian pullback Riemannian metric, smoothed via SVD regularization, is computed on the fixed 2D latent space of real importance-weighted autoencoders (IWAEs) independently trained on real binarized MNIST digits, a simulated 6-degree-of-freedom KUKA robot-arm circular-motion dataset, and real CMU human motion-capture walking data [chen-etal-2018-metrics-for-deep-generative-models] On MNIST, the geodesic between two digit-class latents (path length 62.9) crosses only two digit classes and follows the data manifold, versus a Euclidean interpolation (length 74.3) that crosses four classes and produces less smooth reconstructions [chen-etal-2018-metrics-for-deep-generative-models] On the simulated robot arm, the geodesic (length 0.54) produces smooth, natural end-effector motion without explicit task-space constraints, far outperforming Euclidean interpolation (length 1.48); on real motion-capture walking data the geodesic (2.57) again outperforms Euclidean interpolation (2.89), avoiding large body-pose jumps that occur when the Euclidean path crosses high-magnification-factor latent regions [chen-etal-2018-metrics-for-deep-generative-models]

models: Importance-Weighted Autoencoder (2D latent, binarized MNIST), Importance-Weighted Autoencoder (2D latent, simulated 6-DOF KUKA robot arm joint angles), Importance-Weighted Autoencoder (2D latent, CMU motion-capture walking data) · method: Generator/decoder Jacobian pullback metric

Llama

The Shape of Beliefs: Geometry, Dynamics, and Interventions along Representation Manifolds of Language Models' Posteriors (2026)measured

In-context Gaussian-belief posteriors trace curved manifolds linear steering breaks

Details

Sarfati et al. give Llama-3.2 a string of samples from an unknown normal and study how it in-context infers the distribution; layer-14 activations form smooth but genuinely curved 2D manifolds as mu or sigma varies [sarfati-etal-2026-shape-of-beliefs] The output-side simplex geometry (via inPCA) shows the same curved structure dual to the input side [sarfati-etal-2026-shape-of-beliefs] Rather than one global linear probe, local linear field probes tiling the manifold reach 87-99% accuracy, framed as evidence that purely linear concept representations are often an inadequate abstraction [sarfati-etal-2026-shape-of-beliefs] Belief updating after a mid-sequence distribution change shows two-timescale relaxation through two attractor-like regions for the old and new distributions [sarfati-etal-2026-shape-of-beliefs] Linear difference-of-means steering drives activations off the curved manifold, producing out-of-distribution logits, while manifold-respecting geodesic steering preserves the target distribution, so the curvature is causally real [sarfati-etal-2026-shape-of-beliefs]

models: Llama-3.2-1B · method: PCA, Linear probing, Activation Steering (Addition), Geometric analysis

Custom research feedforward MLP

Neural Feature Geometry Evolves as Discrete Ricci Flow (2025)measured

Activation-graph Ricci curvature contracts flow-like, reversing at overfitting onset

Details

Hehl et al. build k-NN graphs from layer-wise activations of over 20,000 real feedforward MLPs (widths 15/25/50, depths 7/10/15) trained to >99% accuracy on binary MNIST/Fashion-MNIST/CIFAR-10 subsets [hehl-etal-2025-neural-feature-geometry-ricci-flow] They compute discrete Ollivier-Ricci and augmented Forman-Ricci curvature per point plus a local Ricci-evolution coefficient (curvature versus neighborhood-distance change across layers) [hehl-etal-2025-neural-feature-geometry-ricci-flow] Negative coefficients dominate (88.7-98.3% of vertices), indicating genuine Ricci-flow-like contraction in the feature geometry [hehl-etal-2025-neural-feature-geometry-ricci-flow] The coefficient's trend reverses at the depth and training point coinciding with overfitting onset and the depth that maximizes test accuracy; the study is purely observational [hehl-etal-2025-neural-feature-geometry-ricci-flow]

models: Custom feedforward MLP (binary image classification, Hehl et al. 2025) · method: Discrete Ricci curvature estimation (Ollivier/Forman)

ResNet

Data Representations' Study of Latent Image Manifolds (2023)measured

Latent-manifold principal curvature (MAPC) tracks CNN generalization

Details

Kaufman & Azencot estimate principal curvatures of the latent image manifold at hidden layers of real trained ResNet (18/50/101) and VGG (13/16/19) classifiers across CIFAR-10/100, TinyImageNet, and ImageNet [kaufman-azencot-2023-latent-image-manifolds] Curvature is computed via CAML (Li 2018) over SVD-generated synthetic neighbors, taking the eigenvalues of the manifold's Hessian, and summarized per layer as the mean absolute principal curvature (MAPC) [kaufman-azencot-2023-latent-image-manifolds] The curvature gap between the last two layers correlates with generalization: larger gaps are associated with more accurate models and smaller gaps with inferior performance [kaufman-azencot-2023-latent-image-manifolds] Regularizers such as mixup flatten intermediate-layer representations, but high curvature in the last layer is itself fundamental to performance; the study is purely observational [kaufman-azencot-2023-latent-image-manifolds]

models: ResNet (image classifier, various depths) · method: Principal curvature estimation (MAPC)

VGG

Data Representations' Study of Latent Image Manifolds (2023)measured

Latent-manifold principal curvature (MAPC) tracks CNN generalization

Details

Kaufman & Azencot estimate principal curvatures of the latent image manifold at hidden layers of real trained ResNet (18/50/101) and VGG (13/16/19) classifiers across CIFAR-10/100, TinyImageNet, and ImageNet [kaufman-azencot-2023-latent-image-manifolds] Curvature is computed via CAML (Li 2018) over SVD-generated synthetic neighbors, taking the eigenvalues of the manifold's Hessian, and summarized per layer as the mean absolute principal curvature (MAPC) [kaufman-azencot-2023-latent-image-manifolds] The curvature gap between the last two layers correlates with generalization: larger gaps are associated with more accurate models and smaller gaps with inferior performance [kaufman-azencot-2023-latent-image-manifolds] Regularizers such as mixup flatten intermediate-layer representations, but high curvature in the last layer is itself fundamental to performance; the study is purely observational [kaufman-azencot-2023-latent-image-manifolds]

models: VGG (image classifier, various depths) · method: Principal curvature estimation (MAPC)

Stable Diffusion

Hessian Geometry of Latent Space in Generative Models (2026)measured

A real Stable Diffusion 1.5 latent space shows a fractal structure of Fisher-metric phase transitions, with diverging Lipschitz constants at phase boundaries

Details

A Fisher information metric is reconstructed from a log-partition-function formulation of the latent space of a real Stable Diffusion 1.5 (Dreamshaper8 checkpoint) model, after first validating the reconstruction method against the exactly-solvable 2D Ising model and TASEP [lobashev-etal-2026-hessian-geometry-latent-space-generative-models] The real diffusion model's latent space shows a fractal structure of phase transitions, marked by abrupt jumps in the Fisher metric rather than smooth curvature variation [lobashev-etal-2026-hessian-geometry-latent-space-generative-models] Geodesic interpolation is locally linear within a single phase, but this breaks down at phase boundaries, where the local Lipschitz constant diverges [lobashev-etal-2026-hessian-geometry-latent-space-generative-models]

models: Stable Diffusion 1.5 (Dreamshaper8 checkpoint) · method: Fisher information metric reconstruction from a log-partition function
The Geometry of Phase Transitions in Generative Dynamics via Projection Caustics (2026)measured

A real DDPM's Critical Boundary Detector correlates with LPIPS and localizes classifier-guidance-worthy timesteps

Details

Sakamoto & Sakamoto define the Critical Boundary Detector (CBD), the Frobenius norm of the Jacobian of a diffusion model's own normalized score/velocity field along a single generation trajectory, and show on a real pretrained google/ddpm-cifar10-32 checkpoint that CBD correlates strongly with LPIPS perceptual distance (per-trajectory Pearson r of 0.953, 0.908, 0.966, 0.849 and 0.964 across 5 seeds, mean r=0.928, p<1e-70) [sakamoto-sakamoto-2026-geometry-phase-transitions-generative-dynamics-projection-caustics] Targeting classifier guidance to the CBD-detected instability band (timesteps 30-70 of 250) reaches target-class accuracy of 0.96-1.00 using only about 10 of 250 steps (roughly 4%), matching full 250-step guidance accuracy, while an equally-sized random band (timesteps 180-220) stays at the unguided baseline of 0.04 [sakamoto-sakamoto-2026-geometry-phase-transitions-generative-dynamics-projection-caustics] On real Stable Diffusion 3.5 Medium across 6 prompt-pairs (e.g. house-to-ship, jellyfish-to-chandelier), CBD-versus-LPIPS correlation is weaker and prompt-dependent (mean Pearson -0.230, mean Spearman -0.577, with per-prompt Spearman as strong as -0.993 for jellyfish-to-chandelier) [sakamoto-sakamoto-2026-geometry-phase-transitions-generative-dynamics-projection-caustics]

models: Stable Diffusion 3.5 Medium · method: Critical Boundary Detector (CBD)

Hyperbolic Graph Neural Networks (HGCN / HyboNet)

Hyperbolic Graph Neural Networks Under the Microscope: The Role of Geometry-Task Alignment (2026)measured

Hyperbolic GNNs achieve low-distortion embeddings only on tree-like graphs under geometry-aligned tasks

Details

Naddeo, Linkerhägner, Toschi, Skenderi & Lachi (2026) train real HGCN (Poincare-ball) and HyboNet (Lorentz-model) graph neural networks, versus Euclidean GCN/GAT/MLP baselines, on Cora, Citeseer, Pubmed, Disease, Airport, and synthetic tree/grid graphs, measuring embedding distortion delta(h)=d_c(h)/d_e(h), a normalized Stress Loss, and each dataset's exact Gromov delta-hyperbolicity (Disease 0.0, Airport 1.0, Pubmed 3.5, Citeseer 4.5, Cora 11.0) [naddeo-etal-2026-hyperbolic-gnns-under-the-microscope-geometry-task-alignment] On synthetic trees, HyboNet/HGCN show markedly lower stress than Euclidean models at low dimension, but the advantage vanishes by d=128 and reverses entirely on grid graphs; on real-world node classification, none of the models learn metric-preserving embeddings regardless of architecture [naddeo-etal-2026-hyperbolic-gnns-under-the-microscope-geometry-task-alignment] Only link prediction (a geometry-aligned task) shows HGNNs achieving both lower distortion and higher ROC-AUC/AP, especially on low-hyperbolicity datasets (Disease, Airport), confirmed as functionally load-bearing via a feature-corruption experiment where HGNNs retain higher performance and lower distortion than Euclidean models under progressive noise [naddeo-etal-2026-hyperbolic-gnns-under-the-microscope-geometry-task-alignment]

models: HGCN (Hyperbolic Graph Convolutional Network, Poincare ball, learnable curvature), HyboNet (fully hyperbolic GNN, Lorentz model) · method: Hyperbolic embedding distortion and Gromov delta-hyperbolicity fit

Gaussian Process Latent Variable Model (GP-LVM)

Identifying Latent Distances with Finslerian Geometry (2023)measured

A real trained GP-LVM's Riemannian and Finslerian latent geodesics converge on high-dimensional real datasets, but diverge in low-dimensional synthetic settings

Details

Real Gaussian Process Latent Variable Models (GP-LVMs, with stochastic active-set inference) are fit to a real 256-dimensional font-contour dataset and a real 48-dimensional qPCR single-cell gene-expression dataset, comparing geodesic distances computed under the standard expected (Riemannian) pullback metric against a more general Finsler metric that keeps the full distribution of stochastic pullback metrics rather than averaging it [pouplin-etal-2023-finslerian-latent-distances] On both real high-dimensional datasets, the Riemannian/Finsler volume-measure ratio near the data stays small (about 10^-4) and the two metrics' geodesics agree closely, empirically confirming a proven O(1/D) convergence rate between the two metrics as ambient dimension D grows [pouplin-etal-2023-finslerian-latent-distances] The two metrics visibly diverge only in low-dimensional (3D) synthetic toy datasets (pinwheel, concentric circles on a sphere), and the same convergence pattern as the real datasets is also observed on real MNIST and FashionMNIST, showing the common practice of approximating the stochastic pullback metric by its expectation is a safe approximation in the real, high-dimensional regime even though it is not exact in general [pouplin-etal-2023-finslerian-latent-distances]

models: GP-LVM (256-dim font-contour dataset, stochastic active-set inference), GP-LVM (48-dim qPCR single-cell gene-expression dataset) · method: Finslerian latent-distance estimation

DDPM (Denoising Diffusion Probabilistic Models, HuggingFace Diffusers checkpoints)

The Geometry of Phase Transitions in Generative Dynamics via Projection Caustics (2026)measured

A real DDPM's Critical Boundary Detector correlates with LPIPS and localizes classifier-guidance-worthy timesteps

Details

Sakamoto & Sakamoto define the Critical Boundary Detector (CBD), the Frobenius norm of the Jacobian of a diffusion model's own normalized score/velocity field along a single generation trajectory, and show on a real pretrained google/ddpm-cifar10-32 checkpoint that CBD correlates strongly with LPIPS perceptual distance (per-trajectory Pearson r of 0.953, 0.908, 0.966, 0.849 and 0.964 across 5 seeds, mean r=0.928, p<1e-70) [sakamoto-sakamoto-2026-geometry-phase-transitions-generative-dynamics-projection-caustics] Targeting classifier guidance to the CBD-detected instability band (timesteps 30-70 of 250) reaches target-class accuracy of 0.96-1.00 using only about 10 of 250 steps (roughly 4%), matching full 250-step guidance accuracy, while an equally-sized random band (timesteps 180-220) stays at the unguided baseline of 0.04 [sakamoto-sakamoto-2026-geometry-phase-transitions-generative-dynamics-projection-caustics] On real Stable Diffusion 3.5 Medium across 6 prompt-pairs (e.g. house-to-ship, jellyfish-to-chandelier), CBD-versus-LPIPS correlation is weaker and prompt-dependent (mean Pearson -0.230, mean Spearman -0.577, with per-prompt Spearman as strong as -0.993 for jellyfish-to-chandelier) [sakamoto-sakamoto-2026-geometry-phase-transitions-generative-dynamics-projection-caustics]

models: DDPM (CIFAR-10, unconditional) · method: Critical Boundary Detector (CBD)

Custom Research Transformer (small, purpose-built for interpretability studies)

Probing Graph Neural Network Activation Patterns Through Graph Topology (2026)measured

A real trained graph transformer's attention-weighted effective graph undergoes curvature collapse, concentrating on and worsening bottleneck edges rather than smoothing them

Details

Balanced Forman Curvature is computed on both the raw input graph and an attention-re-weighted 'effective graph' formed from real trained Graph Transformer (GT, GraphiT, SAN) attention weights, across ZINC, Tox21, and Long-Range Graph Benchmark peptide datasets [tori-etal-2026-probing-gnn-activation-patterns-graph-topology] On LRGB peptide graphs, the attention-weighted effective graph undergoes a Curvature Collapse: the fraction of negatively-curved edges jumps from 57% to 84% on peptides-func and from 57% to 82% on peptides-struct, with the weighted Balanced Forman Curvature shifting from -0.68 to -0.70 and the spectral gap dropping [tori-etal-2026-probing-gnn-activation-patterns-graph-topology] Attention concentrates on and worsens existing topological bottlenecks rather than smoothing them, contrary to the theoretical prediction that massive attention weights would preferentially target curvature-extreme edges to counteract them; causal pruning of massive-activation edges within bottlenecks spikes loss by 22-27%, confirming the effect is functionally load-bearing rather than an artifact [tori-etal-2026-probing-gnn-activation-patterns-graph-topology]

models: Graph Transformer (GT/GraphiT/SAN), trained on LRGB peptides-func/peptides-struct (Tori, Bini, Sorbi, Marchand-Maillet & Ginis) · method: Attention-weighted graph curvature analysis

Ventura et al. (2025) Custom Score-Based Diffusion Models

Manifolds, Random Matrices and Spectral Gaps: The Geometric Phases of Generative Diffusion (2025)measured

Real diffusion models trained on MNIST, CIFAR-10, and CelebA show score-Jacobian spectral gaps matching random-matrix-theory predictions for sub-manifold dimensionality

Details

A statistical-physics/random-matrix treatment of the score-matching objective predicts that the eigenvalue spectrum of a diffusion model's score-function Jacobian develops sharp gaps as sampling noise decreases, with gap locations revealing the dimensionality of underlying data sub-manifolds [ventura-etal-2025-geometric-phases-generative-diffusion] Real diffusion models trained from scratch on real MNIST, CIFAR-10, and CelebA image datasets have their score-Jacobian eigenspectra numerically computed along the denoising trajectory, confirming the predicted spectral gaps emerge as noise decreases, with gap locations tracking each dataset's estimated intrinsic sub-manifold dimensionality [ventura-etal-2025-geometric-phases-generative-diffusion] The emergence of each spectral gap marks a distinct geometric phase transition in the generative dynamics, empirically validating the closed-form phase-diagram predictions derived under the paper's statistical-physics framework on real, natural (non-toy) image data [ventura-etal-2025-geometric-phases-generative-diffusion]

models: Score-based diffusion model (custom-trained, MNIST), Score-based diffusion model (custom-trained, CIFAR-10), Score-based diffusion model (custom-trained, CelebA) · method: Score-Jacobian spectral-gap analysis

BigGAN

The Geometry of Deep Generative Image Models and its Applications (2021)measured

Image variation in several real pretrained GANs concentrates along surprisingly few, position-homogeneous major axes of the pullback metric

Details

A Riemannian pullback metric is eigen-decomposed at sampled latent positions across several real pretrained GANs, including BigGAN-deep (class-conditional, ImageNet), PGGAN (CelebA) and StyleGAN2 (FFHQ) [wang-ponce-2021-geometry-of-deep-generative-image-models] Image variation around each latent position is concentrated along surprisingly few major axes of the pullback metric (highly anisotropic), rather than spread evenly across all latent dimensions [wang-ponce-2021-geometry-of-deep-generative-image-models] The dominant axes are similar across different positions in latent space (homogeneous), and the top eigenvectors correspond to interpretable, reusable image transforms [wang-ponce-2021-geometry-of-deep-generative-image-models]

models: BigGAN-deep (256px, class-conditional on ImageNet) · method: Generator/decoder Jacobian pullback metric

PGGAN (Progressive GAN)

The Geometry of Deep Generative Image Models and its Applications (2021)measured

Image variation in several real pretrained GANs concentrates along surprisingly few, position-homogeneous major axes of the pullback metric

Details

A Riemannian pullback metric is eigen-decomposed at sampled latent positions across several real pretrained GANs, including BigGAN-deep (class-conditional, ImageNet), PGGAN (CelebA) and StyleGAN2 (FFHQ) [wang-ponce-2021-geometry-of-deep-generative-image-models] Image variation around each latent position is concentrated along surprisingly few major axes of the pullback metric (highly anisotropic), rather than spread evenly across all latent dimensions [wang-ponce-2021-geometry-of-deep-generative-image-models] The dominant axes are similar across different positions in latent space (homogeneous), and the top eigenvectors correspond to interpretable, reusable image transforms [wang-ponce-2021-geometry-of-deep-generative-image-models]

models: PGGAN (trained on CelebA, 256px) · method: Generator/decoder Jacobian pullback metric

StyleGAN

The Geometry of Deep Generative Image Models and its Applications (2021)measured

Image variation in several real pretrained GANs concentrates along surprisingly few, position-homogeneous major axes of the pullback metric

Details

A Riemannian pullback metric is eigen-decomposed at sampled latent positions across several real pretrained GANs, including BigGAN-deep (class-conditional, ImageNet), PGGAN (CelebA) and StyleGAN2 (FFHQ) [wang-ponce-2021-geometry-of-deep-generative-image-models] Image variation around each latent position is concentrated along surprisingly few major axes of the pullback metric (highly anisotropic), rather than spread evenly across all latent dimensions [wang-ponce-2021-geometry-of-deep-generative-image-models] The dominant axes are similar across different positions in latent space (homogeneous), and the top eigenvectors correspond to interpretable, reusable image transforms [wang-ponce-2021-geometry-of-deep-generative-image-models]

models: StyleGAN2 (Face256, trained on FFHQ) · method: Generator/decoder Jacobian pullback metric