Continuous Generation and Decision Reinforcement Learning
Studies flow matching and constrained reinforcement learning frontiers across generative and decision-making tasks.
0 sourcesVoices in this topic
All paragraphs
Sep 21, 2026
- Alexander Mattick Mattick’s central caution is that better prediction does not by itself remove the need for search, action selection, or guarantees—the capabilities that turn a predictor into an intelligent decision-maker. A perfect world model of chess still would not tell you how to beat Magnus Carlsen: “There’s a difference between being able to predict the …
- The generative-model stack has moved the expensive work from inference into training: energy-based models leave normalization to MCMC, diffusion amortizes a reversible noising process, and flow matching learns a chosen transport path as supervised regression. Mattick’s economic test is sharper than the usual generative/non-generative taxonomy: “The question is not whether they can do it, it’s …
- Flow matching is useful wherever companies want language-model-like scale in continuous domains such as images, audio, video, and physical trajectories. Language comes with a natural token-by-token factorization; continuous data does not, so diffusion and flows decompose the problem through …
- Constraints are economically valuable prior information, not an embarrassment to be hidden inside a reward function. Mattick rejects the practical version of “reward is enough” because “most information is very, very expensive”; forcing an agent to relearn …
- Explicit constrained reinforcement learning offers clearer engineering interfaces and better composability, although it does not magically guarantee safety. Engineers can state that a load will break a robot or that a district-heating pipe must never burst more naturally than they can tune …