arXiv (All)
open access
Constrained Flow Matching via Lagrangian Dual Flows
Flow matching is a powerful tool for generative modeling, but emerging applications in robotics, planning, and control require inference-time constraints on generated outputs. Such constraints are often complex and highly nonlinear. As a result, methods designed for linear constraints like image inp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Streamlined Constraint Reasoning via CNN Pattern Recognition on Enumerated Solutions#204836
- Beyond Saying Less: Fine-Grained Alignment for Informative and Faithful Vision-Language Models#1129887
- Flow-JEPA: Flow Matching for Robust Latent Dynamics in JEPA World Models#793253
- Flow-JEPA: Flow Matching for Robust Latent Dynamics in JEPA World Models#789249
- Generative Path-Finding Method for Wasserstein Gradient Flow#10359
Record · ID 1155254
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive