Differentiable Agent-Based Simulation for Gradient-Guided Simulation-Based Optimization
Philipp Andelfinger

TL;DR
This paper introduces a differentiable agent-based simulation framework that enables gradient-based optimization by smoothing model discontinuities, demonstrated on traffic and epidemics models, outperforming gradient-free methods.
Contribution
It presents a novel approach to make agent-based simulations differentiable using automatic differentiation and smooth approximations, facilitating efficient gradient-based optimization.
Findings
Gradient-based methods outperform gradient-free in high-dimensional traffic optimization.
Differentiable models maintain fidelity with acceptable overhead.
Enables gradient-based training of neural network controllers within simulations.
Abstract
Simulation-based optimization using agent-based models is typically carried out under the assumption that the gradient describing the sensitivity of the simulation output to the input cannot be evaluated directly. To still apply gradient-based optimization methods, which efficiently steer the optimization towards a local optimum, gradient estimation methods can be employed. However, many simulation runs are needed to obtain accurate estimates if the input dimension is large. Automatic differentiation (AD) is a family of techniques to compute gradients of general programs directly. Here, we explore the use of AD in the context of time-driven agent-based simulations. By substituting common discrete model elements such as conditional branching with smooth approximations, we obtain gradient information across discontinuities in the model logic. On the example of microscopic traffic models…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
