Generator Matching: Generative modeling with arbitrary Markov processes

Peter Holderrieth, Marton Havasi, Jason Yim, Neta Shaul, Itai Gat +4 more
2/12/2026

No confident code implementation found for this paper. 2 possible matches can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Data Petri Nets meet Probabilistic Programming (Extended version)

71% match2024

MAO: A Framework for Process Model Generation with Multi-Agent Orchestration

71% match2024

A Framework for Processing Textual Descriptions of Business Processes using a Constrained Language -- Technical Report

70% match2025

INEXA: Interactive and Explainable Process Model Abstraction Through Object-Centric Process Mining

70% match2024

LoRA3D: Low-Rank Self-Calibration of 3D Geometric Foundation models

69% match2026

Process Mining Embeddings: Learning Vector Representations for Petri Nets

68% match1 repo62024

Cite this paper

@article{holderrieth2026generator,
  title  = {Generator Matching: Generative modeling with arbitrary Markov processes},
  author = {Peter Holderrieth and Marton Havasi and Jason Yim and Neta Shaul and Itai Gat and T. Jaakkola and Brian Karrer and Ricky T. Q. Chen and Y. Lipman},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:3004126c669501c6a1e426fd21f6bb9921390a97},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/3004126c669501c6a1e426fd21f6bb9921390a97.svg)](https://codeofpaper.com/paper/3004126c669501c6a1e426fd21f6bb9921390a97)

Discussion