SNAP-FM: Sparse Nonlinear Accelerated Projection for Physics-Constrained Generative Modeling

• URL: http://arxiv.org/abs/2607.00095v1
• Date: Tue, 30 Jun 2026 19:35:09 GMT
• Title: SNAP-FM: Sparse Nonlinear Accelerated Projection for Physics-Constrained Generative Modeling
• Abstract summary: Constrained sampling closes this gap, enforcing constraints exactly at inference time without retraining.<n>Standard ML frameworks obscure the structure that physical constraints induce naturally.<n>We exploit this bottleneck by exploiting the structure that sample-wise and local PDE couplings induce in the projection subproblems.
• Score: 3.2297343473068882
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Generative models have emerged as scalable surrogates for physical simulation, yet they offer no guarantee that their outputs respect the conservation laws, boundary conditions, and nonlinear invariants that govern the underlying physics. Constrained sampling closes this gap, enforcing such constraints exactly at inference time without retraining, but at a computational cost: projection, correction, and trajectory-optimization steps are repeated during sampling, with these steps becoming expensive for nonlinear constraints. Standard ML frameworks exacerbate this: their dense tensor algebra and limited sparse solver composability obscure the structure that physical constraints naturally induce, making efficient batched nonlinear optimization difficult to realize in practice. We address this bottleneck by exploiting the structure that sample-wise batching and local PDE couplings induce in the projection subproblems -- namely, block-sparse Jacobian and KKT systems -- exposing this structure using ExaModels.jl and solving the resulting sparse nonlinear programs with MadNLP.jl and GPU sparse factorization. Applied to Physics-Constrained Flow Matching (PCFM), on PDE benchmarks with linear, nonlinear, one-dimensional, and two-dimensional constraints, this approach accelerates nonlinear constraint projection while maintaining constraint satisfaction. These results show that sparse GPU nonlinear optimization is a practical foundation for constrained generative sampling in scientific machine learning.

Related papers

• Physics-Informed Stochastic Configuration Machine: A Backpropagation-Free Neural Network with Fast Training for Nonlinear Differential Equations [7.927063711454594]
  Physics-In Networks (SCNs) have emerged as a transformative paradigm for solving complex differential equations.<n>Our work provides a highly efficient and scalable foundation for next-generation, real-time Scientific Machine applications.
  arXiv  Detail & Related papers  (2026-08-27T02:40:11Z)
• Constrained Flow Matching via Lagrangian Dual Flows [47.76010089014289]
  We introduce Lagrangian Dual Flows, a new family of constrained generation techniques based on Lagrangian dual dynamics.<n>By simply flowing a dual co-state alongside generated samples, we can guarantee nonlinear constraint satisfaction without expensive optimization subproblems.<n>The resulting constrained generation algorithms are simple, effective, and open new theoretical connections between flow matching and primal-dual methods in numerical optimization.
  arXiv  Detail & Related papers  (2026-07-05T21:25:51Z)
• GPU-Parallel Linearization Error Bounds for Real-Time Robust Optimal Control of Nonlinear and Neural Network Dynamics [3.9198548406564595]
  This paper studies real-time robust optimal control for uncertain nonlinear systems, where linear time-varying (LTV) approximations make planning tractable but require sound linearization error bounds (LEBs) to guarantee robust constraint satisfaction.<n>We develop tight, differentiable, GPU-parallel LEBs for LTV approximations of nonlinear and neural network (NN) dynamics.<n>Our method can compute robust control policies on the GPU at rates up to 67 Hz, reducing solve times and conservativeness relative to baselines while preserving formal guarantees and real-time performance.
  arXiv  Detail & Related papers  (2026-07-01T17:42:37Z)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• Mode-Shape Expansion Using Physics-Constrained Gaussian Process Regression [0.0]
  This paper addresses the challenge of reconstructing full-field structural mode shapes from sparse sensor data.<n>The proposed method overcomes existing limitations in GP-based prediction, providing more accurate and reliable expanded mode shapes.
  arXiv  Detail & Related papers  (2026-05-21T23:33:59Z)
• Online Inference of Constrained Optimization: Primal-Dual Optimality and Sequential Quadratic Programming [55.848340925419286]
  We study online statistical inference for the solutions of quadratic optimization problems with equality and inequality constraints.<n>We develop a sequential programming (SSQP) method to solve these problems, where the step direction is computed by sequentially performing an approximation of the objective and a linear approximation of the constraints.<n>We show that our method global almost moving-average convergence and exhibits local normality with an optimal primal-dual limiting matrix in the sense of Hjek and Le Cam.
  arXiv  Detail & Related papers  (2025-11-27T06:16:17Z)
• Enforcing governing equation constraints in neural PDE solvers via training-free projections [5.539946449743145]
  We evaluate two training-free, post hoc projections of approximate solutions using Jacobian-vector and vector-Jacobian products.<n>We find that both projections substantially reduce violations and improve accuracy over physics-informed baselines.
  arXiv  Detail & Related papers  (2025-11-21T14:03:28Z)
• Physics-Constrained Flow Matching: Sampling Generative Models with Hard Constraints [0.6990493129893112]
  Deep generative models have recently been applied to physical systems governed by partial differential equations (PDEs)<n>Existing methods often rely on soft penalties or architectural biases that fail to guarantee hard constraints.<n>We propose Physics-Constrained Flow Matching, a zero-shot inference framework that enforces arbitrary nonlinear constraints in pretrained flow-based generative models.
  arXiv  Detail & Related papers  (2025-06-04T17:12:37Z)
• Controlled Learning of Pointwise Nonlinearities in Neural-Network-Like Architectures [14.93489065234423]
  We present a general variational framework for the training of freeform nonlinearities in layered computational architectures.<n>The slope constraints allow us to impose properties such as 1-Lipschitz stability, firm non-expansiveness, and monotonicity/invertibility.<n>We show how to solve the numerically function-optimization problem by representing the nonlinearities in a suitable (nonuniform) B-spline basis.
  arXiv  Detail & Related papers  (2024-08-23T14:39:27Z)
• 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)
• The Convex Landscape of Neural Networks: Characterizing Global Optima and Stationary Points via Lasso Models [75.33431791218302]
  Deep Neural Network Network (DNN) models are used for programming purposes. In this paper we examine the use of convex neural recovery models. We show that all the stationary non-dimensional objective objective can be characterized as the standard a global subsampled convex solvers program. We also show that all the stationary non-dimensional objective objective can be characterized as the standard a global subsampled convex solvers program.
  arXiv  Detail & Related papers  (2023-12-19T23:04:56Z)
• Constrained Optimization via Exact Augmented Lagrangian and Randomized Iterative Sketching [55.28394191394675]
  We develop an adaptive inexact Newton method for equality-constrained nonlinear, nonIBS optimization problems. We demonstrate the superior performance of our method on benchmark nonlinear problems, constrained logistic regression with data from LVM, and a PDE-constrained problem.
  arXiv  Detail & Related papers  (2023-05-28T06:33:37Z)
• Stochastic Nonlinear Control via Finite-dimensional Spectral Dynamic Embedding [20.43835169613882]
  This paper proposes an approach, Spectral Dynamics Embedding Control (SDEC), to optimal control for nonlinear systems.<n>It reveals an infinite-dimensional feature representation induced by the system's nonlinear dynamics, enabling a linear representation of the state-action value function.<n>For practical implementation, this representation is approximated using finite-dimensional truncations.
  arXiv  Detail & Related papers  (2023-04-08T04:23:46Z)
• LQF: Linear Quadratic Fine-Tuning [114.3840147070712]
  We present the first method for linearizing a pre-trained model that achieves comparable performance to non-linear fine-tuning. LQF consists of simple modifications to the architecture, loss function and optimization typically used for classification.
  arXiv  Detail & Related papers  (2020-12-21T06:40: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.