Efficient Flow Matching using Latent Variables
arXiv:2505. 04486v4 Announce Type: replace-cross Abstract: Flow matching models have shown great potential in image generation tasks among probabilistic generative models.
arXiv:2505. 04486v4 Announce Type: replace-cross Abstract: Flow matching models have shown great potential in image generation tasks among probabilistic generative models.
arXiv:2509. 02971v2 Announce Type: replace-cross Abstract: Flow-based generative models can face numerical challenges on scientific data with multiscale Fourier spectra, often producing large errors at fine scales.
arXiv:2605. 00941v4 Announce Type: replace Abstract: Flow matching has become a leading framework for generative modeling, but quantifying the uncertainty of its samples remains an open problem.
The paper introduces Contrastive Noise Alignment (CNA), a training-time method for generative flow models that dynamically aligns Gaussian noise with data samples using a cross-modal InfoNCE objective. By modeling noise as an interacting particle system and regularizing with angular entropy and radial norm penalties, CNA reduces arbitrary data-noise couplings and flow curvature. Empirical results show that CNA improves generation quality, lowering FID by over 50% for few-step pixel-space generation compared to standard rectified flow and outperforming optimal transport baselines by at least 24%.
SeamFlow is a new generative framework for 3D surface cutting and UV unwrapping that reformulates the discrete mesh‑cutting problem as continuous flow matching in a high‑dimensional edge‑probability space. By learning a deterministic mapping from a Gaussian prior to a target seam‑probability distribution and using an evolution network to couple local topological tokens with global shape priors, SeamFlow guides smooth probability flow through ODE solving. Compared with existing autoregressive generative methods, SeamFlow improves topology awareness, eliminates 3D spatial projection errors and artificial sequential‑order bias, and achieves exceptional semantic coherence with remarkably low parameterization distortion.
arXiv:2609.15193v1 Announce Type: new Abstract: Drifting models offer a promising route to faster generative AI: they perform gradual transport during training, while generating new samples in a sing...
arXiv:2606. 10023v1 Announce Type: cross Abstract: Accurate posterior estimation is central to scientific inference, as uncertainties determine what can be reliably learned from observational data.
arXiv:2608. 16546v1 Announce Type: cross Abstract: Most super-resolution models learn from paired data by supervising only the final high-resolution output.
The paper introduces a supervised, scale‑shared neural architecture for two‑dimensional site percolation, implementing a neural renormalization group flow. The model recursively applies a learned coarse‑graining rule across scales, producing a latent field that predicts crossing probability and a fine‑graining decoder that reconstructs the largest‑cluster mask. Trained only on small lattices, it extrapolates to larger systems, accurately recovers the spanning cluster, and yields observables that follow expected finite‑size scaling near the critical point, highlighting the importance of critical fluctuations in the latent representation.
The paper presents a supervised, scale‑shared neural architecture that learns a coarse‑graining rule for two‑dimensional site percolation. By recursively applying this rule, the model generates a latent field from which the crossing probability is predicted and a fine‑graining decoder reconstructs the largest‑cluster mask. Trained only on small lattices, the network extrapolates to larger systems, accurately recovers the spanning cluster, and reproduces finite‑size scaling near the critical point, demonstrating that the latent representation captures critical fluctuations and scale‑dependent flows consistent with renormalization‑group theory.
The paper introduces NS‑Flows, a flow‑based nested sampling method that replaces Markov‑chain updates with a conditional normalizing flow trained on live sets. By applying this technique to a Lennard‑Jones particle system, the authors achieve over two orders of magnitude fewer energy evaluations and a roughly one‑third reduction in wall‑clock time compared to traditional nested sampling. The study also shows that the flow’s generation efficiency varies non‑monotonically along the annealing trajectory, providing a diagnostic of the system’s internal mode complexity and identifying liquid‑like ensembles as the most challenging for current flow architectures.
arXiv:2608.23173v1 Announce Type: new Abstract: Computer vision applications for 3D scene understanding in underwater environments remain challenging due to the lack of high-quality 3D data and the i...