Mitigating distribution shift in machine learning-augmented hybrid simulation

• URL: http://arxiv.org/abs/2401.09259v1
• Date: Wed, 17 Jan 2024 15:05:39 GMT
• Title: Mitigating distribution shift in machine learning-augmented hybrid simulation
• Authors: Jiaxi Zhao and Qianxiao Li
• Abstract summary: We study the problem of distribution shift generally arising in machine-learning augmented hybrid simulation. We propose a simple methodology based on tangent-space regularized estimator to control the distribution shift. In all cases, we observe marked improvements in simulation accuracy under the proposed method.
• Score: 15.37429773698171
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of distribution shift generally arising in machine-learning augmented hybrid simulation, where parts of simulation algorithms are replaced by data-driven surrogates. We first establish a mathematical framework to understand the structure of machine-learning augmented hybrid simulation problems, and the cause and effect of the associated distribution shift. We show correlations between distribution shift and simulation error both numerically and theoretically. Then, we propose a simple methodology based on tangent-space regularized estimator to control the distribution shift, thereby improving the long-term accuracy of the simulation results. In the linear dynamics case, we provide a thorough theoretical analysis to quantify the effectiveness of the proposed method. Moreover, we conduct several numerical experiments, including simulating a partially known reaction-diffusion equation and solving Navier-Stokes equations using the projection method with a data-driven pressure solver. In all cases, we observe marked improvements in simulation accuracy under the proposed method, especially for systems with high degrees of distribution shift, such as those with relatively strong non-linear reaction mechanisms, or flows at large Reynolds numbers.

Related papers

• Bayesian Adaptive Calibration and Optimal Design [16.821341360894706]
  Current machine learning approaches mostly rely on rerunning simulations over a fixed set of designs available in the observed data. We propose a data-efficient algorithm to run maximally informative simulations within a batch-sequential process. We show the benefits of our method when compared to related approaches across synthetic and real-data problems.
  arXiv  Detail & Related papers  (2024-05-23T11:14:35Z)
• Diffusion posterior sampling for simulation-based inference in tall data settings [53.17563688225137]
  Simulation-based inference ( SBI) is capable of approximating the posterior distribution that relates input parameters to a given observation. In this work, we consider a tall data extension in which multiple observations are available to better infer the parameters of the model. We compare our method to recently proposed competing approaches on various numerical experiments and demonstrate its superiority in terms of numerical stability and computational cost.
  arXiv  Detail & Related papers  (2024-04-11T09:23:36Z)
• Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers [143.6249073384419]
  In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers. We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art. In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
  arXiv  Detail & Related papers  (2024-01-29T02:08:40Z)
• A Multi-Grained Symmetric Differential Equation Model for Learning Protein-Ligand Binding Dynamics [73.35846234413611]
  In drug discovery, molecular dynamics (MD) simulation provides a powerful tool for predicting binding affinities, estimating transport properties, and exploring pocket sites. We propose NeuralMD, the first machine learning (ML) surrogate that can facilitate numerical MD and provide accurate simulations in protein-ligand binding dynamics. We demonstrate the efficiency and effectiveness of NeuralMD, achieving over 1K$times$ speedup compared to standard numerical MD simulations.
  arXiv  Detail & Related papers  (2024-01-26T09:35:17Z)
• Rethinking materials simulations: Blending direct numerical simulations with neural operators [1.6874375111244329]
  We develop a new method that blends numerical solvers with neural operators to accelerate such simulations. We demonstrate the effectiveness of this framework on simulations of microstructure evolution during physical vapor deposition.
  arXiv  Detail & Related papers  (2023-12-08T23:44:54Z)
• Application of machine learning technique for a fast forecast of aggregation kinetics in space-inhomogeneous systems [0.0]
  We show how to reduce the amount of direct computations with the use of modern machine learning (ML) techniques. We demonstrate that the ML predictions for the space distribution of aggregates and their size distribution requires drastically less computation time and agrees fairly well with the results of direct numerical simulations.
  arXiv  Detail & Related papers  (2023-12-07T19:50:40Z)
• Dynamic Bayesian Learning and Calibration of Spatiotemporal Mechanistic System [0.0]
  We develop an approach for fully learning and calibration of mechanistic models based on noisy observations. We demonstrate this flexibility through solving problems arising in the analysis of ordinary and partial nonlinear differential equations.
  arXiv  Detail & Related papers  (2022-08-12T23:17:46Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Phase-Space Methods for Simulating the Dissipative Many-Body Dynamics of Collective Spin Systems [0.0]
  We describe an efficient numerical method for simulating the dynamics and steady states of collective spin systems in the presence of dephasing and decay. We benchmark this numerical technique for known superradiant decay and spin-squeezing processes and illustrate its application for the simulation of non-equilibrium phase transitions in dissipative spin lattice models.
  arXiv  Detail & Related papers  (2020-11-19T19:00:00Z)
• Combining Differentiable PDE Solvers and Graph Neural Networks for Fluid Flow Prediction [79.81193813215872]
  We develop a hybrid (graph) neural network that combines a traditional graph convolutional network with an embedded differentiable fluid dynamics simulator inside the network itself. We show that we can both generalize well to new situations and benefit from the substantial speedup of neural network CFD predictions.
  arXiv  Detail & Related papers  (2020-07-08T21:23:19Z)

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.