Metraipolis › archive › dc_ff2041e44b0f

Universal neural network approximation of symmetric polyconvex energies and envelopes — arXiv:2610.32598

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.32598
License (as archived)
CC0-1.0
Archived
2026-10-26T20:14:40.501Z
SHA-256 of the archived text
a041ac3c2e7fc89dd5874c4c63778549f6b5cf4132457b34fcd50a609bd8fb8f
Stable URL of this page
https://metraipolis.com/documento/dc_ff2041e44b0f

How to cite

Universal neural network approximation of symmetric polyconvex energies and envelopes — arXiv:2610.32598 — arXiv (en), https://arxiv.org/abs/2610.32598 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ff2041e44b0f (Metraipolis archive dc_ff2041e44b0f, sha256 a041ac3c2e7fc89dd5874c4c63778549f6b5cf4132457b34fcd50a609bd8fb8f)
BibTeX
@misc{dcff2041e44b0f,
  title = {Universal neural network approximation of symmetric polyconvex energies and envelopes — arXiv:2610.32598},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.32598},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ff2041e44b0f; sha256 a041ac3c2e7fc89dd5874c4c63778549f6b5cf4132457b34fcd50a609bd8fb8f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.32598. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Symmetric polyconvexity provides a sufficient condition for weak lower semicontinuity in small-strain elasticity and a tractable lower bound for the relaxation of non-(quasi)convex energies. Since classical algorithms for computing such functions can be computationally expensive, neural network approximations have recently emerged as an alternative. A central difficulty with establishing such neural network based approaches for symmetric polyconvexity is the additional monotonicity property. As we show, the corresponding weight restrictions on ReLU-based input-convex networks do not yield universal approximation of the lifted representers. Here, we introduce symmetric polyconvex neural networks (SPCNNs) for constitutive modeling and approximation of symmetric polyconvex envelopes. The deep architecture combines convexity with the monotonicity required of a representer in the space of minors. We prove a universal approximation theorem for symmetric polyconvex energies, without requiring isotropy, and quantify the number of affine pieces attainable by the lifted network and derive reduced architectures for isotropic energies. Numerical examples illustrate stress-based regression and approximation of the symmetric polyconvex envelope of a double-well potential. Symmetric polyconvexity is guaranteed by construction, while the accuracy of the fitted energies and envelopes is assessed numerically.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA) ; Computational Engineering, Finance, and Science (cs.CE); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.32598 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-26T19:49:03.495Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).