This is an English editorial translation/summary of a Chinese forum post introducing the paper *Expanding Flow Maps* (Sophia Tang, Pranam Chatterjee, arXiv preprint, 2026), covering machine learning, generative models, and flow models.
Key points
- The fixed-canvas curse. Nearly all current generative models—image diffusion models (e.g., Stable Diffusion), video models (e.g., Sora), and LLMs (e.g., GPT-4)—operate on a fixed output size: fixed pixel resolution, fixed frame counts, or fixed context windows. Generating different sizes requires upsampling networks, autoregressive stitching, sliding windows, or retraining. The post opens with a painter metaphor: an artist forced onto a factory-set 2m×1.5m canvas, where minimal works waste space and grand visions get clipped.
- Background: flow models. Flow-based generative models transform a simple distribution (Gaussian noise) into a complex data distribution via a continuous transformation described by an ODE, dz/dt = v(z, t), evolving from t=0 (pure noise) to t=1 (data). Flow Matching learns the vector field v directly, avoiding invertibility constraints of normalizing flows. But all these methods assume a *fixed-size* state space.
- Core idea (EFlows / EFMs). Make the state space itself a learnable, expandable variable. The interpolant runs between distributions of *different* dimensions (from low-dimensional p₀ of dimension d₀ to high-dimensional p₁ of dimension d₁ > d₀), like a universe inflating from a singularity. Expansion is implemented via conditional noise augmentation: new dimensions are generated conditioned on the current state, so they are coordinated with existing content rather than random.
- Two learnable operators. Per the paper: "Each EFM factors the map between any two timesteps into two learnable operations: an expand operator, which augments the state space with new coordinates or tokens conditioned on the current state, and a transport map, which pushes the expanded state forward along the interpolant."
- Fixed models as a special case. Composing these operators yields a single map that jointly expands and denoises the state; when the expand operator is the identity, existing fixed-canvas flows and flow maps are recovered—analogous to Newtonian mechanics as a low-speed limit of relativity.
- Discrete extension. The framework also covers discrete data: graph generation can be viewed as a flow on a discrete simplex, where the model grows node counts as needed (handling variable size, structure, and permutation invariance), and variable-length sequences where text length becomes an emergent property of generation rather than a preset.
- Why it matters (five dimensions).
- *Compute efficiency:* allocate state-space size dynamically instead of provisioning for the maximum size.
- *Creative freedom:* output size shifts from a pre-generation hyperparameter to an emergent, learnable, controllable decision.
- *Multi-scale generation:* plan global structure at low dimension early, expand to fill detail later.
- *Compositional generalization:* the model learns "how to build structure at any scale" rather than a mapping to a specific size.
- *Physics analogy:* like scale-invariant physical laws, each step depends only on the current state, not the final output size.
- Theoretical reflections. The post connects EFMs to intrinsic/manifold dimensionality (generation can proceed on the essential dimension and expand only when needed), an information-theoretic view (new dimensions are conditionally informative: H(new | current state) < H(new)), and diffusion models (EFMs generalize them as "expandable diffusion," degrading to standard flows when expansion is identity).
- Outlook. The vision is a truly unbounded generative model: arbitrary-size images, arbitrary-length text, arbitrary-complexity graphs, arbitrary-duration music—models that also know *when to stop*, treating output size as "a learned, controllable degree of freedom."
References cited in the post
1. Tang, S., & Chatterjee, P. (2026). *Expanding Flow Maps*. arXiv preprint. 2. Lipman, Y., et al. (2022). Flow Matching for Generative Modeling. arXiv:2210.02747. 3. Ho, J., et al. (2020). Denoising Diffusion Probabilistic Models. NeurIPS. 4. Rezende, D., & Mohamed, S. (2015). Variational Inference with Normalizing Flows. ICML. 5. Liu, X., et al. (2022). Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow. arXiv preprint.
*Note: This is a structured summary of a long, essay-style post; the original uses extensive Feynman-style analogies (painter's canvas, universe expansion, jazz improvisation) that are condensed here.*