Pith. sign in

arXiv preprint arXiv:2410.20587 , year=

7 Pith papers cite this work. Polarity classification is still indexing.

7 Pith papers citing it

citation-role summary

method 1

citation-polarity summary

years

2026 6 2024 1

roles

method 1

polarities

use method 1

representative citing papers

Free energy Estimation on Any State Space

stat.ML · 2026-05-29 · unverdicted · novelty 7.0

Generalizes neural transport methods for free energy estimation to any state space with added algebraic and group-theoretic results on time reversal and h-transforms.

Flexible Flows for Biological Sequence Design

cs.LG · 2026-06-09 · unverdicted · novelty 6.0

Enhances Discrete Flow Matching with domain-specific couplings, latent edit-based rates, latent classifier-free guidance, and temperature scaling to reach SOTA on DNA and peptide sequence tasks.

Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions

cs.LG · 2026-05-09 · unverdicted · novelty 6.0

Discrete flow matching on Z_m^d achieves non-asymptotic KL bounds for early-stopped targets and explicit TV convergence to the true target under an approximation error assumption, with improved scaling in dimension d and vocabulary size m.

Flow Matching Guide and Code

cs.LG · 2024-12-09 · unverdicted · novelty 2.0

Flow Matching is a generative modeling framework with mathematical foundations, design choices, extensions, and open-source PyTorch code for applications like image and text generation.

citing papers explorer

Showing 7 of 7 citing papers.

  • Free energy Estimation on Any State Space stat.ML · 2026-05-29 · unverdicted · none · ref 24

    Generalizes neural transport methods for free energy estimation to any state space with added algebraic and group-theoretic results on time reversal and h-transforms.

  • Perron--Frobenius Operator Matching for Generative Modeling cs.LG · 2026-06-16 · unverdicted · none · ref 18

    PFOM unifies generative models via Perron-Frobenius operator matching and proves KL is the only Bregman divergence equating density-level and sample-conditioned objectives.

  • Flexible Flows for Biological Sequence Design cs.LG · 2026-06-09 · unverdicted · none · ref 45

    Enhances Discrete Flow Matching with domain-specific couplings, latent edit-based rates, latent classifier-free guidance, and temperature scaling to reach SOTA on DNA and peptide sequence tasks.

  • Generative Molecular Morphing for Flexible-Size Design via Unbalanced Optimal Transport cs.LG · 2026-06-05 · unverdicted · none · ref 7

    Morph is a flexible-size 3D molecular generative model using unbalanced optimal transport on geometric graphs that matches fixed-size SOTA performance while enabling out-of-distribution generation.

  • Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions cs.LG · 2026-05-09 · unverdicted · none · ref 3

    Discrete flow matching on Z_m^d achieves non-asymptotic KL bounds for early-stopped targets and explicit TV convergence to the true target under an approximation error assumption, with improved scaling in dimension d and vocabulary size m.

  • Multimodal Crystal Flow: Any-to-Any Modality Generation for Unified Crystal Modeling cs.LG · 2026-02-23 · conditional · none · ref 6

    MCFlow uses decoupled flow time axes for atom types and crystal structures so a single model handles crystal structure prediction, de novo generation, and atom-type generation.

  • Flow Matching Guide and Code cs.LG · 2024-12-09 · unverdicted · none · ref 35

    Flow Matching is a generative modeling framework with mathematical foundations, design choices, extensions, and open-source PyTorch code for applications like image and text generation.