Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.14854 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910954613112832 |
|---|---|
| author | Safta, Cosmin Jones, Reese E. Patel, Ravi G. Wonnacot, Raelynn Bolintineanu, Dan S. Hamel, Craig M. Kramer, Sharlotte L. B. |
| author_facet | Safta, Cosmin Jones, Reese E. Patel, Ravi G. Wonnacot, Raelynn Bolintineanu, Dan S. Hamel, Craig M. Kramer, Sharlotte L. B. |
| contents | We propose a scalable, approximate inference hypernetwork framework for a general model of history-dependent processes. The flexible data model is based on a neural ordinary differential equation (NODE) representing the evolution of internal states together with a trainable observation model subcomponent. The posterior distribution corresponding to the data model parameters (weights and biases) follows a stochastic differential equation with a drift term related to the score of the posterior that is learned jointly with the data model parameters. This Langevin sampling approach offers flexibility in balancing the computational budget between the evaluation cost of the data model and the approximation of the posterior density of its parameters. We demonstrate performance of the ensemble sampling hypernetwork on chemical reaction and material physics data and compare it to standard variational inference. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_14854 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Uncertainty quantification of neural network models of evolving processes via Langevin sampling Safta, Cosmin Jones, Reese E. Patel, Ravi G. Wonnacot, Raelynn Bolintineanu, Dan S. Hamel, Craig M. Kramer, Sharlotte L. B. Machine Learning We propose a scalable, approximate inference hypernetwork framework for a general model of history-dependent processes. The flexible data model is based on a neural ordinary differential equation (NODE) representing the evolution of internal states together with a trainable observation model subcomponent. The posterior distribution corresponding to the data model parameters (weights and biases) follows a stochastic differential equation with a drift term related to the score of the posterior that is learned jointly with the data model parameters. This Langevin sampling approach offers flexibility in balancing the computational budget between the evaluation cost of the data model and the approximation of the posterior density of its parameters. We demonstrate performance of the ensemble sampling hypernetwork on chemical reaction and material physics data and compare it to standard variational inference. |
| title | Uncertainty quantification of neural network models of evolving processes via Langevin sampling |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2504.14854 |