Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

170339509678 · Jun 202019922001200920172026
48 results for simulation experiments

Inertial confinement fusion (ICF) experiments are designed using computer simulations that are approximations of reality, and therefore must be calibrated to accurately predict experimental observations. In this work, we propose a novel nonlinear technique for calibrating from simulations to experiments, or from low fi…

2018-12-14abs ↗pdf ↗

The paper proposes an efficient nested simulation design using likelihood ratio method.

problem Designing nested simulations with fixed outer scenarios and minimizing simulation effort.
method Proposes a bi-level optimization problem to decide inner replications and pooling strategies.
result Optimized design achieves $\cO(Γ^{-1})$ mean squared error of estimators.

Simulation and neural network analysis predict fiber laydown in spunbond processes.

problem Predicting fiber laydown quality in spunbond processes.
method Design of experiments, blocked neural network analysis.
result Prediction of fiber laydown characteristics and ranking of influencing effects.

New simulation shows trading algorithms' performance varies with parallelism.

problem Validation of trading algorithms' performance in parallel markets.
method Used TBSE, a threaded market simulator, to compare algorithms' performance.
result Trading algorithms' performance differs in parallel vs. sequential markets.

A lifelong learning architecture improves reinforcement learning policies using simulations and a DNC model.

problem Improving reinforcement learning policies in dynamic environments.
method Iterative training of a Reinforcement Learning agent and a DNC model in conjunction.
result DNC models can continually learn from pixels alone to simulate new tasks.

Sparse matrix decomposition identifies key design variables for ICF experiments.

problem Improving predictive capability of ICF simulation codes through better understanding of design inputs and outcomes.
method Sparse Principal Component Analysis (SPCA) and Random Forest (RF) surrogate model.
result Identified clusters of design variables related to physical processes, revealing important variables not previously considered.

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.

TRADES generates realistic market simulations for financial modeling.

problem Generating realistic and responsive market simulations for financial tasks.
method TRADES uses a transformer-based denoising diffusion probabilistic engine to generate time series order flows conditioned on market state.
result TRADES improves market simulation metrics by 3.27-3.48 over state-of-the-art (SoTA) methods.

CausalRegNet generates accurate data for gene perturbation experiments, improving CSL methods.

problem Assessing and selecting causal structure learning methods in gene perturbation experiments.
method CausalRegNet, a multiplicative effect structural causal model, generates accurate observational and interventional data.
result CausalRegNet generates more accurate distributions and scales better than current simulation frameworks.

Proposes a RL method using simulators for stabilizing uncertain systems.

problem Limited experiences and potential dangerous actions during RL learning of real systems.
method Two-stage approach: virtual systems for Q-function learning, real system interactions for final policy.
result Proposed method improves RL performance in uncertain discrete-time systems.

Ebay uses forecasting and simulation to decide when to disable a vendor.

problem Determining the optimal time to disable a vendor to avoid customer loss.
method Data-driven approach involving multiplicative seasonality model, Monte Carlo simulation, and linear model.
result Identifies the best time to disable a vendor to minimize customer loss.

Develops methods to simulate option prices for a specific stochastic volatility model.

problem No method exists to compute option prices numerically for a non-martingale jump-type model.
method Develops two Monte Carlo simulation methods under change of measure.
result Conducts numerical experiments to validate the developed methods.

New method tackles rugged optimization landscapes in contact-rich scenarios.

problem Optimization challenges in dynamic environments with deformable objects.
method Combines Bayesian optimization with semi-local 'leaps' for global search.
result Outperforms gradient-based and gradient-free baselines in simulation and real robot experiments.

Bayesian optimization improves machine learning system tuning with online and offline experiments.

problem Limited simultaneous experiments in complex policy spaces.
method Augment online field experiments with an offline simulator and apply multi-task Bayesian optimization.
result Substantial gains from including biased offline data in live machine learning systems.

The paper quantifies and attributes uncertainty in complex system simulations.

problem Uncertainty in complex system simulations due to unknown or approximated subprocesses.
method Developed a framework for quantifying and attributing submodel uncertainty using bootstrapping, Bayesian model averaging, and tree-based methods.
result Individual submodels contribute to overall uncertainty, and their importance can be quantified.

Agent-based simulation assesses tradable credit schemes for congestion reduction.

problem Simplistic modeling of TCS impacts in transportation research.
method Agent- and activity-based simulation framework within SimMobility.
result TCS stabilizes network and market performance over time, reducing congestion.

How useful can machine learning be in a quantum laboratory? Here we raise the question of the potential of intelligent machines in the context of scientific research. A major motivation for the present work is the unknown reachability of various entanglement classes in quantum experiments. We investigate this question …

2017-06-02abs ↗pdf ↗

We present an experimental and simulated model of a multi-agent stock market driven by a double auction order matching mechanism. Studying the effect of cumulative information on the performance of traders, we find a non monotonic relationship of net returns of traders as a function of information levels, both in the e…

2006-10-04abs ↗pdf ↗

Simulation is a useful tool in situations where training data for machine learning models is costly to annotate or even hard to acquire. In this work, we propose a reinforcement learning-based method for automatically adjusting the parameters of any (non-differentiable) simulator, thereby controlling the distribution o…

2018-10-05abs ↗pdf ↗

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…

2014-01-13abs ↗pdf ↗

New clustering method uses Wasserstein distance to analyze simulation outputs.

problem Analyzing stochastic simulation outputs to uncover relationships and patterns.
method Agglomerative clustering using regularized Wasserstein distance.
result Identifies staffing plans yielding similar performance outcomes.

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.

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.

Method improves simulation accuracy by mitigating distribution shift in hybrid systems.

problem Mitigating distribution shift in machine-learning augmented hybrid simulation.
method Tangent-space regularized estimator to control distribution shift.
result Marked improvements in simulation accuracy, especially for systems with high distribution shift.

Study simulates Variance Gamma processes for energy derivatives pricing.

problem Simulating Variance Gamma processes for accurate energy derivative pricing.
method Three-step procedure to relate self-decomposability to increments, derived from Qu et al. (2019). Exact simulation of skeleton of Variance Gamma and symmetric Variance Gamma driven Ornstein-Uhlenbeck processes.
result Exact simulation of Variance Gamma and related processes without numerical inversion.

We propose a novel calibration method for computer simulators, dealing with the problem of covariate shift. Covariate shift is the situation where input distributions for training and test are different, and ubiquitous in applications of simulations. Our approach is based on Bayesian inference with kernel mean embeddin…

2018-09-21abs ↗pdf ↗

Machine learning tools are commonly used in modern high energy physics (HEP) experiments. Different models, such as boosted decision trees (BDT) and artificial neural networks (ANN), are widely used in analyses and even in the software triggers. In most cases, these are classification models used to select the "signal"…

2016-08-20abs ↗pdf ↗

The paper proposes a framework to calibrate multi-agent simulation models from output series using Bayesian optimization.

problem Calibrating multi-agent simulation models from observable output series.
method Novel eligibility set concept, two-sample Kolmogorov-Smirnov test with Bonferroni correction, Bayesian optimization (BO), and trust-region BO (TuRBO).
result Demonstrated the efficiency of the proposed framework using numerical experiments.

Improves likelihood-free inference by using a new sampling approach to avoid biased data collection.

problem Efficient Bayesian inference without likelihood evaluation for real-world datasets.
method Introduces Neural Proposal (NP) to sample simulation inputs i.i.d. for unbiased posterior inference.
result Demonstrates improved performance, especially for multi-modal posteriors, through experiments.

Approach selects variables and time intervals for comparing high-dimensional time-series data.

problem Comparing high-dimensional time-series data for significant differences.
method Data is split into subintervals, and two-sample tests are performed on each to identify distinguishing variables.
result The approach effectively identifies variables and time intervals where data significantly differs.