WINO: A Weak-Form Physics Informed Neural Operator for Hyperelasticity on Variable Domains
- URL: http://arxiv.org/abs/2605.24651v1
- Date: Sat, 23 May 2026 16:35:08 GMT
- Title: WINO: A Weak-Form Physics Informed Neural Operator for Hyperelasticity on Variable Domains
- Abstract summary: WINO is a data-free framework that combines the efficiency of neural operators with the geometric flexibility of the $varphi$-FEM method.<n> WINO achieves high accuracy below 0.04 across all benchmarks, while reducing total computational time by 50--80% compared with purely data-driven methods.
- Score: 3.8397427914728426
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a Weak-form Physics-Informed Neural Operator (WINO), a data-free framework that combines the efficiency of neural operators with the geometric flexibility of the $\varphi$-finite element method ($\varphi$-FEM). $\varphi$-FEM is an unfitted method that accommodates geometric variations without body-fitted meshes, where the domain geometry is represented by the level-set function $\varphi$. To impose the boundary conditions, Dirichlet problems adopt the $\varphi$-FEM lifting so only the homogeneous displacement contribution is learned, whereas traction-driven Neumann problems additionally predict the auxiliary fields necessary for the unfitted weak formulation. Parameters are trained by minimizing squared weak-form residuals aligned with $\varphi$-FEM together with squared penalties on the cut-cell auxiliary equations, which removes the need for large paired datasets of converged reference solutions. After training, WINO outputs can seed the nonlinear $\varphi$-FEM solvers as neural operator warm starts (NOWS), which reduce iteration counts relative to traditional cold-started solvers. Numerical benchmarks show that WINO achieves high accuracy below 0.04 across all benchmarks, while reducing total computational time by 50--80\% compared with purely data-driven methods.
Related papers
- Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
arXiv Detail & Related papers (2026-08-25T15:07:11Z) - Born Discrete, Made Smooth: Variational Formulation of Shallow Neural Networks [1.5749416770494706]
We show that a well-posed surrogate control can be used to prove optimal density for a neural network.<n>This allows us to prove optimal density can be obtained by solving a single linear-based system.
arXiv Detail & Related papers (2026-07-02T10:39:14Z) - Wiener Chaos Expansion based Neural Operator for Singular Stochastic Partial Differential Equations [58.188204772101756]
This paper explores how our recently developed Wiener Chaos Expansion (WCE)-based neural operator (NO) can be applied to singular partial differential equations.<n>We leverage feature-wise linear modulation (FiLM) to appropriately capture the dependency between the solution of singular SPDE and its smooth remainder.<n>The resulting WCE-FiLM-NO shows excellent performance on $boldsymbol4$, as measured by relative $L$ loss, out-of-distribution and autocorrelation score.
arXiv Detail & Related papers (2026-03-09T10:50:30Z) - Inferring Cosmological Parameters with Evidential Physics-Informed Neural Networks [0.0]
We use a novel variant of Physics-Informed Neural Networks to predict cosmological parameters from recent supernovae and baryon acoustic oscillations (BAO) datasets.<n>Our machine learning framework generates uncertainty estimates for target variables and the inferred unknown parameters of the underlying PDE descriptions.
arXiv Detail & Related papers (2025-09-29T06:25:53Z) - Universal Fourier Neural Operators for periodic homogenization problems in linear elasticity [0.0]
We advocate Fourier Neural Operators (FNOs) for micromechanics, empowering them by insights from computational micromechanics methods.<n>We construct an FNO surrogate mimicking the basic scheme for FFT-based methods and show that the resulting operator predicts solutions to cell problems with arbitrary stiffness distribution.<n>The obtained neural operator complies with the same memory requirements as the basic scheme and comes with runtimes proportional to classical FFT solvers.
arXiv Detail & Related papers (2025-07-16T13:47:20Z) - Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
arXiv Detail & Related papers (2025-04-17T08:32:25Z) - Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks.
In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
arXiv Detail & Related papers (2024-04-29T15:04:07Z) - Learning Only On Boundaries: a Physics-Informed Neural operator for
Solving Parametric Partial Differential Equations in Complex Geometries [10.250994619846416]
We present a novel physics-informed neural operator method to solve parametrized boundary value problems without labeled data.
Our numerical experiments show the effectiveness of parametrized complex geometries and unbounded problems.
arXiv Detail & Related papers (2023-08-24T17:29:57Z) - Gradient-Free Methods for Deterministic and Stochastic Nonsmooth
Nonconvex Optimization [94.19177623349947]
Non-smooth non optimization problems emerge in machine learning and business making.
Two core challenges impede the development of efficient methods with finitetime convergence guarantee.
Two-phase versions of GFM and SGFM are also proposed and proven to achieve improved large-deviation results.
arXiv Detail & Related papers (2022-09-12T06:53:24Z) - Bounding the Width of Neural Networks via Coupled Initialization -- A
Worst Case Analysis [121.9821494461427]
We show how to significantly reduce the number of neurons required for two-layer ReLU networks.
We also prove new lower bounds that improve upon prior work, and that under certain assumptions, are best possible.
arXiv Detail & Related papers (2022-06-26T06:51:31Z)
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.