Quantum computing techniques applied to Monte Carlo simulations in finance.
problem Efficiently simulating quantum algorithms for financial modeling.
method Introduces quantum computing basics, amplitude estimation, and Grover's algorithm for unstructured search.
result Demonstrates quantum approaches to Monte Carlo integration and counting in finance.
Optimizes K inner simulations for least-square Monte Carlo to reduce computational cost.
problem Computing conditional expectation E[f (Y)|X] with limited samples.
method Determines optimal number of Y samples (K) for given computational budget.
result Computational gain is maximized when sampling Y given X is inexpensive.
New method efficiently simulates fluid flows across various conditions.
problem High computational cost in simulating fluid flows.
method Parameter-conditioned sequential generative modeling of neural networks.
result Trained models simulate fluid flows at orders of magnitude faster than traditional methods.
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…
Paper uses agent-based simulation to identify investor types in financial markets.
problem Identifying investor types in real financial markets.
method Computational adaptation of PCA with agent-based simulation.
result A reduced set of investor models can approximate financial time series.
The paper proposes using path signatures for better inference in time series data.
problem Simulation models with time series data often lack tractable likelihood functions.
method Approximate Bayesian Computation with path signatures to handle sequential data.
result Theoretical guarantees on the resultant posteriors for Bayesian parameter inference.
Econophysics uses computer simulations to study financial markets.
problem Understanding financial market dynamics and behaviors.
method Computer simulations and sample programs.
result Exciting new field of econophysics emerged in 1995.
Bayesian neural networks improve simulation-based inference with limited data.
problem Inaccurate inference in data-poor regimes with limited or expensive simulations.
method Bayesian neural networks for posterior approximation, accounting for computational uncertainty.
result Bayesian neural networks produce well-calibrated posteriors with few simulations.
Quantum computing speeds up multi-period asset allocation.
problem High computational complexity in classic computing for multi-period asset allocation.
method Applied quantum computing to simulate multi-asset portfolio using historic data.
result Quantum computing offers significant advantages over classical computing in finance.
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.
We introduce the simulation tool SABCEMM (Simulator for Agent-Based Computational Economic Market Models) for agent-based computational economic market (ABCEM) models. Our simulation tool is implemented in C++ and we can easily run ABCEM models with several million agents. The object-oriented software design enables th…
Computer simulators are nowadays widely used to understand complex physical systems in many areas such as aerospace, renewable energy, climate modeling, and manufacturing. One fundamental issue in the study of computer simulators is known as experimental design, that is, how to select the input settings where the compu…
Novel quantum algorithm for financial market modeling.
problem Accurate quantum state preparation for financial simulation.
method Multi-Split-Steps Quantum Walk (multi-SSQW) with PQC and variational solver.
result Highly accurate modeling of complex financial distributions.
GPU speeds up Monte Carlo simulations for large time steps.
problem Slow convergence and inaccurate solutions with large time steps in Monte Carlo simulations.
method Generalizes the Seven League scheme for GPU acceleration.
result Significantly improved computational speed.
Consider scene understanding problems such as predicting where a person is probably reaching, or inferring the pose of 3D objects from depth images, or inferring the probable street crossings of pedestrians at a busy intersection. This paper shows how to solve these problems using Approximate Bayesian Computation. The …
This work shows how to efficiently simulate parts of quantum landscapes using classical computers.
problem Identifying where quantum computers are advantageous and offloading computations.
method Developed a quantum-enhanced classical algorithm to simulate sub-regions of quantum landscapes.
result It is possible to generate a classical surrogate of a sub-region of a quantum landscape.
Improves efficiency of simulators that fail to return.
problem Computational inefficiency in simulators that don't return for certain inputs.
method Trains a conditional normalizing flow to propose perturbations.
result Increased computational efficiency of simulators.
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.
Enhances SBI accuracy with multilevel Monte Carlo for expensive simulators.
problem Limited accuracy in SBI due to expensive simulators.
method Multilevel Monte Carlo techniques for cost-effective SBI.
result Significant enhancement in SBI accuracy with fixed computational budget.
Improved MMD estimator for likelihood-free inference.
problem Computational challenges in estimating MMD for likelihood-free inference.
method Optimally-weighted MMD estimator with improved sample complexity.
result Significantly improved sample complexity for accurate MMD estimation.
High-precision machine learning reduces particle physics simulations by orders of magnitude.
problem Reducing computational burden in particle physics simulations.
method Developed optimal training strategies and tuned machine learning regressors, including Deep Neural Networks with skip connections and boosted decision trees.
result Significantly reduced computational time by factors of 10^3 to 10^6 over first-principles simulations.
Python package for fast simulation-based inference.
problem Intractable likelihood functions in Bayesian inference.
method Uses neural networks as surrogate models for Bayesian inference.
result Highly efficient and user-friendly for constructing SBI estimators.
Incorporating computational fluid dynamics in the design process of jets, spacecraft, or gas turbine engines is often challenged by the required computational resources and simulation time, which depend on the chosen physics-based computational models and grid resolutions. An ongoing problem in the field is how to simu…
We propose a lifelong learning architecture, the Neural Computer Agent (NCA), where a Reinforcement Learning agent is paired with a predictive model of the environment learned by a Differentiable Neural Computer (DNC). The agent and DNC model are trained in conjunction iteratively. The agent improves its policy in simu…
BNRE improves simulation-based inference by producing more conservative posteriors.
problem Overconfident posteriors from current simulation-based inference algorithms risk false inferences.
method Balanced Neural Ratio Estimation (BNRE) that produces more conservative posterior approximations.
result BNRE produces more conservative posterior surrogates on all tested benchmarks and simulation budgets.
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.
High-fidelity quantum simulations demonstrated on short-coherence hardware.
problem Short coherence times limit the depth of quantum algorithms.
method Fixed State Variational Fast Forwarding (fsVFF) algorithm.
result Simulations of 600 time steps possible, 150x longer than previous methods.
3DB framework tests and debugs computer vision models using photorealistic simulation.
problem Discovering vulnerabilities and understanding model decision-making in computer vision systems.
method Unified framework using photorealistic simulation to test and debug vision models.
result Insights generated by 3DB transfer to the physical world, enabling robustness analysis.
New MC simulation methods use classifiers to estimate pdf ratios without explicit pdfs.
problem Estimating ratios of probability density functions (pdfs) without explicit pdfs.
method Proposes classifier-based pdf-free versions of MC simulation algorithms.
result Enables pdf-free simulation algorithms using surrogate functions computed by classifiers.
We study the qualitative and quantitative appearance of stylized facts in several agent-based computational economic market (ABCEM) models. We perform our simulations with the SABCEMM (Simulator for Agent-Based Computational Economic Market Models) tool recently introduced by the authors (Trimborn et al. 2019). Further…
Quantum computers can simulate flow models efficiently.
problem Efficiently simulating continuous flow models on quantum computers.
method Relating flow models to the Schrödinger equation and proving efficient Hamiltonian simulation.
result Quantum computers can prepare qsamples for flow models efficiently.
Scientists often express their understanding of the world through a computationally demanding simulation program. Analyzing the posterior distribution of the parameters given observations (the inverse problem) can be extremely challenging. The Approximate Bayesian Computation (ABC) framework is the standard statistical…
Proposes a new simulator for complex arrival processes.
problem Modeling and simulating complex arrival processes with non-stationary and multi-dimensional rates.
method Integrates Monte Carlo and GANs to model a broad class of arrival processes.
result Consistent and efficient estimation of the simulator using Wasserstein distance.
Novel deep learning approach for fast, differentiable fluid simulations.
problem Challenges in solving incompressible fluid dynamics equations efficiently.
method Physics-constrained training approach for convolutional neural networks.
result Trained models can handle various fluid phenomena and offer fast simulations.
New method improves SBI efficiency and scalability.
problem Scalability issues in SBI methods for large datasets.
method Langevin dynamics with score matching, exploiting likelihood structure.
result Structured score network enhances statistical efficiency and scalability.
Paper uses Chebyshev Tensors for accurate dynamic sensitivities and ISDA SIMM computation.
problem Computing dynamic sensitivities and initial margin for financial instruments.
method Uses Chebyshev Tensors in Monte Carlo simulations to compute dynamic sensitivities and ISDA SIMM.
result High accuracy and computational gains for FX swaps and Spread Options.
Complicated generative models often result in a situation where computing the likelihood of observed data is intractable, while simulating from the conditional density given a parameter value is relatively easy. Approximate Bayesian Computation (ABC) is a paradigm that enables simulation-based posterior inference in su…
A new method quantifies uncertainty in brain injury simulations.
problem High computational cost and high-dimensional inputs/outputs limit traditional UQ methods for biofidelic head models.
method Two-stage, data-driven manifold learning framework using Gaussian kernel-density estimation, diffusion maps, and Grassmannian diffusion maps.
result Surrogate models reduce computational cost while providing highly accurate approximations of the computational model.
Quantum walk algorithm optimizes quantum state preparation for financial simulations.
problem Efficiently loading classical data into quantum states for quantum computers.
method Split-step quantum walks (SSQW) to design parameterized quantum circuits (PQC).
result SSQW facilitates generating desired probability amplitude distributions for quantum simulations.
Computational Fluid Dynamics (CFD) is a hugely important subject with applications in almost every engineering field, however, fluid simulations are extremely computationally and memory demanding. Towards this end, we present Lat-Net, a method for compressing both the computation time and memory usage of Lattice Boltzm…
In many domains, scientists build complex simulators of natural phenomena that encode their hypotheses about the underlying processes. These simulators can be deterministic or stochastic, fast or slow, constrained or unconstrained, and so on. Optimizing the simulators with respect to a set of parameter values is common…
Quantum-inspired tensor network speeds up financial risk assessment.
problem Efficiently pricing multi-asset derivatives in finance.
method Tensor network algorithms for multi-asset options pricing.
result Tensor network approach yields several orders of magnitude speedup.
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using subsampling methods from randomized numerical linear algebra. We derive a simulation tech…
This tutorial introduces quantum computing for financial portfolio optimization.
problem Combinatorial portfolio optimization in financial markets.
method Application of Quantum Approximate Optimization Algorithm (QAOA) to portfolio optimization.
result Quality of combinatorial portfolio optimization solutions using QAOA on quantum simulator.
Improved ABC method using Gaussian processes for more efficient simulations and uncertainty quantification.
problem Efficiently simulate and quantify uncertainty in ABC methods.
method Batch-sequential Bayesian experimental design, numerical method for uncertainty quantification, improved GP modeling assumptions.
result Improved framework for ABC methods that quantifies uncertainty and parallelizes simulations.
Modeling counterparty risk is computationally challenging because it requires the simultaneous evaluation of all the trades with each counterparty under both market and credit risk. We present a multi-Gaussian process regression approach, which is well suited for OTC derivative portfolio valuation involved in CVA compu…
High performance computing (HPC) is a very attractive and relatively new area of research, which gives promising results in many applications. In this paper HPC is used for pricing of American options. Although the American options are very significant in computational finance; their valuation is very challenging, espe…
Maximal Rate of Stepwise Uncertainty Reduction selects simulations to reduce uncertainty efficiently.
problem Efficiently estimating quantities of interest from multi-fidelity simulations.
method Bayesian sequential strategy that maximizes the ratio of expected uncertainty reduction to simulation cost.
result MR-SUR strategy unifies and provides principled approaches to develop new methods.