Pith. sign in

REVIEW 3 major objections 4 minor 93 references

Towards Scalable Topological Regularizers

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

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

Pith's one-line read This paper proposes PPM-Reg, a topological regularizer that replaces full persistent-homology computations with principal persistence measures from many small subsamples, compared by maximum mean discrepancy, and proves continuous…

desk verdict A useful combination of PPMs and MMD with a strong GPU implementation, but the C^1-gradients theorem has a proof gap that needs patching before the stability claim is taken as established. read the letter →

arxiv 2501.14641 v2 pith:JK55YDR3 submitted 2025-01-24 cs.LG math.AT

Hiu-Tung Wong , Darrick Lee , Hong Yan This is my paper · ORCID
classification cs.LGmath.AT MSC 55N3162R4068T07
keywords persistenthomologyprincipalpersistencemeasuresmaximummeandiscrepancytopologicalregularizationgenerativeadversarialnetworkssemi-supervisedlearningkernelmethodsGPUparallelization
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

Latent-space matching in deep learning rarely accounts for the multi-scale shape of point clouds, and the usual topological tool, persistent homology, is too slow and too jagged for adversarial training. This paper proposes computing the persistence of many tiny subsamples, exactly $2q+2$ points for homology dimension $q$, packaging the results as a probability measure called a principal persistence measure, and comparing such measures by maximum mean discrepancy with a lifetime-weighted kernel. The paper proves that this comparison is a $C^1$ function of generator and discriminator parameters when the underlying measures have smooth densities, so gradients do not jump. It also reports experiments in which the regularizer improves shape matching, GAN image generation quality, and semi-supervised classification with very few labels. If the smoothness proof carries over to practice, topological regularization becomes both scalable and stable enough for adversarial learning.

What carries the argument

The load-bearing object is the principal persistence measure (PPM): for a probability measure $\mu$, $PPM_q(\mu)$ is the pushforward of the product measure $\mu^{\otimes (2q+2)}$ along the map that sends a subsample to its dimension-$q$ persistence pair $(b,\ell)$ in the pointed half-plane $\Omega$. Because a subsample of exactly $2q+2$ points has at most one dimension-$q$ feature, persistence can be computed from nearest-neighbor distances via the explicit formula $t_b = \max_x d(x,x^{(2)})$, $t_d = \min_x d(x,x^{(1)})$, which parallelizes on a GPU. The regularizer compares PPMs through MMD using the lifetime-weighted kernel $k_\Omega(z_1,z_2)=\ell_1\ell_2 k(z_1,z_2)$, whose characteristicness (Theorem 1) and topological equivalence to Wasserstein (Theorem 2) are established in the paper; Theorem 3 then gives the $C^1$ gradient guarantee.

What would settle it

Train the regularizer on a GAN whose generator is a ReLU network with discrete empirical measures and compute PPM-Reg gradients by finite differences across a parameter where the latent pushforward changes rank; a jump or undefined gradient at that point would show the $C^1$ guarantee does not hold in the implemented setting.

Watch

Extended reading notes

Core claim

The central claim is that topological regularization need not choose between fidelity and cost: principal persistence measures (PPMs), obtained by pushing a measure through the persistent-homology map on $2q+2$-point subsamples, are rich enough to encode multi-scale topological features, and comparing them with an MMD built from the kernel $k_\Omega((b_1,\ell_1),(b_2,\ell_2)) = \ell_1 \ell_2 k((b_1,\ell_1),(b_2,\ell_2))$ gives a metric with the same topology as Wasserstein on persistence measures. The main theoretical result, Theorem 3, asserts that the resulting regularizer $T_q$ is $C^1$ in the generator and discriminator parameters whenever the relevant measures have $C^1$ densities and the maps are $C^1$, except at the trivial measure at the origin. The paper's experiments show the regularizer steering point clouds to reference shapes, improving embedding-based image quality metrics on AnimeFace and CelebA, and sharply raising semi-supervised accuracy on MNIST-style datasets with 200 or 400 labels.

Load-bearing premise

The proof that the regularizer has continuous gradients assumes that the distribution produced by pushing the noise through the generator has a smoothly varying density; neural-network generators and discriminators are usually non-injective and training operates on discrete samples, so this assumption can fail exactly where the method is used.

Editorial extensions

If this is right

  • Topological regularization becomes practical at GAN scale: with the PPM-MMD pipeline, per-step cost is nearly constant as the point cloud grows and sublinear in the number of subsamples.
  • The MMD metric on PPMs can replace Wasserstein or Sinkhorn comparisons of persistence diagrams, since it induces the same topology on persistence measures.
  • Continuous gradients remove the main obstacle to using topological losses in adversarial training, where gradient discontinuities cause unstable dynamics.
  • In the reported experiments, adding PPM-Reg improves embedding-based image quality metrics on AnimeFace and CelebA at 32x32 and 64x64 resolutions.
  • Semi-supervised classification with 200 or 400 labels improves substantially on MNIST-style datasets, indicating that topological latent structure carries label-relevant information.

Reading between the lines

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

  • A testable extension is to smooth the PPM computation, for example by injecting noise or using kernel density estimates, to recover gradient regularity when generators are non-injective, since the paper's $C^1$ guarantee assumes a density condition that practical neural networks may violate.
  • Because the MMD-PPM metric metrizes the same topology as Wasserstein on persistence measures, the regularizer is a drop-in candidate for other distribution-matching problems, such as domain adaptation or representation alignment, not only GANs.
  • The near-flat runtime in point-cloud size suggests the same subsample-and-pushforward trick could be applied to other geometric signatures, as long as the small-subsample computation is explicit and parallelizable.
  • The semi-supervised gains hint that topological regularization acts partly as a manifold-structure prior; if true, similar gains should appear in other low-label regimes beyond the tested datasets.
Share X Bluesky LinkedIn Reddit HN

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 PPM-Reg, a topological regularizer for latent-space matching and GAN training. It replaces persistence diagrams with principal persistence measures (PPMs) computed from many small subsamples, compares PPMs via maximum mean discrepancy (MMD) using persistence-weighted kernels, and provides a GPU implementation. The theoretical section proves characteristicness of the kernels (Theorem 1), topological equivalence of MMD and Wasserstein on PPMs (Theorem 2), and claims C^1 regularity of the regularizer as a function of generator and discriminator parameters (Theorem 3). Experiments on shape matching, 32x32 and 64x64 image generation, and semi-supervised learning on MNIST variants and SVHN show consistent improvements over a Cramer-loss baseline.

Significance. If the results are correct, the paper makes a useful practical contribution: a scalable, parallelizable topological regularizer with a principled kernel metric on persistent homology summaries, backed by code release and extensive ablations. The computational speedups in Table 1 and the consistent gains in image-generation metrics and SSL accuracy are credible and well documented. However, Theorem 3, which is the paper's advertised smoothness guarantee, is not proven as stated: the proof in Appendix D relies on a false regularity assumption on pushforwards of densities, and the implemented method optimizes empirical measures rather than C^1 densities. The theoretical claim therefore needs substantial revision before the paper can be accepted in its current form.

major comments (3)
  1. [Appendix D, Eq. (46)] The derivation of Theorem 7 (and hence Theorem 3) relies on the assertion that F(θ) has a C^1 density 'which is true if H is C^1, and μ has a C^1 density.' This implication is false for non-injective C^1 maps: for μ uniform on (-1,1) and h_θ(x)=θ x^3, the pushforward has density (1/6)|θ|^{-1/3}|y|^{-2/3} on its support, which is unbounded and not C^1 at y=0, and for θ=0 the pushforward is a Dirac mass. Since GAN generators and discriminators (ReLU networks with possible dead or collapsed units) are generally not injective and may have rank-deficient Jacobians on open regions, the hypotheses of Theorem 7 are not satisfied in the intended application. Thus Eq. (46) is not justified, and the differentiation under the integral in Eq. (50) does not establish Theorem 3 as stated.
  2. [Theorem 3 (Section 5)] The differentiability exception in Theorem 3 is incorrectly stated: the Hilbert-space norm in Eq. (13) is non-differentiable whenever Φ(PPM_q(µ)) = Φ(PPM_q(ν)), i.e., whenever the two PPMs have the same kernel mean embedding, not merely when 'the PPM is not the trivial measure at the origin.' The proof in Appendix D itself uses 'continuously differentiable away from the origin' in the Hilbert space, so the theorem's statement should exclude the entire coincidence set of the two embeddings (or a neighborhood formulation). As written, the statement is misleading about the set of points where gradients are guaranteed continuous.
  3. [Section 6.1 / applicability of Theorem 3] The implemented PPM-Reg computes PPMs from s subsamples of discrete empirical mini-batches (Section 6.1), and in the GAN setting the measures d_θ(µ) and d_θ(g_ω(ν)) are empirical measures with atoms, not measures with C^1 densities. Theorem 3 therefore does not govern the object that is actually optimized in the experiments. The paper should either provide a separate statement for empirical measures (e.g., differentiability with respect to sample point positions for fixed subsamples, or a stochastic or almost-sure statement for fixed subsample indices), or explicitly limit the smoothness claim to the idealized density setting and explain why the empirical behavior is nevertheless consistent with the theory.
minor comments (4)
  1. [Appendix F.1] The text says 'Table 5 for AnimeFace and Table 4 for CelebA', but Table 4 is the AnimeFace ablation and Table 5 is the CelebA ablation; these references are swapped.
  2. [Appendix H] The captions of Figures 10 and 11 contain the typo 'classifiacter', which should be 'classifier'.
  3. [Appendix E.1] There is a typo 'wiht' in the implementation details; it should be 'with'.
  4. [Section 4] The notation for PPM dimension is inconsistent: Section 3 uses PPM_q, while Appendix D uses PPM_k in Eq. (44); unify the subscript notation throughout.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation found; the Theorem 3 proof gap is a correctness risk, not circularity.

full rationale

The construction is not circular: PPM-Reg is defined in Eq. (13) as an MMD between fixed pushforward measures, and no fitted parameter is later renamed as a prediction. Theorems 1 and 2 are proved from the stated universal-kernel hypothesis using standard RKHS duality and external metrization results (Sriperumbudur 2016, Villani 2009), with independent proofs supplied in Appendices B and C; the citations to Kusano et al. and Divol & Lacombe are adaptations, not load-bearing self-citations. Theorem 3's proof in Appendix D differentiates a Bochner integral and would establish C1 regularity if the pushforward density assumption were valid. However, the assertion that a C1 map H and a C1 density mu yield a C1 pushforward density is false for non-injective maps, and GAN generators/discriminators are typically non-injective; this is a correctness gap in the proof as stated, not a circular reduction to the theorem's conclusion. The only self-citation, Giusti & Lee (2023) (coauthor Lee), appears in Remark 1 merely as one of several references supporting the view of persistence diagrams as measures; it plays no role in the main theorems or experiments, so by the rubric it contributes at most a minor non-load-bearing citation and does not indicate circularity.

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

The central claim rests on cited PPM theory, universality of RBF kernels, and a problematic pushforward density assumption. No new physical or mathematical entities are introduced.

free parameters (4)
  • RBF kernel width sigma = 0.1 for shape matching; 0.05, 0.1, 0.5 for image generation and SSL ablations
    Controls the persistence-weighted kernel kOmega; selected by ablation on evaluation metrics.
  • Regularization weights lambda, lambda0, lambda1 = Image gen 32x32: lambda=1.0, lambda0=0.001, lambda1=0.6; SSL: lambda=0.025-0.1, lambda0=1, lambda1=90; shape…
    Weights the PPM-Reg term in V = L + lambda*T; selected per dataset and task.
  • Number of subsamples s = 1024 or 2048 in most experiments; 2000 in shape matching
    Approximates the PPM by s random subsamples; chosen as a trade-off between speed and fidelity.
  • Cosine annealing schedule lambda_min, lambda_max, tend = CelebA 64x64: lambda=1, lambda_min=0.1, lambda_max=1, tend=1920; LSUN: lambda=10, lambda_min=0.1, lambda_max=0.8…
    Additional tuning parameters for the time-varying lambda1 schedule in the 64x64 image generation experiments.
assumptions (6)
  • domain assumption Equation (4): PH_q of a 2q+2 point subsample has a single feature given by tb=max_x d(x,x^(2)) and td=min_x d(x,x^(1)).
    Invoked in Section 3 as the core of the GPU implementation; cited from Gómez & Mémoli 2024.
  • ad hoc to paper The pushforward of a C^1 density under a C^1 map has a C^1 density.
    Appendix D, Eq. (46); false for non-injective maps, so Theorem 3's proof rests on an unstated injectivity or diffeomorphism assumption.
  • standard math The base kernel k on [0,T]^2 is universal (RBF in experiments).
    Needed for Theorems 1 and 2; RBF is universal on compact sets.
  • ad hoc to paper PPMs from 2q+2-point subsamples capture the topological features relevant for regularization.
    Design assumption; no guarantee that optimizing PPM-Reg optimizes full persistent homology of the data.
  • standard math The MMD kernel embedding on compact Omega is injective and metrizes weak convergence via Sriperumbudur 2016 and Villani 2009.
    Used in Theorem 2 and Appendix C.
  • domain assumption Empirical distributions used in experiments behave like smooth densities for gradient continuity purposes.
    Theorem 3 requires C^1 densities, but experiments use discrete point clouds and minibatches; the smoothness guarantee does not directly apply.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Towards Scalable Topological Regularizers." pith.science (2026). https://pith.science/paper/JK55YDR3

@misc{pith2026250114641,
  author       = {Pith},
  title        = {Pith review of: Towards Scalable Topological Regularizers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JK55YDR3}},
  note         = {Machine review of arXiv:2501.14641}
}
read the original abstract

Latent space matching, which consists of matching distributions of features in latent space, is a crucial component for tasks such as adversarial attacks and defenses, domain adaptation, and generative modelling. Metrics for probability measures, such as Wasserstein and maximum mean discrepancy, are commonly used to quantify the differences between such distributions. However, these are often costly to compute, or do not appropriately take the geometric and topological features of the distributions into consideration. Persistent homology is a tool from topological data analysis which quantifies the multi-scale topological structure of point clouds, and has recently been used as a topological regularizer in learning tasks. However, computation costs preclude larger scale computations, and discontinuities in the gradient lead to unstable training behavior such as in adversarial tasks. We propose the use of principal persistence measures, based on computing the persistent homology of a large number of small subsamples, as a topological regularizer. We provide a parallelized GPU implementation of this regularizer, and prove that gradients are continuous for smooth densities. Furthermore, we demonstrate the efficacy of this regularizer on shape matching, image generation, and semi-supervised learning tasks, opening the door towards a scalable regularizer for topological features.

Figures

Figures reproduced from arXiv: 2501.14641 by the authors.

Figure 1
Figure 1. An illustration of PH and PPMs. (a) An example point cloud [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Visual example of PPM-Reg in a shape matching experiment using Cramer or MMD as the [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. CMMD (a,d), FDDinov2 (b,e) and WDlatent (c,f) versus training epochs for the AnimeFace (a-c) and CelebA (d-f) dataset. 10K samples are randomly generated to compute distances; moving averages with a window of 5 are used to smooth the values. Distances recorded every 160 epochs. Results [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: Plots of the shape matching experiment at convergence after 16000 steps. (a) and (e) use [PITH_FULL_IMAGE:figures/full_fig_p022_4.png]
Figure 5
Figure 5. Figure 5: Illustrative example of the PPM-Reg in shape matching using MMD with increasing [PITH_FULL_IMAGE:figures/full_fig_p022_5.png]
Figure 6
Figure 6. Figure 6: CMMD (a,e), FDDinov2 (b,f) and WDlatent (c,g) versus training epochs for the CelebA (a-c) and LSUN Kitchen (d-f) dataset for the 64 × 64 image generation. 10K samples are randomly generated to compute the distances, and moving averages with a window of 5 are used to sm…
Figure 7
Figure 7. Figure 7: Generated images from SSL experiment from trained [PITH_FULL_IMAGE:figures/full_fig_p026_7.png]
Figure 8
Figure 8. Figure 8: Network architecture of generator (a), discriminator (b) for [PITH_FULL_IMAGE:figures/full_fig_p028_8.png]
Figure 9
Figure 9. Figure 9: Network architecture of generator (a), discriminator (b) for [PITH_FULL_IMAGE:figures/full_fig_p029_9.png]
Figure 10
Figure 10. Figure 10: Network architecture of generator (a), discriminator (b) and classifiacter (c) for semi [PITH_FULL_IMAGE:figures/full_fig_p030_10.png]
Figure 11
Figure 11. Figure 11: Network architecture of generator (a), discriminator (b) and classifiacter (c) for semi [PITH_FULL_IMAGE:figures/full_fig_p031_11.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

93 extracted references · 53 canonical work pages

  1. [1]

    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 global.max substring 't := if while FUNCTION format.date year duplicate empty "emp...

  2. [2]

    Wasserstein generative adversarial networks

    Martin Arjovsky, Soumith Chintala, and L \'e on Bottou. Wasserstein generative adversarial networks. In International conference on machine learning, pp.\ 214--223. PMLR, 2017

    2017

  3. [3]

    Aronszajn

    N. Aronszajn. Theory of reproducing kernels. Trans. Amer. Math. Soc., 68 0 (3): 0 337--404, 1950. ISSN 0002-9947. doi:10.2307/1990404

    doi:10.2307/1990404 1950

  4. [4]

    On the Expressivity of Persistent Homology in Graph Learning , June 2024

    Rub \'e n Ballester and Bastian Rieck. On the Expressivity of Persistent Homology in Graph Learning , June 2024

    2024

  5. [5]

    Manifold topology divergence: A framework for comparing data manifolds

    Serguei Barannikov, Ilya Trofimov, Grigorii Sotnikov, Ekaterina Trimbach, Alexander Korotin, Alexander Filippov, and Evgeny Burnaev. Manifold topology divergence: A framework for comparing data manifolds. In A. Beygelzimer, Y. Dauphin, P. Liang, and J. Wortman Vaughan (eds.), Advances in Neural Information Processing Systems, 2021

    2021

  6. [6]

    Ripser: Efficient computation of Vietoris -- Rips persistence barcodes

    Ulrich Bauer. Ripser: Efficient computation of Vietoris -- Rips persistence barcodes. Journal of Applied and Computational Topology, 5 0 (3): 0 391--423, September 2021. ISSN 2367-1734. doi:10.1007/s41468-021-00071-5

    doi:10.1007/s41468-021-00071-5 2021

  7. [7]

    The cramer distance as a solution to biased wasserstein gradients

    Marc G Bellemare, Ivo Danihelka, Will Dabney, Shakir Mohamed, Balaji Lakshminarayanan, Stephan Hoyer, and R \'e mi Munos. The cramer distance as a solution to biased wasserstein gradients. arXiv preprint arXiv:1705.10743, 2017

    arXiv 2017

  8. [8]

    Stabilizing the unstable output of persistent homology computations

    Paul Bendich, Peter Bubenik, and Alexander Wagner. Stabilizing the unstable output of persistent homology computations. Journal of Applied and Computational Topology, 4 0 (2): 0 309--338, June 2020. ISSN 2367-1734. doi:10.1007/s41468-019-00044-9

    work page doi:10.1007/s41468-019-00044-9 2020

Show all 93 references
  1. [9]

    A closer look at the optimization landscapes of generative adversarial networks

    Hugo Berard, Gauthier Gidel, Amjad Almahairi, Pascal Vincent, and Simon Lacoste-Julien. A closer look at the optimization landscapes of generative adversarial networks. In International Conference on Learning Representations, 2019

    2019

  2. [10]

    Blumberg, Itamar Gal, Michael A

    Andrew J. Blumberg, Itamar Gal, Michael A. Mandell, and Matthew Pancia. Robust Statistics , Hypothesis Testing , and Confidence Intervals for Persistent Homology on Metric Measure Spaces . Found. Comput. Math, 14 0 (4): 0 745--789, August 2014. ISSN 1615-3383. doi:10.1007/s102...

    2014 doi

  3. [11]

    Verifying the union of manifolds hypothesis for image data

    Bradley CA Brown, Anthony L Caterini, Brendan Leigh Ross, Jesse C Cresswell, and Gabriel Loaiza-Ganem. Verifying the union of manifolds hypothesis for image data. arXiv preprint arXiv:2207.02862, 2022

    2022 arXiv

  4. [12]

    Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces

    Peter Bubenik and Alex Elchesen. Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces. Journal of Applied and Computational Topology, 6 0 (4): 0 429--474, December 2022. ISSN 2367-1734. doi:10.1007/s41468-022-00091-9

    2022 doi

  5. [13]

    Approximating Persistent Homology for Large Datasets , May 2022

    Yueqi Cao and Anthea Monod. Approximating Persistent Homology for Large Datasets , May 2022

    2022

  6. [14]

    Optimizing persistent homology based functions

    Mathieu Carriere, Frederic Chazal, Marc Glisse, Yuichi Ike, Hariprasad Kannan, and Yuhei Umeda. Optimizing persistent homology based functions. In Proceedings of the 38th International Conference on Machine Learning , pp.\ 1294--1303. PMLR, July 2021

    2021

  7. [15]

    PHom-GeM : Persistent homology for generative models

    Jeremy Charlier, Radu State, et al. PHom-GeM : Persistent homology for generative models. In The 6th Swiss Conference on Data Science ( SDS ), 2019 IEEE International Conference . IEEE, 2019

    2019

  8. [16]

    Subsampling methods for persistent homology

    Fr \'e d \'e ric Chazal, Brittany Terese Fasy, Fabrizio Lecci, Bertrand Michel, Alessandro Rinaldo, and Larry Wasserman. Subsampling methods for persistent homology. In Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37...

    2015

  9. [17]

    Anime face dataset, 2019

    Spencer Churchill and Brian Chao. Anime face dataset, 2019. URL https://www.kaggle.com/ds/379764

    2019

  10. [18]

    Deep learning for classical japanese literature

    Tarin Clanuwat, Mikel Bober-Irizar, Asanobu Kitamoto, Alex Lamb, Kazuaki Yamamoto, and David Ha. Deep learning for classical japanese literature. arXiv preprint arXiv:1812.01718, 2018

    2018 arXiv

  11. [19]

    J. R. Clough, N. Byrne, I. Oksuz, V. A. Zimmer, J. A. Schnabel, and A. P. King. A topological loss function for deep-learning based image segmentation using persistent homology. IEEE Transactions on Pattern Analysis & Machine Intelligence, 44 0 (12): 0 8766--8778, December...

    2022

  12. [20]

    Sinkhorn distances: Lightspeed computation of optimal transport

    Marco Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems, 26, 2013

    2013

  13. [21]

    Nas-sgan: a semi-supervised generative adversarial network model for atypia scoring of breast cancer histopathological images

    Asha Das, Vinod Kumar Devarampati, and Madhu S Nair. Nas-sgan: a semi-supervised generative adversarial network model for atypia scoring of breast cancer histopathological images. IEEE Journal of Biomedical and Health Informatics, 26 0 (5): 0 2276--2287, 2021

    2021

  14. [22]

    Semi-supervised generative adversarial networks for the segmentation of the left ventricle in pediatric mri

    Colin Decourt and Luc Duong. Semi-supervised generative adversarial networks for the segmentation of the left ventricle in pediatric mri. Computers in Biology and Medicine, 123: 0 103884, 2020

    2020

  15. [23]

    Computational Topology for Data Analysis

    Tamal Krishna Dey and Yusu Wang. Computational Topology for Data Analysis . Cambridge University Press, March 2022. ISBN 978-1-00-910319-0

    2022

  16. [24]

    Dieudonne

    J. Dieudonne. Foundations of Modern Analysis . Academic Press, New York, 1969. ISBN 978-1-4465-4751-9

    1969

  17. [25]

    Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport

    Vincent Divol and Th \'e o Lacombe. Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport. J. Appl. Comput. Topol., 5 0 (1): 0 1--53, March 2021. ISSN 2367-1734. doi:10.1007/s41468-020-00061-z

    2021 doi

  18. [26]

    On the choice of weight functions for linear representations of persistence diagrams

    Vincent Divol and Wolfgang Polonik. On the choice of weight functions for linear representations of persistence diagrams. J. Appl. Comput. Topol., 3 0 (3): 0 249--283, September 2019. ISSN 2367-1734. doi:10.1007/s41468-019-00032-z

    2019 doi

  19. [27]

    Herbert Edelsbrunner and John L. Harer. Computational Topology : An Introduction . American Mathematical Society, 2010. ISBN 978-1-4704-6769-2

    2010

  20. [28]

    Signatures, lipschitz-free spaces, and paths of persistence diagrams

    Chad Giusti and Darrick Lee. Signatures, lipschitz-free spaces, and paths of persistence diagrams. SIAM Journal on Applied Algebra and Geometry, 7 0 (4): 0 828--866, 2023. doi:10.1137/22M1528471

    2023 doi

  21. [29]

    Curvature Sets Over Persistence Diagrams

    Mario G \'o mez and Facundo M \'e moli. Curvature Sets Over Persistence Diagrams . Discrete & Computational Geometry, 72 0 (1): 0 91--180, July 2024. ISSN 1432-0444. doi:10.1007/s00454-024-00634-0

    2024 doi

  22. [30]

    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. Advances in neural information processing systems, 27, 2014

    2014

  23. [31]

    Borgwardt, Malte J

    Arthur Gretton, Karsten M. Borgwardt, Malte J. Rasch, Bernhard Sch \"o lkopf, and Alexander Smola. A kernel two-sample test. J. Mach. Learn. Res., 13: 0 723--773, March 2012. ISSN 1533-7928

    2012

  24. [32]

    Improved training of wasserstein gans

    Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron C Courville. Improved training of wasserstein gans. Advances in neural information processing systems, 30, 2017

    2017

  25. [33]

    A Survey of Topological Machine Learning Methods

    Felix Hensel, Michael Moor, and Bastian Rieck. A Survey of Topological Machine Learning Methods . Frontiers in Artificial Intelligence, 4, May 2021. ISSN 2624-8212. doi:10.3389/frai.2021.681108

    2021

  26. [34]

    Gans trained by a two time-scale update rule converge to a local nash equilibrium

    Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, and Sepp Hochreiter. Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems, 30, 2017

    2017

  27. [35]

    Topology Distance : A Topology-Based Approach for Evaluating Generative Adversarial Networks

    Danijela Horak, Simiao Yu, and Gholamreza Salimi-Khorshidi . Topology Distance : A Topology-Based Approach for Evaluating Generative Adversarial Networks . Proceedings of the AAAI Conference on Artificial Intelligence, 35 0 (9): 0 7721--7728, May 2021. ISSN 2374-3468. doi:10.1...

    2021 doi

  28. [36]

    Topological Graph Neural Networks

    Max Horn, Edward De Brouwer, Michael Moor, Yves Moreau, Bastian Rieck, and Karsten Borgwardt. Topological Graph Neural Networks . In International Conference on Learning Representations , October 2021

    2021

  29. [37]

    Topology- Preserving Deep Image Segmentation

    Xiaoling Hu, Fuxin Li, Dimitris Samaras, and Chao Chen. Topology- Preserving Deep Image Segmentation . In Advances in Neural Information Processing Systems , volume 32. Curran Associates, Inc., 2019

    2019

  30. [38]

    Rethinking fid: Towards a better evaluation metric for image generation

    Sadeep Jayasumana, Srikumar Ramalingam, Andreas Veit, Daniel Glasner, Ayan Chakrabarti, and Sanjiv Kumar. Rethinking fid: Towards a better evaluation metric for image generation. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp.\ 9307--9...

    2024

  31. [39]

    Revisiting latent space of gan inversion for robust real image editing

    Kai Katsumata, Duc Minh Vo, Bei Liu, and Hideki Nakayama. Revisiting latent space of gan inversion for robust real image editing. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, pp.\ 5313--5322, 2024

    2024

  32. [40]

    Geometry score: A method for comparing generative adversarial networks

    Valentin Khrulkov and Ivan Oseledets. Geometry score: A method for comparing generative adversarial networks. In Jennifer Dy and Andreas Krause (eds.), Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, ...

    2018

  33. [41]

    Persistence weighted Gaussian kernel for topological data analysis

    Genki Kusano, Yasuaki Hiraoka, and Kenji Fukumizu. Persistence weighted Gaussian kernel for topological data analysis. In Maria-Florina Balcan and Kilian Q. Weinberger (eds.), Proceedings of the 33nd International Conference on Machine Learning , volume 48 of JMLR Workshop and...

    2004

  34. [42]

    Pytorch-topological: A topological machine learning framework for pytorch

    AIDOS Lab. Pytorch-topological: A topological machine learning framework for pytorch. https://github.com/aidos-lab/pytorch-topological?tab=readme-ov-file

  35. [43]

    Large scale computation of means and clusters for persistence diagrams using optimal transport

    Th \'e o Lacombe, Marco Cuturi, and Steve Oudot. Large scale computation of means and clusters for persistence diagrams using optimal transport. Advances in Neural Information Processing Systems, 31, 2018

    2018

  36. [44]

    A Framework for Differential Calculus on Persistence Barcodes

    Jacob Leygonie, Steve Oudot, and Ulrike Tillmann. A Framework for Differential Calculus on Persistence Barcodes . Foundations of Computational Mathematics, 22 0 (4): 0 1069--1131, August 2022. ISSN 1615-3383. doi:10.1007/s10208-021-09522-y

    2022 doi

  37. [45]

    Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks

    Tengyuan Liang and James Stokes. Interaction matters: A note on non-asymptotic local convergence of generative adversarial networks. In The 22nd International Conference on Artificial Intelligence and Statistics, pp.\ 907--915. PMLR, 2019

    2019

  38. [46]

    Dual manifold adversarial robustness: Defense against lp and non-lp adversarial attacks

    Wei-An Lin, Chun Pong Lau, Alexander Levine, Rama Chellappa, and Soheil Feizi. Dual manifold adversarial robustness: Defense against lp and non-lp adversarial attacks. Advances in Neural Information Processing Systems, 33: 0 3487--3498, 2020

    2020

  39. [47]

    Deep learning face attributes in the wild

    Ziwei Liu, Ping Luo, Xiaogang Wang, and Xiaoou Tang. Deep learning face attributes in the wild. In Proceedings of the IEEE international conference on computer vision, pp.\ 3730--3738, 2015

    2015

  40. [48]

    Deep transfer learning with joint adaptation networks

    Mingsheng Long, Han Zhu, Jianmin Wang, and Michael I Jordan. Deep transfer learning with joint adaptation networks. In International conference on machine learning, pp.\ 2208--2217. PMLR, 2017

    2017

  41. [49]

    Sgdr: Stochastic gradient descent with warm restarts

    Ilya Loshchilov and Frank Hutter. Sgdr: Stochastic gradient descent with warm restarts. arXiv preprint arXiv:1608.03983, 2016

    2016 arXiv

  42. [50]

    Yuan Luo and Bradley J. Nelson. Accelerating iterated persistent homology computations with warm starts. Computational Geometry, 120: 0 102089, June 2024. ISSN 0925-7721. doi:10.1016/j.comgeo.2024.102089

    2024

  43. [51]

    Adversarial neural pruning with latent vulnerability suppression

    Divyam Madaan, Jinwoo Shin, and Sung Ju Hwang. Adversarial neural pruning with latent vulnerability suppression. In International Conference on Machine Learning, pp.\ 6575--6585. PMLR, 2020

    2020

  44. [52]

    Few-shot cross-domain image generation via inference-time latent-code learning

    Arnab Kumar Mondal, Piyush Tiwary, Parag Singla, and AP Prathosh. Few-shot cross-domain image generation via inference-time latent-code learning. In The Eleventh International Conference on Learning Representations, 2023

    2023

  45. [53]

    Kernel Mean Embedding of Distributions: A Review and Beyond

    Krikamol Muandet, Kenji Fukumizu, Bharath Sriperumbudur, and Bernhard Sch \"o lkopf. Kernel Mean Embedding of Distributions: A Review and Beyond. 2017. doi:10.1561/2200000060

    2017 doi

  46. [54]

    Topological Optimization with Big Steps

    Arnur Nigmetov and Dmitriy Morozov. Topological Optimization with Big Steps . Discrete & Computational Geometry, 72 0 (1): 0 310--344, July 2024. ISSN 1432-0444. doi:10.1007/s00454-023-00613-x

    2024 doi

  47. [55]

    Manifold regularization and semi-supervised learning: Some theoretical analyses

    Partha Niyogi. Manifold regularization and semi-supervised learning: Some theoretical analyses. Journal of Machine Learning Research, 14 0 (5), 2013

    2013

  48. [56]

    Dinov2: Learning robust visual features without supervision

    Maxime Oquab, Timoth \'e e Darcet, Th \'e o Moutakanni, Huy Vo, Marc Szafraniec, Vasil Khalidov, Pierre Fernandez, Daniel Haziza, Francisco Massa, Alaaeldin El-Nouby, et al. Dinov2: Learning robust visual features without supervision. Transactions on Machine Learning Research ...

    2024

  49. [57]

    Porter, Ulrike Tillmann, Peter Grindrod, and Heather A

    Nina Otter, Mason A. Porter, Ulrike Tillmann, Peter Grindrod, and Heather A. Harrington. A roadmap for the computation of persistent homology. EPJ Data Sci., 6 0 (1): 0 1--38, December 2017. ISSN 2193-1127. doi:10.1140/epjds/s13688-017-0109-5

    2017 doi

  50. [58]

    Bronstein, Gunnar E

    Theodore Papamarkou, Tolga Birdal, Michael M. Bronstein, Gunnar E. Carlsson, Justin Curry, Yue Gao, Mustafa Hajij, Roland Kwitt, Pietro Lio, Paolo Di Lorenzo, Vasileios Maroulas, Nina Miolane, Farzana Nasrin, Karthikeyan Natesan Ramamurthy, Bastian Rieck, Simone Scardapane, Mi...

    2024

  51. [59]

    Giotto-ph: A Python Library for High-Performance Computation of Persistent Homology of Vietoris-Rips Filtrations , August 2021

    Juli \'a n Burella P \'e rez, Sydney Hauke, Umberto Lupo, Matteo Caorsi, and Alberto Dassatti. Giotto-ph: A Python Library for High-Performance Computation of Persistent Homology of Vietoris-Rips Filtrations , August 2021

    2021

  52. [60]

    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, et al. Learning transferable visual models from natural language supervision. In International conference on machine learning, pp...

    2021

  53. [61]

    Generalized zero-and few-shot learning via aligned variational autoencoders

    Edgar Schonfeld, Sayna Ebrahimi, Samarth Sinha, Trevor Darrell, and Zeynep Akata. Generalized zero-and few-shot learning via aligned variational autoencoders. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp.\ 8247--8255, 2019

    2019

  54. [62]

    Differentiability and Optimization of Multiparameter Persistent Homology

    Luis Scoccola, Siddharth Setlur, David Loiseaux, Mathieu Carri \`e re, and Steve Oudot. Differentiability and Optimization of Multiparameter Persistent Homology . In Proceedings of the 41st International Conference on Machine Learning , pp.\ 43986--44011. PMLR, July 2024

    2024

  55. [63]

    Paetzold, Anjany Sekuboyina, Ivan Ezhov, Alexander Unger, Andrey Zhylka, Josien P

    Suprosanna Shit, Johannes C. Paetzold, Anjany Sekuboyina, Ivan Ezhov, Alexander Unger, Andrey Zhylka, Josien P. W. Pluim, Ulrich Bauer, and Bjoern H. Menze. clDice - a Novel Topology-Preserving Loss Function for Tubular Structure Segmentation . In 2021 IEEE / CVF Conference on...

    2021

  56. [64]

    Kernel distribution embeddings: Universal kernels, characteristic kernels and kernel metrics on distributions

    Carl-Johann Simon-Gabriel and Bernhard Sch \"o lkopf. Kernel distribution embeddings: Universal kernels, characteristic kernels and kernel metrics on distributions. J. Mach. Learn. Res., 19 0 (44): 0 1--29, 2018. ISSN 1533-7928

    2018

  57. [65]

    Metrizing Weak Convergence with Maximum Mean Discrepancies

    Carl-Johann Simon-Gabriel , Alessandro Barp, Bernhard Sch \"o lkopf, and Lester Mackey. Metrizing Weak Convergence with Maximum Mean Discrepancies . Journal of Machine Learning Research, 24 0 (184): 0 1--20, 2023. ISSN 1533-7928

    2023

  58. [66]

    From geometry to topology: Inverse theorems for distributed persistence

    Elchanan Solomon, Alexander Wagner, and Paul Bendich. From geometry to topology: Inverse theorems for distributed persistence. In Xavier Goaoc and Michael Kerber (eds.), 38th International Symposium on Computational Geometry ( SoCG 2022) , volume 224 of Leibniz International P...

    2022 doi

  59. [67]

    A Fast and Robust Method for Global Topological Functional Optimization

    Yitzchak Solomon, Alexander Wagner, and Paul Bendich. A Fast and Robust Method for Global Topological Functional Optimization . In Proceedings of The 24th International Conference on Artificial Intelligence and Statistics , pp.\ 109--117. PMLR, March 2021

    2021

  60. [68]

    On the optimal estimation of probability measures in weak and strong topologies

    Bharath Sriperumbudur. On the optimal estimation of probability measures in weak and strong topologies. Bernoulli, 22 0 (3): 0 1839--1893, August 2016. ISSN 1350-7265. doi:10.3150/15-BEJ713

    2016 doi

  61. [69]

    Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models

    George Stein, Jesse Cresswell, Rasa Hosseinzadeh, Yi Sui, Brendan Ross, Valentin Villecroze, Zhaoyan Liu, Anthony L Caterini, Eric Taylor, and Gabriel Loaiza-Ganem. Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models. Advances i...

    2024

  62. [70]

    Bernadette J. Stolz. Outlier- Robust Subsampling Techniques for Persistent Homology . Journal of Machine Learning Research, 24 0 (90): 0 1--35, 2023. ISSN 1533-7928

    2023

  63. [71]

    Deep coral: Correlation alignment for deep domain adaptation

    Baochen Sun and Kate Saenko. Deep coral: Correlation alignment for deep domain adaptation. In Computer Vision--ECCV 2016 Workshops: Amsterdam, The Netherlands, October 8-10 and 15-16, 2016, Proceedings, Part III 14, pp.\ 443--450. Springer, 2016

    2016

  64. [72]

    Return of frustratingly easy domain adaptation

    Baochen Sun, Jiashi Feng, and Kate Saenko. Return of frustratingly easy domain adaptation. In Proceedings of the AAAI conference on artificial intelligence, volume 30, 2016

    2016

  65. [73]

    Distributing Persistent Homology via Spectral Sequences

    \'A lvaro Torras-Casas . Distributing Persistent Homology via Spectral Sequences . Discrete & Computational Geometry, 70 0 (3): 0 580--619, October 2023. ISSN 1432-0444. doi:10.1007/s00454-023-00549-2

    2023 doi

  66. [74]

    Semi-supervised seizure prediction with generative adversarial networks

    Nhan Duy Truong, Luping Zhou, and Omid Kavehei. Semi-supervised seizure prediction with generative adversarial networks. In 2019 41st annual international conference of the IEEE engineering in medicine and biology society (EMBC), pp.\ 2369--2372. IEEE, 2019

    2019

  67. [75]

    Optimal Transport : Old and New

    C \'e dric Villani. Optimal Transport : Old and New . Grundlehren Der Mathematischen Wissenschaften . Springer-Verlag, Berlin Heidelberg, 2009. ISBN 978-3-540-71049-3. doi:10.1007/978-3-540-71050-9

    2009 doi

  68. [76]

    Dominik J. E. Waibel, Scott Atwell, Matthias Meier, Carsten Marr, and Bastian Rieck. Capturing Shape Information with Multi-scale Topological Loss Terms for 3D Reconstruction . In Linwei Wang, Qi Dou, P. Thomas Fletcher, Stefanie Speidel, and Shuo Li (eds.), Medical Image Comp...

    2022 doi

  69. [77]

    Sganrda: semi-supervised generative adversarial networks for predicting circrna--disease associations

    Lei Wang, Xin Yan, Zhu-Hong You, Xi Zhou, Hao-Yuan Li, and Yu-An Huang. Sganrda: semi-supervised generative adversarial networks for predicting circrna--disease associations. Briefings in Bioinformatics, 22 0 (5): 0 bbab028, 2021 a

    2021

  70. [78]

    Learning to diversify for single domain generalization

    Zijian Wang, Yadan Luo, Ruihong Qiu, Zi Huang, and Mahsa Baktashmotlagh. Learning to diversify for single domain generalization. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pp.\ 834--843, 2021 b

    2021

  71. [79]

    Stabilizing generative adversarial networks: A survey

    Maciej Wiatrak, Stefano V Albrecht, and Andrew Nystrom. Stabilizing generative adversarial networks: A survey. arXiv preprint arXiv:1910.00927, 2019

    1910 arXiv

  72. [80]

    Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms

    H Xiao. Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747, 2017

    2017 arXiv

  73. [81]

    A multitask latent feature augmentation method for few-shot learning

    Jian Xu, Bo Liu, and Yanshan Xiao. A multitask latent feature augmentation method for few-shot learning. IEEE Transactions on neural networks and learning systems, 2022

    2022

  74. [82]

    Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation

    Ruijia Xu, Guanbin Li, Jihan Yang, and Liang Lin. Larger norm more transferable: An adaptive feature norm approach for unsupervised domain adaptation. In Proceedings of the IEEE/CVF international conference on computer vision, pp.\ 1426--1435, 2019

    2019

  75. [83]

    A survey on deep semi-supervised learning

    Xiangli Yang, Zixing Song, Irwin King, and Zenglin Xu. A survey on deep semi-supervised learning. IEEE Transactions on Knowledge and Data Engineering, 35 0 (9): 0 8934--8954, 2022

    2022

  76. [84]

    Persistence by parts: Multiscale feature detection via distributed persistent homology

    Hee Rhang Yoon and Robert Ghrist. Persistence by parts: Multiscale feature detection via distributed persistent homology. arXiv: 2001.01623, 2020

    2001 arXiv

  77. [85]

    Lsun: Construction of a large-scale image dataset using deep learning with humans in the loop

    Fisher Yu, Ari Seff, Yinda Zhang, Shuran Song, Thomas Funkhouser, and Jianxiong Xiao. Lsun: Construction of a large-scale image dataset using deep learning with humans in the loop. arXiv preprint arXiv:1506.03365, 2015

    2015 arXiv

  78. [86]

    Lafeat: Piercing through adversarial defenses with latent features

    Yunrui Yu, Xitong Gao, and Cheng-Zhong Xu. Lafeat: Piercing through adversarial defenses with latent features. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp.\ 5735--5745, 2021

    2021

  79. [87]

    GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes

    Simon Zhang, Mengbai Xiao, and Hao Wang. GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes . In DROPS-IDN /v2/Document/10.4230/ LIPIcs . SoCG .2020.70 . Schloss Dagstuhl -- Leibniz-Zentrum f \"u r Informatik, 2020. doi:10.4230/LIPIcs.SoCG.2020.70

    2020 doi

  80. [88]

    Learning to generate novel domains for domain generalization

    Kaiyang Zhou, Yongxin Yang, Timothy Hospedales, and Tao Xiang. Learning to generate novel domains for domain generalization. In Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part XVI 16, pp.\ 561--578. Springer, 2020

    2020

  81. [89]

    Ng, Gunnar E

    Sharon Zhou, Eric Zelikman, Fred Lu, Andrew Y. Ng, Gunnar E. Carlsson, and Stefano Ermon. Evaluating the disentanglement of deep generative models through manifold topology. In International Conference on Learning Representations, 2021

    2021

  82. [90]

    Exploring sparse moe in gans for text-conditioned image synthesis

    Jiapeng Zhu, Ceyuan Yang, Kecheng Zheng, Yinghao Xu, Zifan Shi, and Yujun Shen. Exploring sparse moe in gans for text-conditioned image synthesis. arXiv preprint arXiv:2309.03904, 2023

    2023 arXiv

  83. [91]

    @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 ...

  84. [92]

    \@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...

  85. [93]

    @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 10, 2026 · model on record in the stance chip above.