Method trains emulators to estimate posterior probabilities safely.
problem Uncertainty in slow forward model calculations.
method Trains emulators while estimating posterior probabilities with MCMC, propagating error.
result Demonstrates robust posterior inference for ΛCDM cosmology model. New method learns chaotic dynamics from single noisy trajectory.
problem Chaos in complex systems is hard to model accurately with machine learning.
method Adversarial optimal transport objectives to learn summary statistics and emulator from single noisy data.
result Emulators trained with proposed objectives have significantly improved long-term statistical fidelity.
Bayesian emulator tackles models with discontinuities efficiently.
problem Uncertainty quantification of models with multiple discontinuities.
method TENSE framework, designed correlation structures, single emulator object.
result Efficient emulation of complex models with multiple discontinuities.
Statistical emulators speed up longevity risk contract valuation.
problem Valuation of mortality-linked contracts in complex stochastic models.
method Use of machine learning to create a flexible non-parametric surrogate for stochastic processes.
result Performance guarantees and removal of nested simulation need.
E&E uses contrastive learning to speed up SBI for high-dimensional systems.
problem Challenges in training high-dimensional emulators for complex systems.
method Contrastive learning for low-dimensional latent embedding and fast emulator.
result Superior performance in non-identifiable parameter estimation tasks.
New method validates approximate likelihood and emulator models for expensive simulations.
problem Validation of approximate likelihood and emulator models for computationally intensive simulations.
method Statistical framework using two-sample and global goodness-of-fit tests.
result Can distinguish misspecified models and identify inadequate regions.
FaIRGP model improves climate emulation with physical interpretability.
problem Lack of physical interpretability in data-driven emulators.
method Bayesian approach to a data-driven emulator of energy balance equations.
result Demonstrates skillful emulation of global and spatial surface temperatures.
New emulator bridges simulators using conditional optimal transport.
problem Bridging simulators with minimal distortion.
method Flow-based approach to learn likelihood transport, COT-FM for optimal matching.
result Emulator accurately captures full correction between simulators.
Bayesian approach for learning spatiotemporal systems from noisy data.
problem Efficiently modeling and learning from spatiotemporal dynamical systems with noisy data.
method Hierarchical state-space models with Gaussian process regression for efficient interpolation and training.
result Efficient modeling and learning of spatiotemporal dynamics using Bayesian methods.
New method speeds up analysis of computer experiments.
problem Computational infeasibility of direct GP inference for large datasets.
method Adapted Vecchia's ordered conditional approximation to scaled input space.
result Significant performance improvement over existing methods.
Unified algorithm for solving stochastic storage problems using statistical learning.
problem Solving stochastic storage problems through regression Monte Carlo methods.
method Developed the dynamic emulation algorithm (DEA) that unifies different approaches.
result Illustrated the DEA template with examples from natural gas storage and microgrid control.
This work speeds up DFT simulations using approximate Gaussian processes.
problem Slow DFT simulations due to large data sets.
method Approximate Gaussian processes (sparse variational GP, stochastic variational GP, deep kernel learned GP) to speed up DFT model predictions.
result Calibrated DFT models can predict properties of experimentally unobserved nuclides.
A new emulator connects observables directly from data.
problem Constructing fast and accurate surrogate models for robust predictions.
method Introduces Multiparameter Eigenvalue Problem (MEP) emulator trained with Eigenvector Continuation (EC) and Parametric Matrix Model (PMM) data.
result The MEP emulator can make predictions directly from observables to observables.
New ABC method uses neural emulators for inference in complex models.
problem Approximate Bayesian Computation (ABC) for models without tractable likelihoods.
method Probabilistic neural emulator networks to learn synthetic likelihoods, adaptive simulations.
result Accurate and efficient inference on high-dimensional problems.
Study compares 29 emulators across 60 test functions and 40 datasets.
problem Comparing the strengths and weaknesses of different emulators.
method Large-scale, fully reproducible comparison using R package duqling.
result Detailed empirical insights into emulator strengths and weaknesses.
A new method uses variational autoencoders to speed up greenhouse gas sensitivity calculations.
problem Computational inefficiency in generating LPDM sensitivities from gas mole fraction observations.
method Developed a convolutional variational autoencoder (CVAE) to emulate LPDM sensitivities in a low-dimensional space.
result The CVAE-based emulator outperforms traditional methods and can be applied to various LPDMs.
Generative adversarial networks improve stochastic input parametrization in subsurface flow simulations.
problem Effective parametrization of high-dimensional, correlated stochastic inputs in subsurface flow simulations.
method Training a generative adversarial network to emulate the data generating process of stochastic inputs.
result Generative adversarial networks preserve both visual realism and high-order statistics of flow responses, achieving a significant dimensionality reduction.
Thermalizer stabilizes autoregressive models for long-term predictions in chaotic systems.
problem Long-term predictions in chaotic spatiotemporal systems are unreliable due to trajectory divergence.
method Diffusion models are used to implicitly estimate the score of an invariant measure, which stabilizes autoregressive emulators by applying denoising during inference.
result Thermalization extends the time horizon of stable predictions by an order of magnitude in chaotic systems.
Physics-constrained GANs generate samples that meet deterministic constraints.
problem Ensuring GAN-generated samples comply with physical constraints.
method Enforce deterministic constraints via modified loss function.
result Physics-constrained GANs produce samples that accurately meet underlying constraints.
Framework for Bayesian inference using GP emulated MH sampler for noisy likelihoods.
problem Approximate Bayesian inference with limited noisy log-likelihood evaluations.
method Gaussian process emulates MH sampler for log-likelihood evaluations; sequential experimental design selects evaluation points.
result Approximate sampler is sample-efficient and robust to GP assumptions.
Neural-network emulators predict sea-level changes due to Antarctic ice melt.
problem High computational cost and time in projecting sea-level changes.
method Built neural-network emulators of sea-level change using GRD effects from future Antarctic Ice Sheet mass change.
result Neural-network emulators are as accurate as baseline machine learning emulators and offer substantial computational efficiency.
COCA accelerates N-body simulations by correcting ML errors.
problem Computational expense and limited trustworthiness of ML emulations.
method Hybrid framework combining ML and N-body simulator in an emulated frame of reference. result COCA reduces emulation errors with fewer force evaluations.
Bayesian calibration improves ABMs for predicting travel patterns.
problem Calibrating ABMs for accurate travel pattern predictions.
method Gaussian Process emulator with deep learning dimensionality reduction for high-dimensional, non-stationary data.
result Improved accuracy in predicting travel patterns using traffic flow data.
Generative models emulate climate model outputs for impact assessment.
problem Outdated climate model projections hinder adaptation and mitigation planning.
method Score-based diffusion on a spherical mesh, trained on monthly ESM fields.
result Generative models produce distributions closely matching ESM outputs.
Machine learning models emulate and approximate complex mappings in model physics.
problem Developing and ensuring accurate physical parameterizations.
method Machine learning tools to emulate and approximate mappings.
result ML can improve parameterizations and enforce physical constraints.
Fast emulators built with neural search accelerate expensive scientific simulations.
problem Slow execution of accurate simulations limits scientific discovery.
method Neural architecture search to build accurate emulators with limited data.
result Simulations accelerated by up to 2 billion times in various scientific fields.
New framework bridges climate science and ML for easier climate model emulation.
problem High computational costs and mistrust of ML methods in climate models.
method Integrating climate science and machine learning perspectives to design easy-to-adopt emulators.
result Demonstrated reliability of emulators designed to address specific tasks.
New method integrates computer models from different disciplines with better predictive performance.
problem Integration of multi-disciplinary computer models with distinct complexities and computation times.
method Developed a linked deep Gaussian process (DGP) method that integrates individual Gaussian process emulators in a network.
result Linked deep Gaussian process emulators outperform standard LGP emulators and single DGPs fitted to the network as a whole.
RADIS uses deep regression to create efficient importance sampling for model inversion and emulation.
problem Efficiently sampling from posterior distributions for model inversion and emulation.
method RADIS uses a deep architecture of nested importance sampling schemes to construct a non-parametric emulator that mimics the posterior distribution.
result RADIS asymptotically converges to an exact sampler under mild conditions and can be used as a surrogate model.
This paper approximates Gaussian process emulators with constraints and noisy data.
problem Realistic stochastic emulators with inequality constraints and noisy observations.
method Monte Carlo and Markov Chain Monte Carlo methods with noise term.
result Improved performance of MC and MCMC samplers with noisy observations and constraints.
Gaussian processes emulate complex non-linear models efficiently.
problem Efficiently simulate and analyze highly non-linear, time-evolving systems.
method Gaussian process emulators to approximate model output, considering input uncertainty and time series correlation.
result High predictive performance and uncertainty measures for Lorenz and Van der Pol equations.
Improved GAN for chaotic systems reduces training time and captures statistics.
problem Training GANs for chaotic dynamical systems is challenging and often fails to capture true statistics.
method Statistical constraints enforced in GANs to improve model fidelity and reduce training time.
result Statistical regularization leads to better performance in capturing physical properties and significantly reduced training time.
A new method for training deep Gaussian processes using stochastic imputation.
problem Efficiently training deep Gaussian processes with varying regimes or sharp changes.
method Stochastic imputation to transform DGPs into linked GPs for efficient training.
result The method produces fast and analytically tractable predictions from DGP emulators.
A GPU-based workflow for building physics emulators of hypersonic flows
problem Resolving complex physical phenomena in hypersonic flows
method Fully GPU-based workflow integrating accelerated data generation and neural emulators
result Physics emulators remain reliable beyond their training distribution
Transformers can emulate various algorithms by prompting, proving universality.
problem How to emulate algorithms using fixed-weight Transformers.
method Two modes of in-context algorithm emulation: task-specific and prompt-programmable. Constructing prompts that encode algorithm parameters into token representations.
result Fixed-weight Transformers can emulate a broad class of algorithms via prompts.
Paper develops a method to create accurate emulators of expensive computer codes.
problem High cost and complexity of running complex computer codes.
method Active learning with Gaussian processes to construct emulators.
result Accurate and compact emulators created for expensive codes.
A new method for designing accurate emulators using deep learning with interval calibration.
problem Designing accurate emulators for scientific processes with modern machine learning methods.
method Learn-by-Calibrating (LbC) approach based on interval calibration.
result Significant improvements in generalization error over widely-used loss functions.
SPF uses a hierarchical approach to efficiently emulate climate changes.
problem Slow and unstable climate emulation for long horizons.
method Spatiotemporal Pyramid Flows (SPF) model data hierarchically across spatial and temporal scales.
result SPF outperforms flow matching baselines and pre-trained models on ClimateBench.
A deep learning model speeds up computation of numerous implied volatilities.
problem Frequent computation of numerous implied volatilities using iteration methods like Newton-Raphson reaches processing speed limits.
method Emulated Newton-Raphson method using PyTorch and optimized with TensorRT.
result Up to 1,000 times faster than a benchmark implementation of Newton-Raphson.
21cmEMU speeds up EoR simulations by 10^4x, predicting key observables with sub-percent accuracy.
problem Efficiently simulating and inferring Epoch of Reionization properties from limited computational resources.
method Developed an emulator for 21cmFAST simulation outputs, reducing computational cost by 10^4x.
result Sub-percent accurate predictions of 6 key observables from EoR simulations.
Bayesian emulation simplifies complex model analysis.
problem Analyzing complex computer models and Bayesian analyses.
method Bayesian emulation techniques for robust analyses.
result Overcomes intractable problems in robustness studies.
MF-GLaM models improve stochastic simulator emulation with multifidelity data.
problem Challenging to emulate stochastic simulators' full conditional probability distribution.
method Proposes MF-GLaMs to efficiently emulate HF stochastic simulators using LF data.
result MF-GLaMs achieve improved accuracy or comparable performance at reduced cost.
Machine learning speeds up CRTM model predictions for weather forecasting.
problem Insufficient computational efficiency of radiative transfer models.
method Probabilistic neural network emulator of CRTM.
result Emulator predicts brightness temperatures with RMSE < 0.1 K for clear sky conditions.
HierGP improves emulator efficiency for sparse, structured data.
problem Sparse, structured data in expensive simulations.
method Hierarchical shrinkage GP framework with cumulative shrinkage priors.
result HierGP identifies structured sparse features from limited data.
CuLE accelerates reinforcement learning on GPUs.
problem Limited CPU-GPU communication bandwidth in Atari Learning Environment.
method CUDA port of ALE, leveraging GPU parallelization and direct frame rendering.
result Up to 155M frames per hour on a single GPU, accelerating reinforcement learning.
New model simulates stock market microstructure with learning agents.
problem Lack of realistic agent learning in past financial models.
method Designed a next-generation MAS stock market simulator with model-free reinforcement learning.
result Model can faithfully reproduce market microstructure metrics.
AutoKE automates embedding physical knowledge into neural networks for complex engineering problems.
problem Complex physical equations in engineering problems.
method AutoKE framework using deep neural networks, equation parsing, automatic differentiation, adaptive weights, and NAS.
result Automatically embeds physical knowledge into neural networks for complex equations efficiently.
Paper introduces efficient methods for estimating cross-partial derivatives and sensitivity indices.
problem Efficiently estimating cross-partial derivatives and sensitivity indices in complex models.
method Using randomized points and constraints, the paper develops estimators with optimal convergence rates and low bias.
result The estimators achieve optimal rates of convergence and do not suffer from the curse of dimensionality.