LayoutFlow: Flow Matching for Layout Generation

Julian Jorge Andrade Guerreiro, Naoto Inoue, Kento Masui, Mayu Otani, Hideki Nakayama
2/14/2026

No official code found. Best implementation: JulianGuerreiro/LayoutFlow (40 stars, MIT, last commit 2025-09-29).

Abstract

Finding a suitable layout represents a crucial task for diverse applications in graphic design. Motivated by simpler and smoother sampling trajectories, we explore the use of Flow Matching as an alternative to current diffusion-based layout generation models. Specifically, we propose LayoutFlow, an efficient flow-based model capable of generating high-quality layouts. Instead of progressively denoising the elements of a noisy layout, our method learns to gradually move, or flow, the elements of an initial sample until it reaches its final prediction. In addition, we employ a conditioning scheme that allows us to handle various generation tasks with varying degrees of conditioning with a single model. Empirically, LayoutFlow performs on par with state-of-the-art models while being significantly faster.

View on arXivView PDF

Code Implementations(1)

MIT

LayoutFlow: Flow Matching for Layout Generation [Andrade Guerreiro et al., ECCV 2024]

405Shell, PythonJul 12, 20241 years agoMIT

Similar Papers

Cite this paper

@article{guerreiro2026layoutflow,
  title  = {LayoutFlow: Flow Matching for Layout Generation},
  author = {Julian Jorge Andrade Guerreiro and Naoto Inoue and Kento Masui and Mayu Otani and Hideki Nakayama},
  year   = {2026},
  eprint = {2403.18187},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2403.18187},
  journal = {ECCV 2024 2024}
}

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/2403.18187.svg)](https://codeofpaper.com/paper/2403.18187)

Discussion