mlsanityData to 14 Oct 2026

Neural Message Passing for Objective-Based Uncertainty Quantification and Optimal Experimental Design

arXiv 2203.07120 ↗First posted 14 Mar 2022cs.LG math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

Various real-world scientific applications involve the mathematical modeling of complex uncertain systems with numerous unknown parameters. Accurate parameter estimation is often practically infeasible in such systems, as the available training data may be insufficient and the cost of acquiring additional data may be high. In such cases, based on a Bayesian paradigm, we can design robust operators retaining the best overall performance across all possible models and design optimal experiments that can effectively reduce uncertainty to enhance the performance of such operators maximally. While objective-based uncertainty quantification (objective-UQ) based on MOCU (mean objective cost of uncertainty) provides an effective means for quantifying uncertainty in complex systems, the high computational cost of estimating MOCU has been a challenge in applying it to real-world scientific/engineering problems. In this work, we propose a novel scheme to reduce the computational cost for objective-UQ via MOCU based on a data-driven approach. We adopt a neural message-passing model for surrogate modeling, incorporating a novel axiomatic constraint loss that penalizes an increase in the estimated system uncertainty. As an illustrative example, we consider the optimal experimental design (OED) problem for uncertain Kuramoto models, where the goal is to predict the experiments that can most effectively enhance robust synchronization performance through uncertainty reduction. We show that our proposed approach can accelerate MOCU-based OED by four to five orders of magnitude, without any visible performance loss compared to the state-of-the-art. The proposed approach applies to general OED tasks, beyond the Kuramoto model.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 46 references that are in the map. First posted on arXiv 14 Mar 2022.

Builds on

18 of 46 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  4. 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
  5. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,304
  6. 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 754
  7. 2020Principal Neighbourhood Aggregation for Graph Netscited by 478
  8. 2017Scene Graph Generation by Iterative Message Passingcited by 462
  9. 2021Do Transformers Really Perform Bad for Graph Representation?cited by 320
  10. 2017Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphscited by 310
  11. 2015Order Matters: Sequence to sequence for setscited by 237
  12. 2021Holistic 3D Scene Understanding from a Single Image with Implicit Representationcited by 94
6 more
  1. 2021An Efficient Federated Distillation Learning System for Multi-task Time Series Classificationcited by 14
  2. 2015Efficient Bayesian experimentation using an expected information gain lower boundcited by 5
  3. 2020Quantifying the multi-objective cost of uncertaintycited by 5
  4. 2020Optimal Experimental Design for Uncertain Systems Based on Coupled Differential Equationscited by 4
  5. 2021Accelerating Optimal Experimental Design for Robust Synchronization of Uncertain Kuramoto Oscillator Model Using Machine Learningcited by 3
  6. 2015Phase synchronization of coupled bursting neurons and the generalized Kuramoto modelcited by 2

Built on by

Not cited yet.