REVIEW 6 cited by
Generator Matching: Generative modeling with arbitrary Markov processes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce Generator Matching, a modality-agnostic framework for generative modeling using arbitrary Markov processes. Generators characterize the infinitesimal evolution of a Markov process, which we leverage for generative modeling in a similar vein to flow matching: we construct conditional generators which generate single data points, then learn to approximate the marginal generator which generates the full data distribution. We show that Generator Matching unifies various generative modeling methods, including diffusion models, flow matching and discrete diffusion models. Furthermore, it expands the design space to new and unexplored Markov processes such as jump processes. Finally, Generator Matching enables the construction of superpositions of Markov generative models and enables the construction of multimodal models in a rigorous manner. We empirically validate our method on image and multimodal generation, e.g. showing that superposition with a jump process improves performance.
Forward citations
Cited by 6 Pith papers
-
Variable-Length Generative Protein Design via Generalized Poisson Flow
Generalized Poisson Flow learns variable protein length via an inhomogeneous Poisson rate plus within-length flow matching, with KL bounds and gains on structure, sequence, motif, and peptide tasks.
-
Multimodal Crystal Flow: Any-to-Any Modality Generation for Unified Crystal Modeling
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.
-
Transition Matching: Scalable and Flexible Generative Modeling
Transition Matching unifies flow matching and continuous autoregressive generation as discrete-time Markov processes, with three variants that improve text-to-image quality and speed.
-
Diffuse Everything: Multimodal Diffusion Models on Arbitrary State Spaces
A unified diffusion framework with per-modality noise clocks lets one model generate images, text, and tabular data jointly or conditionally in their native spaces.
-
Corrector Sampling in Language Models
A training and sampling method that lets autoregressive LLMs resample earlier tokens in a small window, improving reasoning and coding benchmark scores by about 10% relative after a 100B-token fine-tuning.
-
Solving Inverse Problems via Diffusion-Based Priors: An Approximation-Free Ensemble Sampling Approach
A weighted-particle sampler evolves the posterior through the diffusion model's reverse dynamics, with theoretical error bounds and improved image reconstructions.
Discussion (0). Sign in to comment.