Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Image Interpolation with Score-based Riemannian Metrics of Diffusion Models

T0 review · 3 major / 4 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A diffusion model's score Jacobian defines a Riemannian metric whose geodesics produce realistic, low-noise image interpolations.

desk verdict A genuinely new score-Jacobian metric idea undercut by an unverified non-degeneracy assumption and too-thin, unreproducible experiments. read the letter →

arxiv 2504.20288 v1 pith:OJUU5SNN submitted 2025-04-28 cs.CV

Shinnosuke Saito , Takashi Matsubara This is my paper · ORCID
classification cs.CV
keywords imageinterpolationdiffusionmodelsRiemannianmetricscorefunctiongeodesicmanifoldhypothesisDDIMinversionStable
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that interpolation between two images can be treated as a geodesic on the data manifold that a pre-trained diffusion model has learned, rather than as a straight line in pixel or noise space. The metric is built entirely from the score function: the length of a small movement is the amount by which the score changes, so the cheapest paths are the ones that stay in regions where the score is nearly constant. Running those geodesics in a mildly noisy space and then decoding with DDIM yields transitions that the paper's CLIP-IQA and reconstruction comparisons say are more realistic, less noisy, and more faithful to the prompt than Lerp, Slerp, NAO, and NoiseDiffusion. If this holds, diffusion models get a practical geometric tool for image interpolation and editing without retraining or a dedicated latent space.

What carries the argument

The load-bearing object is the score-Jacobian metric $G_{\mathbf{x}_t} = (\nabla_{\mathbf{x}_t} s_\theta(\mathbf{x}_t,t))^{\top} \nabla_{\mathbf{x}_t} s_\theta(\mathbf{x}_t,t)$, a matrix that converts the score model's local sensitivity into a notion of distance. In this metric, a small step is cheap when the score is locally flat, so geodesics are paths that keep the score, and therefore the semantic content, as stable as possible. The supporting mechanism is numerical: finite-difference velocities, a trapezoidal length estimate, Adam optimization of the intermediate points, a variance term that keeps the Euclidean speed even, and DDIM inversion and decoding to carry the path through a less rugged time-$\tau$ space.

What would settle it

Compute the smallest singular value of $\nabla_{\mathbf{x}_t} s_\theta(\mathbf{x}_t,t)$ at many points on one of the reported Stable Diffusion geodesic paths. If it rounds to zero in any manifold-tangent direction, the unregularized length being minimized is degenerate, and the smooth midpoint images would have to be attributed to the variance regularizer and the DDIM decoder rather than to the Riemannian metric itself.

Watch

Extended reading notes

Core claim

The paper's central claim is that the score function of a diffusion model supplies a Riemannian metric on the data space: at each noisy state $\mathbf{x}_t$, the metric tensor is $G_{\mathbf{x}_t} = J_{\mathbf{x}_t}^{\top} J_{\mathbf{x}_t}$, where $J_{\mathbf{x}_t} = \nabla_{\mathbf{x}_t} s_\theta(\mathbf{x}_t,t)$ is the Jacobian of the trained score. Under this metric, the length of a velocity is the Euclidean norm of the score perturbation caused by that velocity, so the shortest curve between two endpoints is the path along which the score changes least. The paper computes that path in the time-$\tau$ noisy space, initializes it with Slerp, optimizes the discrete curve length with a variance regularizer, and decodes the result with DDIM. Experiments on Stable Diffusion and MNIST are reported to show that this geodesic interpolation produces more realistic, less noisy, and more prompt-faithful intermediate images than Lerp, Slerp, NAO, and NoiseDiffusion, while avoiding the reconstruction errors of NAO and NoiseDiffusion.

Load-bearing premise

The construction assumes the score Jacobian is non-degenerate everywhere along the interpolation path; on a low-dimensional data manifold, directions along the manifold have near-zero score gradient, so the metric can become singular and the geodesic length is only well-defined after some regularization.

Editorial extensions

If this is right

  • Any pre-trained diffusion model can be given a geometric interpolation routine without retraining or learning a separate latent space, because the metric is computed from the score the model already predicts.
  • Because the geodesic length is the total score change along a path, the same construction defines a distance between images, opening a route to geometry-aware retrieval or editing.
  • The method preserves endpoint fidelity: reconstructions near the endpoints remain close to the originals under MSE, LPIPS, and DreamSim, whereas NAO and NoiseDiffusion can seriously degrade them.
  • The score-Jacobian link to the Hessian of the log-density ties the smoothness of interpolation to the intrinsic dimensionality of the data manifold, so the geodesic should trace perceptually meaningful transitions wherever the trained score is well calibrated.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable extension the authors do not run is to remove the variance regularizer: if the true geodesic still produces even, meaningful transitions, the metric is doing the work; if the path collapses or concentrates near the endpoints, the regularizer is the effective engine.
  • A neighbouring application not explored in the paper is to repurpose the score-Jacobian length as a perceptual distance or similarity measure for image retrieval and morphing.
  • Because $J^{\top} J$ is singular on low-dimensional manifolds, a regularized version $J^{\top} J + \varepsilon I$ would likely make the optimization more stable; whether it changes the visual output is a cheap, concrete experiment.
  • Another natural stress test is to replace Stable Diffusion with a different pre-trained diffusion model and check whether the reported CLIP-IQA gains persist, which would show the metric is a general property of score functions rather than an artifact of one architecture.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper proposes to treat the data space of a pretrained diffusion model as a Riemannian manifold by defining the metric tensor as G_xt = J_xt^T J_xt, where J_xt is the Jacobian of the score function s_theta(xt, t). The authors then compute the length-minimizing geodesic between two DDIM-inverted noisy samples at time tau, decode the path with DDIM, and compare the resulting interpolations against Lerp, Slerp, NAO, and NoiseDiffusion on a small set of Stable Diffusion prompts and on MNIST. They report qualitative improvements in CLIP-IQA realism, noisiness, and prompt fidelity, while noting that NAO and NoiseDiffusion suffer from reconstruction errors.

Significance. The idea of using the score function to define a geometric structure on diffusion-model data spaces is interesting and connects to recent work on the spectral properties of score Jacobians and manifold learning. If the metric were well-defined and the evaluation were convincing, the framework could offer a principled interpolation method that uses the learned data manifold without retraining. However, the central mathematical premise is not established: the paper itself identifies the regime in which the score Jacobian is near-singular along data-manifold tangent directions, and that is precisely the regime in which the proposed metric degenerates. The experimental evidence is also thin, consisting of four Stable Diffusion examples without statistical analysis. As a result, the paper does not currently support its central claims.

major comments (3)
  1. [Section 3, Eq. (1) and "Interpretation"] The proposed metric is not a valid Riemannian metric in the intended regime. The paper defines G_xt = J_xt^T J_xt and concedes that it is positive definite only when J_xt is non-degenerate. It then states, citing Stanczuk et al. (2024) and Ventura et al. (2025), that directions with small eigenvalues of J_xt are tangential to the data manifold. Since the data distribution is concentrated near a low-dimensional manifold, J_xt is near-singular in those tangent directions, so G_xt is near-singular along exactly the directions an interpolation path must traverse. The length functional in Eq. (2) then assigns near-zero cost to arbitrary tangent perturbations, and the minimization in Eq. (3) is degenerate; the variance regularizer with un-reported lambda is what actually selects a path. The paper provides no eigenvalue spectra, condition numbers, or regularized variant, so the connection between the reported paths and the claimed Riemannian structure is unsupported.
  2. [Section 4, Table 1] The empirical support for the central claim is limited to four Stable Diffusion examples with no error bars or significance tests. The CLIP-IQA differences between Slerp and the proposed method (Reality 0.704 vs 0.716, Noisiness 0.765 vs 0.818, Fidelity 0.784 vs 0.810) are small and could easily be within run-to-run or image-to-image variability. The proposed method's reconstruction errors are exactly identical to Lerp and Slerp, which is expected because all three use the same DDIM-inverted endpoints; those numbers only confirm that the path optimization does not corrupt endpoints and do not validate the interpolation. The MNIST experiment in Appendix C.2 is presented qualitatively and does not provide quantitative support.
  3. [Section 4 (Implementation) and Appendix B.4] The optimization procedure is under-specified in a way that is load-bearing. The variance regularization weight lambda is never reported, the initialization details for the Slerp curve are not given, and the dependence of the final path on the Adam learning-rate schedule and the 5,000-iteration budget is not examined. Because the objective in Eq. (3) is degenerate, the output path depends heavily on these undocumented choices; without a sensitivity analysis, the paper cannot claim that the results reflect a geometric property rather than an artifact of the optimizer or the regularizer.
minor comments (4)
  1. [Appendix B.3, Eq. (16)] The denominator of the arccosine argument is written as ||x_t^(0)|| ||x_t^(0)||; the second norm should presumably be ||x_t^(1)||.
  2. [Section 3] The paper uses G_xt both as a matrix-valued metric and as a tensor field; explicitly writing indices, e.g., g_{ij}(xt), would avoid confusion between the pointwise matrix and the global geometric object.
  3. [Section 3, "Interpretation"] The Taylor-expansion justification that the geodesic makes the score change as little as possible is only local and assumes small ||v||; with N=10 discretization points the displacements between successive points may be large, so the interpretation is not directly justified.
  4. [Section 4, Table 1] The CLIP-IQA fidelity evaluation extends the metric beyond its original design by using prompts such as "A photo of [object]" versus "A photo of something that is not [object]"; the paper should acknowledge that this is a heuristic adaptation rather than a validated use of the metric.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the metric is defined by a pre-trained score network and evaluated with external CLIP-IQA, with no fitted quantity renamed as a prediction.

full rationale

The derivation chain is self-contained: Eq. (1) defines the metric G_xt = J_xt^T J_xt directly from the pre-trained score Jacobian; Eq. (3) minimizes the discrete geodesic length; DDIM inversion and decoding map the path back to t=0; and Table 1 evaluates the decoded images with CLIP-IQA, MSE, LPIPS, and DreamSim. No parameter is fitted to the evaluation metric and then reported as a prediction. The variance regularizer is a generic smoothing term (with hyperparameter lambda) and is not a fitted target of the experiment. The Taylor-expansion interpretation ('the proposed geodesic corresponds to a curve along which s_theta(x,t) changes as little as possible') is motivation, not a circular derivation of the empirical improvement. The cited works on score-Jacobian spectral gaps (Stanczuk et al., Ventura et al.) are external, not self-citations, and are used only for interpretation, not to force the construction. The paper's own caveat that G_xt is a valid Riemannian metric only 'as long as J_xt is non-degenerate' is a potential correctness/robustness risk in the degenerate low-dimensional-manifold regime, but an unverified assumption is not a circular reduction of the method's outcome to its inputs. Thus no circular step meeting the quoted-evidence standard is present, and the appropriate score is 0.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The central claim rests on the unverified assumption that the score Jacobian is non-degenerate, plus the standard score-to-noise relation and the manifold hypothesis. The only fitted numbers are hyperparameters of the optimization and baseline comparisons. No new entities are introduced.

free parameters (3)
  • λ (variance regularization weight) = not reported
    Added to the loss to prevent intermediate points from collapsing; value is chosen ad hoc and not specified in the paper.
  • τ (forward steps before interpolation) = 30 for Stable Diffusion, 400 for MNIST, 50 for NAO baseline
    Time step at which the geodesic is computed; chosen manually, affects the results and fairness of baselines.
  • N (number of interpolation points) = 10
    Discretization of the curve; chosen arbitrarily.
assumptions (4)
  • ad hoc to paper The Jacobian of the score function J_xt = ∇_xt s_θ(xt,t) is non-degenerate at the relevant points, so G_xt = J_xt^T J_xt is positive definite and defines a Riemannian metric.
    The paper states 'As long as J_xt is non-degenerate' but provides no argument or empirical check. In the low-rank manifold regime the Jacobian is expected to be singular in tangent directions.
  • standard math The relation ϵ_θ(x_t,t) = -√(1-α_t) ∇_x_t log p_t(x_t) holds for the trained denoiser.
    Standard diffusion theory (Eq. 8 in Appendix A.1); used to connect the metric to the score function.
  • domain assumption The eigendecomposition of the score Jacobian separates collapsed dimensions (large eigenvalues) from manifold-tangent directions (small eigenvalues).
    Section 3, interpretation paragraph; taken from prior works on intrinsic dimension estimation but not proven here.
  • domain assumption The data distribution is concentrated near a lower-dimensional manifold, so that a Riemannian metric on the data space is meaningful.
    Manifold hypothesis invoked in the introduction; not verified for the specific models and datasets used.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Image Interpolation with Score-based Riemannian Metrics of Diffusion Models." pith.science (2026). https://pith.science/paper/OJUU5SNN

@misc{pith2026250420288,
  author       = {Pith},
  title        = {Pith review of: Image Interpolation with Score-based Riemannian Metrics of Diffusion Models},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OJUU5SNN}},
  note         = {Machine review of arXiv:2504.20288}
}
read the original abstract

Diffusion models excel in content generation by implicitly learning the data manifold, yet they lack a practical method to leverage this manifold - unlike other deep generative models equipped with latent spaces. This paper introduces a novel framework that treats the data space of pre-trained diffusion models as a Riemannian manifold, with a metric derived from the score function. Experiments with MNIST and Stable Diffusion show that this geometry-aware approach yields image interpolations that are more realistic, less noisy, and more faithful to prompts than existing methods, demonstrating its potential for improved content generation and editing.

Figures

Figures reproduced from arXiv: 2504.20288 by the authors.

Figure 1
Figure 1. Images generated by Stable Diffusion with prompts shown below, with interpolations [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Interpolation results by a diffusion model trained on MNIST. [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FRAIN to Train: A Fast-and-Reliable Solution for Decentralized Federated Learning

    cs.LG 2025-05 conditional novelty 5.0 of 10

    FRAIN combines a two-proposal FastSync approximation with SLERP-based merging to make decentralized asynchronous federated learning more robust to non-IID data, stale updates, and malicious nodes.

Reference graph

Works this paper leans on

67 extracted references · 63 canonical work pages · cited by 1 Pith paper

  1. [1]

    Emergent Visual-Semantic Hierarchies in Image-Text Representations

    Morris Alper and Hadar Averbuch-Elor. Emergent Visual-Semantic Hierarchies in Image-Text Representations . In European Conference on Computer Vision ( ECCV ) , 2024

    work page 2024

  2. [2]

    Latent Space Oddity: on the Curvature of Deep Generative Models

    Georgios Arvanitidis, Lars Kai Hansen, and Søren Hauberg. Latent Space Oddity: on the Curvature of Deep Generative Models . In International Conference on Learning Representations (ICLR), 2018

    work page 2018

  3. [3]

    Geometrically Enriched Latent Spaces

    Georgios Arvanitidis, Soren Hauberg, and Bernhard Sch \"o lkopf. Geometrically Enriched Latent Spaces . In International Conference on Artificial Intelligence and Statistics (AISTATS), 2021

    work page 2021

  4. [4]

    Georgiev, and Bernhard Sch\"olkopf

    Georgios Arvanitidis, Bogdan M. Georgiev, and Bernhard Sch\"olkopf. A Prior-Based Approximate Latent Riemannian Metric . In International Conference on Artificial Intelligence and Statistics (AISTATS), 2022

    work page 2022

  5. [5]

    Courville, and Pascal Vincent

    Yoshua Bengio, Aaron C. Courville, and Pascal Vincent. Representation Learning: A Review and New Perspectives . IEEE Transactions on Pattern Analysis and Machine Intelligence ( PAMI ) , 35: 0 1798--1828, 2012

    work page 2012

  6. [6]

    Video Generation Models as World Simulators

    Tim Brooks, Bill Peebles, Connor Holmes, Will DePue, Yufei Guo, Li Jing, David Schnurr, Joe Taylor, Troy Luhman, Eric Luhman, Clarence Ng, Ricky Wang, and Aditya Ramesh. Video Generation Models as World Simulators . 2024

    work page 2024

  7. [7]

    Input Similarity from the Neural Network Perspective

    Guillaume Charpiat, Nicolas Girard, Loris Felardos, and Yuliya Tarabalka. Input Similarity from the Neural Network Perspective . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2019

    work page 2019

  8. [8]

    Metrics for Deep Generative Models

    Nutan Chen, Alexej Klushyn, Richard Kurle, Xueyan Jiang, Justin Bayer, and Patrick Smagt. Metrics for Deep Generative Models . In International Conference on Artificial Intelligence and Statistics ( AISTATS ) , 2018

    work page 2018

Show all 67 references
  1. [9]

    Improving Diffusion Models for Inverse Problems using Manifold Constraints

    Hyungjin Chung, Byeongsu Sim, Dohoon Ryu, and Jong Chul Ye. Improving Diffusion Models for Inverse Problems using Manifold Constraints . In Advances in Neural Information Processing Systems (NeurIPS), 2022

    2022

  2. [10]

    On Deep Generative Models for Approximation and Estimation of Distributions on Manifolds

    Biraj Dahal, Alexander Havrilla, Minshuo Chen, Tuo Zhao, and Wenjing Liao. On Deep Generative Models for Approximation and Estimation of Distributions on Manifolds . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2022

    2022

  3. [11]

    The Mnist Database of Handwritten Digit Images for Machine Learning Research

    Li Deng. The Mnist Database of Handwritten Digit Images for Machine Learning Research . IEEE Signal Processing Magazine, 29: 0 141--142, 2012

    2012

  4. [12]

    Chrysos, and Volkan Cevher

    Justin Deschenaux, Igor Krawczuk, Grigorios G. Chrysos, and Volkan Cevher. Going beyond Compositions, DDPMs Can Produce Zero-Shot Interpolations . In International Conference on Machine Learning (ICML), 2024

    2024

  5. [13]

    o hlich, Alexandra Gessner, Philipp Hennig, Bernhard Sch \

    Christian Fr \"o hlich, Alexandra Gessner, Philipp Hennig, Bernhard Sch \"o lkopf, and Georgios Arvanitidis. Bayesian Quadrature on Riemannian Data Manifolds . In International Conference on Machine Learning (ICML), 2021

    2021

  6. [14]

    Dreamsim: Learning New Dimensions of Human Visual Similarity using Synthetic Data

    Stephanie Fu, Netanel Tamir, Shobhita Sundaram, Lucy Chai, Richard Zhang, Tali Dekel, and Phillip Isola. Dreamsim: Learning New Dimensions of Human Visual Similarity using Synthetic Data . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2023

    2023

  7. [15]

    Generative Adversarial Nets

    Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative Adversarial Nets . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2014

    2014

  8. [16]

    Evaluation of Similarity-based Explanations

    Kazuaki Hanawa, Sho Yokoi, Satoshi Hara, and Kentaro Inui. Evaluation of Similarity-based Explanations . In International Conference on Learning Representations ( ICLR ) , 2021

    2021

  9. [17]

    GANSpace : Discovering Interpretable GAN Controls

    Erik H\" a rk\" o nen, Aaron Hertzmann, Jaakko Lehtinen, and Sylvain Paris. GANSpace : Discovering Interpretable GAN Controls . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2020

    2020

  10. [18]

    Manifold Preserving Guided Diffusion

    Yutong He, Naoki Murata, Chieh-Hsin Lai, Yuhta Takida, Toshimitsu Uesaka, Dongjun Kim, Wei-Hsiang Liao, Yuki Mitsufuji, J Zico Kolter, Ruslan Salakhutdinov, and Stefano Ermon. Manifold Preserving Guided Diffusion . In International Conference on Learning Representations (ICLR), 2024

    2024

  11. [19]

    Denoising Diffusion Probabilistic Models

    Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising Diffusion Probabilistic Models . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2020

    2020

  12. [20]

    Density Estimation on Low-dimensional Manifolds : An Inflation-Deflation Approach

    Christian Horvat and Jean-Pascal Pfister. Density Estimation on Low-dimensional Manifolds : An Inflation-Deflation Approach . Journal of Machine Learning Research ( JMLR ) , 2022

    2022

  13. [21]

    On Gauge Freedom, Conservativity and Intrinsic Dimensionality Estimation in Diffusion models

    Christian Horvat and Jean-Pascal Pfister. On Gauge Freedom, Conservativity and Intrinsic Dimensionality Estimation in Diffusion models . In International Conference on Learning Representations (ICLR), 2024

    2024

  14. [22]

    An Error Analysis of Generative Adversarial Networks for Learning Distributions

    Jian Huang, Yuling Jiao, Zhen Li, Shiao Liu, Yang Wang, and Yunfei Yang. An Error Analysis of Generative Adversarial Networks for Learning Distributions . Journal of Machine Learning Research ( JMLR ) , 2022

    2022

  15. [23]

    Cresswell, and Gabriel Loaiza-Ganem

    Hamidreza Kamkari, Brendan Leigh Ross, Rasa Hosseinzadeh, Jesse C. Cresswell, and Gabriel Loaiza-Ganem. A Geometric View of Data Complexity: Efficient Local Intrinsic Dimension Estimation with Diffusion Models . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2024

    2024

  16. [24]

    DiffusionCLIP : Text-Guided Diffusion Models for Robust Image Manipulation

    Gwanghyun Kim, Taesung Kwon, and Jong-Chul Ye. DiffusionCLIP : Text-Guided Diffusion Models for Robust Image Manipulation . the IEEE/CVF Conference on Computer Vision and Pattern Recognition ( CVPR ) , pp.\ 2416--2425, 2021

    2021

  17. [25]

    Diffusion Bridge AutoEncoders for Unsupervised Representation Learning

    Yeongmin Kim, Kwanghyeon Lee, Minsang Park, Byeonghu Na, and Il chul Moon. Diffusion Bridge AutoEncoders for Unsupervised Representation Learning . In International Conference on Learning Representations ( ICLR ) , 2025

    2025

  18. [26]

    Kingma and Jimmy Ba

    Diederik P. Kingma and Jimmy Ba. Adam : A Method for Stochastic Optimization . In International Conference on Learning Representations (ICLR) , 2015

    2015

  19. [27]

    Kingma and Max Welling

    Diederik P. Kingma and Max Welling. Auto-Encoding Variational Bayes . In International Conference on Learning Representations ( ICLR ) , 2014

    2014

  20. [28]

    Diffusion Models Already Have A Semantic Latent Space

    Mingi Kwon, Jaeseok Jeong, and Youngjung Uh. Diffusion Models Already Have A Semantic Latent Space . In International Conference on Learning Representations (ICLR), 2023

    2023

  21. [29]

    John M. Lee. Introduction to Riemannian Manifolds . Springer, 2019

    2019

  22. [30]

    A Statistical Manifold Framework for Point Cloud Data

    Yonghyeon Lee, Seungyeon Kim, Jinwon Choi, and Frank Park. A Statistical Manifold Framework for Point Cloud Data . In International Conference on Machine Learning (ICML), 2022

    2022

  23. [31]

    Caterini, and Jesse C

    Gabriel Loaiza-Ganem, Brendan Leigh Ross, Rasa Hosseinzadeh, Anthony L. Caterini, and Jesse C. Cresswell. Deep Generative Models through the Lens of the Manifold Hypothesis : A Survey and New Connections . Transactions on Machine Learning Research ( TMLR ) , 2024

    2024

  24. [32]

    SGDR : Stochastic Gradient Descent with Warm Restarts

    Ilya Loshchilov and Frank Hutter. SGDR : Stochastic Gradient Descent with Warm Restarts . In International Conference on Learning Representations ( ICLR ) , 2017

    2017

  25. [33]

    Hierarchical Diffusion Autoencoders and Disentangled Image Manipulation

    Zeyu Lu, Chengyue Wu, Xinyuan Chen, Yaohui Wang, Lei Bai, Yu Qiao, and Xihui Liu. Hierarchical Diffusion Autoencoders and Disentangled Image Manipulation . In IEEE Workshop/Winter Conference on Applications of Computer Vision ( WACV ) , pp.\ 5362--5371, 2024

    2024

  26. [34]

    Understanding Diffusion Models: A Unified Perspective

    Calvin Luo. Understanding Diffusion Models: A Unified Perspective . arXiv, 2022

    2022

  27. [35]

    Null-Text Inversion for Editing Real Images using Guided Diffusion Models

    Ron Mokady, Amir Hertz, Kfir Aberman, Yael Pritch, and Daniel Cohen-Or. Null-Text Inversion for Editing Real Images using Guided Diffusion Models . In the IEEE/CVF Conference on Computer Vision and Pattern Recognition ( CVPR ) , pp.\ 6038--6047, 2023

    2023

  28. [36]

    Understanding the Latent Space of Diffusion Models through the Lens of Riemannian Geometry

    Yong-Hyun Park, Mingi Kwon, Jaewoong Choi, Junghyo Jo, and Youngjung Uh. Understanding the Latent Space of Diffusion Models through the Lens of Riemannian Geometry . In Advances in Neural Information Processing Systems (NeurIPS), 2023 a

    2023

  29. [37]

    Unsupervised Discovery of Semantic Latent Directions in Diffusion Models , 2023 b

    Yong-Hyun Park, Mingi Kwon, Junghyo Jo, and Youngjung Uh. Unsupervised Discovery of Semantic Latent Directions in Diffusion Models , 2023 b

    2023

  30. [38]

    Score-Based Generative Models Detect Manifolds

    Jakiw Pidstrigach. Score-Based Generative Models Detect Manifolds . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2022

    2022

  31. [39]

    Barron, and Ben Mildenhall

    Ben Poole, Ajay Jain, Jonathan T. Barron, and Ben Mildenhall. DreamFusion : Text-to-3D using 2D Diffusion . In International Conference on Learning Representations ( ICLR ) , 2023

    2023

  32. [40]

    Diffusion Autoencoders: Toward a Meaningful and Decodable Representation

    Konpat Preechakul, Nattanat Chatthee, Suttisak Wizadwongsa, and Supasorn Suwajanakorn. Diffusion Autoencoders: Toward a Meaningful and Decodable Representation . In the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2022

    2022

  33. [41]

    Learning Transferable Visual Models From Natural Language Supervision

    Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever. Learning Transferable Visual Models From Natural Language Supervision . In International Co...

    2021

  34. [42]

    High-resolution Image Synthesis with Latent Diffusion Models

    Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Bj \"o rn Ommer. High-resolution Image Synthesis with Latent Diffusion Models . In the IEEE/CVF Conference on Computer Vision and Pattern Recognition ( CVPR ) , 2022

    2022

  35. [43]

    Norm-guided Latent Space Exploration for Text-to-image Generation

    Dvir Samuel, Rami Ben-Ari, Nir Darshan, Haggai Maron, and Gal Chechik. Norm-guided Latent Space Exploration for Text-to-image Generation . In Advances in Neural Information Processing Systems (NeurIPS), 2023

    2023

  36. [44]

    Thomas Fletcher

    Hang Shao, Abhishek Kumar, and P. Thomas Fletcher. The Riemannian Geometry of Deep Generative Models . the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops ( CVPRW ) , 2017

    2017

  37. [45]

    Closed-form Factorization of Latent Semantics in GANs

    Yujun Shen and Bolei Zhou. Closed-form Factorization of Latent Semantics in GANs . In the IEEE/CVF Conference on Computer Vision and Pattern Recognition ( CVPR ) , 2021

    2021

  38. [46]

    Animating Rotation with Quaternion Curves

    Ken Shoemake. Animating Rotation with Quaternion Curves . Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) , 1985

    1985

  39. [47]

    Deep Unsupervised Learning using Nonequilibrium Thermodynamics

    Jascha Sohl-Dickstein, Eric Weiss, Niru Maheswaranathan, and Surya Ganguli. Deep Unsupervised Learning using Nonequilibrium Thermodynamics . In International Conference on Learning Representations ( ICLR ) , 2015

    2015

  40. [48]

    Denoising Diffusion Implicit Models

    Jiaming Song, Chenlin Meng, and Stefano Ermon. Denoising Diffusion Implicit Models . In International Conference on Learning Representations ( ICLR ) , 2021 a

    2021

  41. [49]

    Score-Based Generative Modeling through Stochastic Differential Equations

    Yang Song, Jascha Sohl-Dickstein, Diederik P Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. Score-Based Generative Modeling through Stochastic Differential Equations . In International Conference on Learning Representations ( ICLR ) , 2021 b

    2021

  42. [50]

    Diffusion Models Encode the Intrinsic Dimension of Data Manifolds

    Jan Pawel Stanczuk, Georgios Batzolis, Teo Deveney, and Carola-Bibiane Sch \"o nlieb. Diffusion Models Encode the Intrinsic Dimension of Data Manifolds . In International Conference on Machine Learning (ICML), 2024

    2024

  43. [51]

    Human Motion Diffusion Model

    Guy Tevet, Sigal Raab, Brian Gordon, Yoni Shafir, Daniel Cohen-or, and Amit Haim Bermano. Human Motion Diffusion Model . In International Conference on Learning Representations ( ICLR ) , 2023

    2023

  44. [52]

    Manifolds, Random Matrices and Spectral Gaps : The Geometric Phases of Generative Diffusion

    Enrico Ventura, Beatrice Achilli, Gianluigi Silvestri, Carlo Lucibello, and Luca Ambrogioni. Manifolds, Random Matrices and Spectral Gaps : The Geometric Phases of Generative Diffusion . In International Conference on Learning Representations (ICLR), 2025

    2025

  45. [53]

    Unsupervised Discovery of Interpretable Directions in the GAN Latent Space

    Andrey Voynov and Artem Babenko. Unsupervised Discovery of Interpretable Directions in the GAN Latent Space . In International Conference on Machine Learning ( ICML ) , 2020

    2020

  46. [54]

    Wang and Polina Golland

    Clinton J. Wang and Polina Golland. Interpolating between Images with Diffusion Models . In ICML 2023 Workshop on Challenges of Deploying Generative AI, 2023

    2023

  47. [55]

    Chan, and Chen Change Loy

    Jianyi Wang, Kelvin C.K. Chan, and Chen Change Loy. Exploring CLIP for Assessing the Look and Feel of Images . In AAAI Conference on Artificial Intelligence ( AAAI ) , 2023

    2023

  48. [56]

    IMPUS : Image Morphing with Perceptually-Uniform Sampling Using Diffusion Models

    Zhaoyuan Yang, Zhengyang Yu, Zhiwei Xu, Jaskirat Singh, Jing Zhang, Dylan Campbell, Peter Tu, and Richard Hartley. IMPUS : Image Morphing with Perceptually-Uniform Sampling Using Diffusion Models . In International Conference on Learning Representations (ICLR), 2024

    2024

  49. [57]

    Chih-Kuan Yeh, Joon Sik Kim, Ian E. H. Yen, and Pradeep Ravikumar. Representer Point Selection for Explaining Deep Neural Networks . In Advances in Neural Information Processing Systems ( NeurIPS ) , 2018

    2018

  50. [58]

    DiffMorpher: Unleashing the Capability of Diffusion Models for Image Morphing

    Kaiwen Zhang, Yifan Zhou, Xudong Xu, Xingang Pan, and Bo Dai. DiffMorpher: Unleashing the Capability of Diffusion Models for Image Morphing . In the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023

    2023

  51. [59]

    The Unreasonable Effectiveness of Deep Features as a Perceptual Metric

    Richard Zhang, Phillip Isola, Alexei A Efros, Eli Shechtman, and Oliver Wang. The Unreasonable Effectiveness of Deep Features as a Perceptual Metric . In the IEEE/CVF Conference on Computer Vision and Pattern Recognition ( CVPR ) , 2018

    2018

  52. [60]

    NoiseDiffusion: Correcting Noise for Image Interpolation with Diffusion Models beyond Spherical Linear Interpolation

    PengFei Zheng, Yonggang Zhang, Zhen Fang, Tongliang Liu, Defu Lian, and Bo Han. NoiseDiffusion: Correcting Noise for Image Interpolation with Diffusion Models beyond Spherical Linear Interpolation . In International Conference on Learning Representations (ICLR), 2024

    2024

  53. [61]

    Low-rank Subspaces in GANs

    Jiapeng Zhu, Ruili Feng, Yujun Shen, Deli Zhao, Zheng-Jun Zha, Jingren Zhou, and Qifeng Chen. Low-rank Subspaces in GANs . In Advances in Neural Information Processing Systems ( NeurIPS ) , volume 34, pp.\ 16648--16658, 2021

    2021

  54. [62]

    Region-Based Semantic Factorization in GANs

    Jiapeng Zhu, Yujun Shen, Yinghao Xu, Deli Zhao, and Qifeng Chen. Region-Based Semantic Factorization in GANs . In International Conference on Machine Learning ( ICML ) , volume 162, pp.\ 27612--27632, 2022

    2022

  55. [63]

    Diffusion State-Guided Projected Gradient for Inverse Problems

    Rayhan Zirvi, Bahareh Tolooshams, and Anima Anandkumar. Diffusion State-Guided Projected Gradient for Inverse Problems . In International Conference on Learning Representations (ICLR), 2025

    2025

  56. [64]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

  57. [65]

    @esa (Ref

    \@ifxundefined[1] #1\@undefined \@firstoftwo \@secondoftwo \@ifnum[1] #1 \@firstoftwo \@secondoftwo \@ifx[1] #1 \@firstoftwo \@secondoftwo [2] @ #1 \@temptokena #2 #1 @ \@temptokena \@ifclassloaded agu2001 natbib The agu2001 class already includes natbib coding, so you should ...

  58. [66]

    \@lbibitem[] @bibitem@first@sw\@secondoftwo \@lbibitem[#1]#2 \@extra@b@citeb \@ifundefined br@#2\@extra@b@citeb \@namedef br@#2 \@nameuse br@#2\@extra@b@citeb \@ifundefined b@#2\@extra@b@citeb @num @parse #2 @tmp #1 NAT@b@open@#2 NAT@b@shut@#2 \@ifnum @merge>\@ne @bibitem@firs...

  59. [67]

    @open @close @open @close and [1] URL: #1 \@ifundefined chapter * \@mkboth \@ifxundefined @sectionbib * \@mkboth * \@mkboth\@gobbletwo \@ifclassloaded amsart * \@ifclassloaded amsbook * \@ifxundefined @heading @heading NAT@ctr thebibliography [1] @ \@biblabel @NAT@ctr \@bibset...

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.