arXiv:2602. 03082v2 Announce Type: replace Abstract: A growing number of neural architectures have been proposed to enforce geometric constraints, including projection-based networks, exponential-map updates, constrained output layers, and manifold neural ODEs.
arXiv:2410.23667v2 Announce Type: replace Abstract: Neural differential equations offer a powerful approach for learning dynamical systems from data. However, they do not inherently respect known con...
arXiv:2603.13496v2 Announce Type: replace Abstract: Constructing reduced-order models (ROMs) capable of efficiently predicting the evolution of parameter-dependent high-dimensional dynamical systems...
The paper examines how boundary representation (B‑rep) encoders for CAD models fail to handle variations that do not change the underlying solid, such as different modeling operations or software export settings. By demonstrating that existing encoders collapse under these perturbations, the authors introduce the canonical region graph, a representation derived directly from the solid that is theoretically invariant to repartitioning and rigid motions. This new input format matches the best baseline on standard benchmarks and remains stable across all tested perturbations.
Boundary representation (B‑rep) is the standard format for parametric 3D models in CAD systems, yet the same solid can be encoded by different B‑reps due to varying operations, kernel rebuilds, or export settings. Existing B‑rep encoders fail to handle these variations, collapsing on standard benchmarks and real‑world perturbations. The authors introduce the canonical region graph, an input representation derived directly from the solid, which offers theoretical invariance to repartitioning and rigid motions and performs as well as the best baseline while remaining stable across all tested perturbations.
arXiv:2606. 05247v1 Announce Type: new Abstract: Enforcing nonlinear inequality constraints in neural networks remains challenging, especially when the output is subject to many coupled constraints.
arXiv:2606. 11650v1 Announce Type: new Abstract: Recent advances in scientific machine learning provide a means of near-real-time solution to partial differential equations (PDEs), but lack the theoretical underpinnings of conventional simulators that support contemporary verification and validation.
arXiv:2603. 12676v3 Announce Type: replace Abstract: Generalizing neural surrogate models across different PDE parameters remains difficult because changes in PDE coefficients often make learning harder and optimization less stable.
arXiv:2602. 02788v2 Announce Type: replace-cross Abstract: We aim to develop physics foundation models for science and engineering that provide real-time solutions to Partial Differential Equations (PDEs) which preserve structure and accuracy under adaptation to unseen geometries.
arXiv:2410. 10137v5 Announce Type: replace Abstract: We develop Riemannian approaches to variational autoencoders (VAEs) for PDE-type ambient data with regularizing geometric latent dynamics, which we refer to as VAE-DLM, or VAEs with dynamical latent manifolds.
arXiv:2609.40287v1 Announce Type: new Abstract: Physics-constrained generative models aim to generate physical fields that match a target distribution and satisfy prescribed constraints. However, enf...
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:2605. 25001v2 Announce Type: replace Abstract: While Physics-Informed Neural Networks (PINNs) are powerful for solving Partial Differential Equations (PDEs), their training is often paralyzed by gradient pathology.