Balancing Symmetry and Efficiency in Graph Flow Matching
arXiv:2602. 18084v2 Announce Type: replace Abstract: Equivariance is central to graph generative models, as it ensures the model respects the permutation symmetry of graphs.
arXiv:2602. 18084v2 Announce Type: replace Abstract: Equivariance is central to graph generative models, as it ensures the model respects the permutation symmetry of graphs.
arXiv:2606. 04108v1 Announce Type: cross Abstract: Single-view 3D generative models have achieved impressive visual quality, yet they are not designed to satisfy structural or functional requirements, and in practice, often fall short.
arXiv:2510. 03511v3 Announce Type: replace-cross Abstract: While widespread, Transformers lack inductive biases for geometric symmetries common in science and computer vision.
Generating high-quality triangle meshes is essential for film, gaming, and interactive 3D applications. Mainstream methods rely on mesh serialization and autoregressive processes, which stuggles in effective inference and is sensitive to error accumulation.
Geometric foundation models, such as the Visual Geometry Grounded Transformer (VGGT), provide strong 3D priors from unposed images. However, such models operate purely in a feed-forward, deterministic regime, \ie~they cannot generate plausible geometry beyond what the input views directly support.
TriFlow introduces a generative method for creating compact 3D meshes with artist‑like triangle topology directly from input geometry such as signed distance fields. It represents mesh topology as a nearest‑vertex vector field (NVF) over the surface, trains a latent flow‑matching model to synthesize this field, and then clusters surface regions to guide a constrained quadric error metric simplification. The resulting meshes closely match the input geometry while exhibiting structured, artist‑like connectivity, achieving 90% lower Chamfer Distance and an 8× speedup over state‑of‑the‑art learning‑based approaches.
arXiv:2602. 10099v2 Announce Type: replace Abstract: Leveraging representation encoders for generative modeling offers a path for efficient, high-fidelity synthesis.
The paper introduces CAT-Flow, a pair of lightweight, training‑free algorithms—CAT‑OV and CAT‑OT—that adapt step‑sizes during Flow Matching inference by estimating curvature in time or state space. These methods avoid extra neural evaluations and achieve constant‑order truncation error bounds. Experiments show that CAT‑OV and CAT‑OT improve image quality metrics across four text‑to‑image Flow Matching models, cutting the required generation steps by up to 40%.
arXiv:2605. 13838v3 Announce Type: replace-cross Abstract: Video-guided 3D animation holds immense potential for content creation, offering intuitive and precise control over dynamic assets.
Optimizing 3D shapes within the latent spaces of deep generative models is fundamental to computer assisted engineering, yet remains prone to a critical failure mode we term manifold drift: the tendency of gradient-based optimization to move latent vectors away from the manifold of valid shapes. This problem is exacerbated in state-of-the-art 3D shape generative models that operate in increasingly high-dimensional latent spaces where valid shapes occupy a vanishingly small fraction of the full space.
arXiv:2608.28853v1 Announce Type: cross Abstract: Equivariant graph neural networks provide a principled way to model geometric systems, but efficient first-order architectures remain limited in how...
arXiv:2501. 09876v3 Announce Type: replace-cross Abstract: Generative modeling aims to generate new data samples that resemble a given dataset.