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.

168,657 papers · 148 categories

Trend · papers per month

81163244325 · Jun 202019922001200920172026
48 results for simulator exploitation

New approach reduces simulator exploitation by improving strategic robustness.

problem Simulator exploitation leading to reality gap between simulation and real-world performance.
method Formulated as a zero-sum minimax game, providing theoretical guarantees and a convergent active data selection algorithm.
result Proves convergence and reduces prediction error in strategically important regions by 1.5-2.2 times.

New approach reduces simulator exploitation by learning robust models.

problem Simulator exploitation leading to reality gap in reinforcement learning.
method Formulated as a zero-sum minimax game between model player and policy player, providing theoretical guarantees and a convergent active data selection algorithm.
result Reduces prediction error in strategically important regions by 1.5-2.2 times and enables near-optimal real-world performance.

Finding a good compromise between the exploitation of known resources and the exploration of unknown, but potentially more profitable choices, is a general problem, which arises in many different scientific disciplines. We propose a stylized model for these exploration-exploitation situations, including population or e…

2013-10-18abs ↗pdf ↗

Paper develops a dynamic Bayesian approach for active learning that optimizes exploration-exploitation balance.

problem Balancing exploration and exploitation in active learning for unknown functions.
method Develops BHEEM, a Bayesian hierarchical approach with approximate Bayesian computation for sampling trade-off parameters.
result BHEEM achieves at least 21% and 11% improvement over pure exploration and exploitation strategies respectively.

Q-learning is a simple and powerful tool in solving dynamic problems where environments are unknown. It uses a balance of exploration and exploitation to find an optimal solution to the problem. In this paper, we propose using four basic emotions: joy, sadness, fear, and anger to influence a Qlearning agent. Simulation…

2016-09-06abs ↗pdf ↗

New method improves simulation efficiency in high dimensions.

problem Efficiency in estimating functionals of conditional expectations in high dimensions.
method Kernel ridge regression exploiting smoothness of conditional expectation.
result Effective reduction of the curse of dimensionality, bridging convergence rates.

EDU method finds diverse optimal solutions for expensive simulators.

problem Optimizing expensive black-box simulators for diverse solutions.
method EDU method searches for diverse locally-optimal solutions within a tolerance level.
result EDU yields a closed-form acquisition function facilitating efficient sequential queries.

We extend recent work (Brehmer, et. al., 2018) that use neural networks as surrogate models for likelihood-free inference. As in the previous work, we exploit the fact that the joint likelihood ratio and joint score, conditioned on both observed and latent variables, can often be extracted from an implicit generative m…

2018-08-02abs ↗pdf ↗

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.

This research tackles balancing exploration and exploitation in deep RL for partially observable systems.

problem Balancing exploration and exploitation in deep RL for partially observable systems.
method Deployed and tested several techniques including adaptive and deterministic exploration strategies, and a modified quadratic loss function.
result Adaptive methods better approximate the trade-off between exploration and exploitation.

In this work, we study recommendation systems modelled as contextual multi-armed bandit (MAB) problems. We propose a graph-based recommendation system that learns and exploits the geometry of the user space to create meaningful clusters in the user domain. This reduces the dimensionality of the recommendation problem w…

2018-07-31abs ↗pdf ↗

New method transforms complex stochastic equations into simpler ones for efficient simulation.

problem Efficient simulation of complex path-dependent stochastic processes.
method Transforms Volterra-type SDEs into standard diffusion processes using convolution kernels.
result Proposes a numerical simulation scheme with a strong convergence rate of 1/2.

Bayesian search optimizes exploration of feasible solutions under expensive constraints.

problem Identifying feasible solutions in computationally expensive constraint spaces.
method Bayesian models with an acquisition function for efficient exploration and exploitation.
result The proposed acquisition function improves the prediction of feasibility.

ASD algorithm maximizes model estimates by adaptively labeling points.

problem Maximizing model estimates through adaptive labeling of points in a sequential decision-making problem.
method Formulated a general information-directed sampling (IDS) algorithm with theoretical guarantees for linear, graph, and low-rank models.
result IDS algorithm outperforms in both simulation and real-data experiments for discovering chemical reaction conditions.

Develops a method to simulate rare dangerous events in autonomous systems.

problem Rare dangerous events in safety-critical systems are hard to test in real-world settings.
method Combines exploration, exploitation, and optimization techniques for rare-event simulation.
result Provides rigorous guarantees for the performance of the method.

TVR optimizes black-box simulators by targeting variance reduction over control and noise parameters.

problem Optimizing black-box simulators with uncertain parameters.
method Targeted Variance Reduction (TVR) method that optimizes (x,θ)(\mathbf{x},\boldsymbolθ) jointly.
result Improved robust optimization performance over state-of-the-art methods.

As machine learning algorithms become increasingly sophisticated to exploit subtle features of the data, they often become more dependent on simulations. This paper presents a new approach called weakly supervised classification in which class proportions are the only input into the machine learning algorithm. Using on…

2017-02-01abs ↗pdf ↗

Recommender systems play an essential role in the modern business world. They recommend favorable items like books, movies, and search queries to users based on their past preferences. Applying similar ideas and techniques to Monte Carlo simulations of physical systems boosts their efficiency without sacrificing accura…

2016-12-06abs ↗pdf ↗

Paper introduces a new project control method using Monte Carlo and statistical learning.

problem Project control under uncertainty.
method Integrates Earned Value Methodology with Monte Carlo simulation and statistical learning.
result Estimates probabilities of project success and duration.

Radio frequency (RF) sensors are used alongside other sensing modalities to provide rich representations of the world. Given the high variability of complex-valued target responses, RF systems are susceptible to attacks masking true target characteristics from accurate identification. In this work, we evaluate differen…

2018-11-26abs ↗pdf ↗

Develops a method to estimate rare-event probabilities under distributional uncertainty.

problem Distributional uncertainty limits the effectiveness of rare-event simulation techniques.
method Wasserstein distributionally robust rare-event simulation (DRIS) framework.
result DRIS achieves vanishing relative error in estimating rare-event probabilities.

Efficiently simulates slow dynamics of high-dimensional stochastic systems.

problem Simulating high-dimensional stochastic systems with slow dynamics and fast modes.
method Designs an algorithm to estimate an invariant manifold and its dynamics, averaging out fast modes.
result Efficient simulator of effective dynamics on low-dimensional invariant manifold.

Despite their exceptional flexibility and popularity, the Monte Carlo methods often suffer from slow mixing times for challenging statistical physics problems. We present a general strategy to overcome this difficulty by adopting ideas and techniques from the machine learning community. We fit the unnormalized probabil…

2016-10-10abs ↗pdf ↗

Approximate Bayesian Computation (ABC) is a framework for performing likelihood-free posterior inference for simulation models. Stochastic Variational inference (SVI) is an appealing alternative to the inefficient sampling approaches commonly used in ABC. However, SVI is highly sensitive to the variance of the gradient…

2016-06-28abs ↗pdf ↗

The paper shows how shared random seeds can reduce variance in machine learning evaluations.

problem The statistical structure of comparative evaluation under shared random seeds is not well understood.
method An extended learning-based multi-agent economic simulator was used to demonstrate the effects of shared random seeds on variance reduction.
result Pairing seeds can reduce variance in machine learning evaluations, especially when outcomes are positively correlated at the seed level.

FinRL-Meta creates diverse market environments for DRL in finance.

problem Inaccurate financial data and diverse market environments challenge DRL in finance.
method Open-source data processing tools, hundreds of market environments, and multiprocessing.
result FinRL-Meta improves DRL accuracy and speed in financial simulations.

CausalSim corrects bias in trace-driven simulations for more accurate results.

problem Bias in trace-driven simulations due to system conditions during trace collection.
method CausalSim learns a causal model of system dynamics and latent factors from an RCT to remove bias from trace data.
result CausalSim reduces simulation errors by 53% and 61% compared to baselines, providing more accurate insights.

Generative Adversarial Network (GAN) simulates realistic multi-asset scenarios for tail risk.

problem Simulating realistic joint dynamics of multi-asset portfolios for tail risk estimation.
method Designing a GAN that preserves Value-at-Risk (VaR) and Expected Shortfall (ES) tail risk features.
result Correctly captures tail risk for a broad class of trading strategies and demonstrates strong generalization.

New strategies improve multi-agent decision-making on irregular networks.

problem Maximizing group reward in multi-agent settings with heterogeneous strategies.
method Design and analysis of heterogeneous explore-exploit strategies for multi-star networks.
result Group performance improves under heterogeneous strategies compared to homogeneous strategies.