The study optimizes simulated annealing's cooling schedule for better performance.
problem Designing optimal cooling schedules for simulated annealing to improve its performance.
method Analyzed the cooling schedule's impact on simulated annealing's performance and provided sample and simulation complexity results.
result Optimal cooling schedules can be found with a small number of samples, improving the algorithm's runtime or success rate.
PRISM infers model structures and parameters from simulations, controlling complexity at test time.
problem Choosing among large model families for scientific discovery.
method Simulation-based encoder-decoder that infers model structures and parameters, with test-time complexity control.
result PRISM scales to large model families and performs model selection in biophysical diffusion MRI.
CausalMan simulates complex causality for fair benchmarking.
problem Lack of realistic causal models with known data generating processes.
method Developed a physics-based simulator, CausalMan, for large-scale causality.
result Demonstrated inadequacy of state-of-the-art approaches and analyzed their performance.
Graph Network-based Simulators learn complex physics simulations.
problem Simulating complex physical systems with high accuracy and scalability.
method Graph Network framework for particle dynamics, learned message-passing.
result Model generalizes well to different conditions and scales, robust to hyperparameters.
G-Sim uses LLMs to build reliable simulators for complex systems.
problem Building robust simulators for critical domains like healthcare and logistics is challenging.
method Hybrid framework combining LLM-driven structural design and empirical calibration.
result G-Sim produces reliable, causally-informed simulators that handle non-differentiable and stochastic simulators.
In computer experiments, a mathematical model implemented on a computer is used to represent complex physical phenomena. These models, known as computer simulators, enable experimental study of a virtual representation of the complex phenomena. Simulators can be thought of as complex functions that take many inputs and…
DIVA generates diverse tasks for complex simulators, enabling adaptive agent training.
problem Lack of diverse training data for complex, open-ended simulators.
method Evolutionary approach using domain randomization and procedural generation.
result Successfully trains adaptive agent behavior in complex simulators.
Generative models speed up complex system simulations.
problem Accurately forecasting the dynamics of complex systems at reduced cost.
method Generative Learning of Effective Dynamics (G-LED) using auto-regressive attention and Bayesian diffusion models.
result Generative models can accurately forecast complex system dynamics at lower computational cost.
In this work, sequence-to-sequence (seq2seq) models, originally developed for language translation, are used to predict the temporal evolution of complex, multi-physics computer simulations. The predictive performance of seq2seq models is compared to state transition models for datasets generated with multi-physics cod…
New simulation method tackles sign problem in quantum fields.
problem Sign problem in real-time dynamics of quantum fields.
method Inspired by reinforcement learning, complex Langevin approach with learned optimal kernels.
result Significant extension of real-time simulations in 1+1d scalar field theory.
ConDiSim uses diffusion models to approximate complex system posteriors efficiently.
problem Simulation-based inference of systems with intractable likelihoods.
method Conditional diffusion model with forward and reverse processes.
result Effective posterior approximation across various benchmark and real-world problems.
Improved GNN simulation of WL test with exponentially lower complexity.
problem Improving the complexity of simulating the Weisfeiler-Lehman test with GNNs.
method Exponentially lower complexity simulation of WL test using GNNs with polylogarithmic parameters and O(log n) bits feature vectors.
result Near-optimal construction with logarithmic lower bounds for feature vector length and neural network size.
New simulation model predicts financial market dynamics with high accuracy.
problem Extreme difficulty in financial market projections due to human behavioural complexity.
method Agent-based modeling with a hierarchical knowledge architecture to simulate diverse human groups.
result Simulator achieves 13.29% deviation in crisis scenarios and lower mean square error under normal conditions.
Survey connects XAI and surrogate modeling for better understanding of complex systems.
problem Opaque surrogate models hide input-output relationships, hindering decision-making.
method Synthesizes XAI techniques with surrogate modeling workflows.
result Surrogate models can be made more interpretable using XAI methods.
Develops black-box methods to estimate parameters of complex models.
problem Lack of efficient methods to produce simulations for complex statistical models.
method Pre-training deep neural networks on extensive simulated databases for well-structured likelihoods. Iterative algorithm for other complex dependencies.
result Successfully estimates and quantifies uncertainty of parameters from non-Gaussian models.
Efficiently estimates marginal posteriors for complex simulations.
problem Bayesian inference in high-dimensional, intractable likelihood scenarios.
method Simulates and estimates low-dimensional marginal posteriors, using truncated indicators.
result Simulator efficiency and robustness testing of inference results.
Framework synthesizes programs for simulating complex models and estimating parameters.
problem Parameter estimation for complex models requires manual encoding of fixed model structures.
method Combines LLMs for program synthesis with neural simulation-based inference.
result Identifies plausible model families from open-ended prompts with high accuracy.
Cost-aware SBI reduces expensive simulations in complex models.
problem High computational cost in simulating complex models.
method Combination of rejection and self-normalised importance sampling.
result Significant reduction in overall cost of inference.
New method speeds up Bayesian inference for complex simulators.
problem Challenges in Bayesian inference for complex stochastic simulators with intractable likelihood functions.
method Optimization Monte Carlo framework reformulated as deterministic optimization problems with gradient-based methods.
result Accurate posterior inference with reduced runtimes compared to existing methods.
Real-life control tasks involve matters of various substances---rigid or soft bodies, liquid, gas---each with distinct physical behaviors. This poses challenges to traditional rigid-body physics engines. Particle-based simulators have been developed to model the dynamics of these complex scenes; however, relying on app…
New RL method reduces sample complexity for large policy spaces.
problem Large-scale RL with unknown optimal policies and state/action spaces.
method Introduces eluder dimension for policy space, proving near-optimal sample complexity.
result Near-optimal sample complexity upper bound that depends linearly on eluder dimension.
Develops methods to create consistent surrogate models for agent-based simulators.
problem High computational costs and misjudgment of interventions in agent-based models.
method Causal abstractions to learn interventionally consistent surrogate models.
result Surrogates trained for interventional consistency closely mimic the agent-based model's behavior under interventions.
We use neural networks to estimate complex model posteriors efficiently.
problem Intractable likelihood functions in complex models.
method Train a neural network to map data to posterior distributions of model parameters.
result Our method converges to true posteriors in Kullback-Leibler divergence.
Improved inference efficiency for complex simulations.
problem Challenges in performing inference under resource-intensive stochastic simulators.
method Active sequential neural posterior estimation (ASNPE) integrating active learning into posterior estimation.
result Improved sample efficiency with low computational overhead.
MarS simulates financial markets using generative models.
problem Simulating realistic financial market effects.
method Order-level generative foundation model (LMM) for realistic, interactive, and controllable order generation.
result Strong scalability and robust realism in MarS.
We present a framework for automatically structuring and training fast, approximate, deep neural surrogates of stochastic simulators. Unlike traditional approaches to surrogate modeling, our surrogates retain the interpretable structure and control flow of the reference simulator. Our surrogates target stochastic simul…
This work shows how to use simulators to learn efficient exploration in real-world RL.
problem Sample complexity of real-world reinforcement learning.
method Coupling exploratory policies learned in simulators with practical approaches.
result Polynomial sample complexity in real world, exponential improvement over direct sim2real transfer.
Polynomial mixing times for simulated tempering in mixture sampling problems.
problem Sampling from mixtures of log-concave distributions with location shifts.
method Conductance decomposition applied to an auxiliary Markov chain on an augmented space.
result First polynomial-time guarantee for simulated tempering with MALA.
We study the wealth distribution of the Bouchaud--Mézard (BM) model on complex networks. It has been known that this distribution depends on the topology of network by numerical simulations, however, no one have succeeded to explain it. Using "adiabatic" and "independent" assumptions along with the central-limit theore…
INP accelerates stochastic simulations using deep Bayesian active learning.
problem Computational expense of stochastic simulations at fine-grained resolution.
method Interactive Neural Process (INP) framework combining spatiotemporal surrogate model and active learning acquisition function.
result STNP outperforms baselines in accelerating stochastic simulations and LIG achieves state-of-the-art for Bayesian active learning.
Understanding the evolution of human society, as a complex adaptive system, is a task that has been looked upon from various angles. In this paper, we simulate an agent-based model with a high enough population tractably. To do this, we characterize an entity called \textit{society}, which helps us reduce the complexit…
New method improves robustness and efficiency of inference from complex models.
problem Inability of existing methods to handle outliers in simulator-based models.
method Generalised Bayesian inference with neural approximation of weighted score-matching loss.
result Provable robustness to outliers and computational efficiency.
Models of complex systems are often formalized as sequential software simulators: computationally intensive programs that iteratively build up probable system configurations given parameters and initial conditions. These simulators enable modelers to capture effects that are difficult to characterize analytically or su…
New algorithm improves Bayesian inference for complex models.
problem Poor performance of existing Bayesian approaches for simulators.
method Posterior bootstrap and maximum mean discrepancy estimators.
result Strong robustness and parallelizability of the new algorithm.
Recent advances in artificial intelligence have been driven by the presence of increasingly realistic and complex simulated environments. However, many of the existing environments provide either unrealistic visuals, inaccurate physics, low task complexity, restricted agent perspective, or a limited capacity for intera…
Bayesian Neural Networks improve precision cosmology from simulations.
problem Extracting precise cosmological parameters from complex simulations.
method Using Bayesian Neural Networks on The Quijote simulations.
result Demonstrates BNNs' ability to estimate associated uncertainties and complex output distributions.
Learning robot tasks or controllers using deep reinforcement learning has been proven effective in simulations. Learning in simulation has several advantages. For example, one can fully control the simulated environment, including halting motions while performing computations. Another advantage when robots are involved…
Many domains of science have developed complex simulations to describe phenomena of interest. While these simulations provide high-fidelity models, they are poorly suited for inference and lead to challenging inverse problems. We review the rapidly developing field of simulation-based inference and identify the forces …
Improved SBI with neural networks for complex models.
problem Accurate inference for complex models with intractable likelihood.
method Structured mixtures of probability distributions for likelihood and posterior approximation.
result Accurate posterior inference with smaller computational footprint.
TCR simplifies complex models into interpretable causal factors.
problem Understanding complex phenomena in high-dimensional models.
method Information theoretic objective for learning TCR from interventional data.
result TCR generates interpretable high-level explanations from complex models.
Complex network analysis reveals dominant stocks in financial stock returns correlations.
problem Inferring financial stock returns correlations from complex network analysis.
method Simulated geometric Brownian motion for stocks, complex network analysis, eigenvector centrality, clustering.
result Returns correlation matrix is dominated by stocks with high eigenvector centrality and clustering.
NCS enables efficient and accurate conditional simulation for complex spatial processes.
problem Challenges in simulating from complex spatial process distributions.
method Neural diffusion models and conditional score-based diffusion.
result NCS outperforms traditional methods in efficiency and accuracy.
New method improves sample-efficiency in neural posterior estimation using simulator gradients.
problem High-fidelity posterior estimation with complex physical simulations is time-consuming.
method Neural Posterior Estimation (NPE) with differentiable simulators and gradient information.
result Improves sample-efficiency in posterior density estimation.
Mobile network that millions of people use every day is one of the most complex systems in the world. Optimization of mobile network to meet exploding customer demand and reduce capital/operation expenditures poses great challenges. Despite recent progress, application of deep reinforcement learning (DRL) to complex re…
New method improves stochastic kriging for high-dimensional simulations.
problem High-dimensional simulation models require prohibitive sample sizes and computational costs.
method Tensor Markov kernels and sparse grid experimental designs.
result Sample complexity grows only slightly with dimensionality, improving accuracy and efficiency.
The interpretability of machine learning, particularly for deep neural networks, is crucial for decision making in real-world applications. One approach is replacing the un-interpretable machine learning model with a surrogate model, which has a simple structure for interpretation. Another approach is understanding the…
New method for efficient inference over complex parameter spaces.
problem Challenges in Bayesian inference for high-dimensional, intractable likelihoods.
method Arbitrary Marginal Neural Ratio Estimation (AMNRE) for simulation-based inference.
result Efficient inference over arbitrary subsets of parameters without numerical integration.
Diffusion maps help learn complex quantum phase transitions from data.
problem Learning quantum phase transitions from experimental data is challenging.
method Diffusion maps for nonlinear dimensionality reduction and spectral clustering.
result Diffusion maps can learn complex phase transitions unsupervised.