Constraint-Aware Flow Matching: Decision Aligned End-to-End Training for Constrained Sampling

• URL: http://arxiv.org/abs/2605.12754v1
• Date: Tue, 12 May 2026 21:07:13 GMT
• Title: Constraint-Aware Flow Matching: Decision Aligned End-to-End Training for Constrained Sampling
• Abstract summary: Deep generative models provide state-of-the-art performance across a wide array of applications.<n>Existing approaches fail to enforce strict constraint satisfaction while maintaining sample quality.<n>This paper proposes Constraint-Aware Flow Matching, a novel end-to-end framework that explicitly incorporates constraint projections into the training objective.
• Score: 45.70806419699897
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep generative models provide state-of-the-art performance across a wide array of applications, with recent studies showing increasing applicability for science and engineering. Despite a growing corpus of literature focused on the integration of physics-based constraints into the generation process, existing approaches fail to enforce strict constraint satisfaction while maintaining sample quality. In particular, training-free constrained sampling methods, while providing per-sample feasibility guarantees, introduce a fundamental mismatch between the training objective and the constrained sampling procedure, often leading to performance degradation. Identifying this training-sampling misalignment as a central limitation of current constrained generative modeling approaches, this paper proposes Constraint-Aware Flow Matching, a novel end-to-end framework that explicitly incorporates constraint projections into the training objective. By aligning the model's learned dynamics with the constrained sampling process, the proposed method mitigates distributional shift induced by projection-based corrections, enabling high-quality constrained generation. The proposed approach is evaluated on three challenging real-world benchmarks, illustrating the generality and efficacy of the method.

Related papers

• Integration Matters: Rollout-Based Training for Constrained Diffusion Models [16.46255955344152]
  Constrained generative models aim to produce samples that satisfy complex feasibility constraints while remaining faithful to the data distribution.<n>Existing constrained generation methods enforce constraints either through training-time optimization or sampling-time correction.<n>We propose a fine-tuning framework that incorporates constraint guidance obtained through online rollout into the training process.
  arXiv  Detail & Related papers  (2026-07-15T22:25:59Z)
• Constrained Flow Optimization via Sequential Fine Tuning for Molecular Design [31.59334876687123]
  We present a framework for Constrained Generative Optimization (CFO)<n>CFO balances reward and constraint satisfaction by reducing the original problem to sequential fine-tuning.<n>We provide convergence guarantees for constrained generative optimization and constrained generation via CFO.
  arXiv  Detail & Related papers  (2026-05-28T22:02:57Z)
• Non-Parametric Rehearsal Learning via Conditional Mean Embeddings [88.89267783967263]
  We propose a non-parametric rehearsal learning approach for textitavoiding undesired future (AUF) problems.<n>Specifically, we use kernel machinery to reformulate the AUF objective into a unified representation that disentangles desirability modeling from action-induced distributional changes.
  arXiv  Detail & Related papers  (2026-05-09T15:30:52Z)
• Revitalizing the Beginning: Avoiding Storage Dependency for Model Merging in Continual Learning [57.10440766103372]
  Trajectory Regularized Merging (TRM) is a framework that reformulates the merging phase as an optimization process within an augmented trajectory subspace.<n>Our framework integrates three synergistic objectives including task alignment, prediction consistency, and gradient responsiveness to concurrently preserve merged model's historical stability and re-activate optimization dynamics.
  arXiv  Detail & Related papers  (2026-05-08T14:07:32Z)
• Euphonium: Steering Video Flow Matching via Process Reward Gradient Guided Stochastic Dynamics [49.242224984144904]
  We propose Euphonium, a novel framework that steers generation via process reward gradient guided dynamics.<n>Our key insight is to formulate the sampling process as a theoretically principled algorithm that explicitly incorporates the gradient of a Process Reward Model.<n>We derive a distillation objective that internalizes the guidance signal into the flow network, eliminating inference-time dependency on the reward model.
  arXiv  Detail & Related papers  (2026-02-04T08:59:57Z)
• HardFlow: Hard-Constrained Sampling for Flow-Matching Models via Trajectory Optimization [4.249024052507976]
  We introduce a novel framework that reformulates hard-constrained sampling as a trajectory optimization problem.<n>Our key insight is to leverage numerical optimal control to steer the sampling trajectory so that constraints are satisfied precisely at the terminal time.<n>Our algorithm, which we name $textitHardFlow$, substantially outperforms existing methods in both constraint satisfaction and sample quality.
  arXiv  Detail & Related papers  (2025-11-11T16:33:57Z)
• A Model-Based Approach to Imitation Learning through Multi-Step Predictions [8.888213496593556]
  We present a novel model-based imitation learning framework inspired by model predictive control.<n>Our method outperforms traditional behavior cloning numerical benchmarks.<n>We provide theoretical guarantees on the sample complexity and error bounds of our method, offering insights into its convergence properties.
  arXiv  Detail & Related papers  (2025-04-18T02:19:30Z)
• Gradient-Free Generation for Hard-Constrained Systems [41.558608119074755]
  Existing constrained generative models rely heavily on gradient information, which is often sparse or computationally expensive in some fields.<n>We introduce a novel framework for adapting pre-trained, unconstrained flow-matching models to satisfy constraints exactly in a zero-shot manner.
  arXiv  Detail & Related papers  (2024-12-02T18:36:26Z)
• Attribute Controlled Fine-tuning for Large Language Models: A Case Study on Detoxification [76.14641982122696]
  We propose a constraint learning schema for fine-tuning Large Language Models (LLMs) with attribute control. We show that our approach leads to an LLM that produces fewer inappropriate responses while achieving competitive performance on benchmarks and a toxicity detection task.
  arXiv  Detail & Related papers  (2024-10-07T23:38:58Z)
• Efficient Text-driven Motion Generation via Latent Consistency Training [21.348658259929053]
  We propose a motion latent consistency training framework (MLCT) to solve nonlinear reverse diffusion trajectories.<n>By combining these enhancements, we achieve stable and consistency training in non-pixel modality and latent representation spaces.
  arXiv  Detail & Related papers  (2024-05-05T02:11:57Z)
• Constrained Synthesis with Projected Diffusion Models [47.56192362295252]
  This paper introduces an approach to generative diffusion processes the ability to satisfy and certify compliance with constraints and physical principles. The proposed method recast the traditional process of generative diffusion as a constrained distribution problem to ensure adherence to constraints.
  arXiv  Detail & Related papers  (2024-02-05T22:18:16Z)
• Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
  We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model. A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations. We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
  arXiv  Detail & Related papers  (2022-06-08T04:09:13Z)
• Predictive machine learning for prescriptive applications: a coupled training-validating approach [77.34726150561087]
  We propose a new method for training predictive machine learning models for prescriptive applications. This approach is based on tweaking the validation step in the standard training-validating-testing scheme. Several experiments with synthetic data demonstrate promising results in reducing the prescription costs in both deterministic and real models.
  arXiv  Detail & Related papers  (2021-10-22T15:03:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.