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

2655297941,058 · Jun 202019922001200920172026
48 results for stochastic approach

High-probability bound for distributed stochastic approximation tracking error.

problem Analyzing the convergence of distributed stochastic approximation schemes.
method Analysis using ODE approach to stochastic approximation.
result High probability bound for tracking error between iterates and limiting differential equation.

Stochastic Q-learning tackles large action spaces with reduced computation.

problem Effective decision-making in complex environments with large discrete action spaces.
method Stochastic value-based RL approaches that consider a sublinear number of actions in each iteration.
result Stochastic Q-learning achieves near-optimal returns with significantly reduced computation time.

The paper develops a deep signature approach for option pricing under non-Markovian stochastic volatility models.

problem Pricing options under non-Markovian stochastic volatility models is challenging due to the dependence on historical paths.
method Reformulate the asset dynamics as a rough stochastic differential equation and represent rough paths via signatures. Apply standard analytical tools to solve the transformed equation.
result The deep signature approach provides a theoretically grounded and computationally efficient framework for option pricing.

Paper develops efficient methods for estimating Hessian inverses in stochastic optimization.

problem Estimating the inverse Hessian for convex function minimization.
method Robbins-Monro procedure for recursive estimation of the inverse Hessian.
result Develops universal stochastic Newton methods with improved efficiency.

Stochastic approach improves neural network training for kinetic simulations.

problem Training neural networks under physical constraints in kinetic fusion simulations.
method Stochastic augmented Lagrangian approach using pyTorch.
result Higher model prediction accuracy achieved compared to fixed penalty method.

Improves posterior approximation speed for Dirichlet process mixture models.

problem Inefficiency of stochastic variational inference in large datasets.
method Uses stochastic gradient ascent with adaptive stepsize optimization.
result Adaptive stepsize improves speed and performance of posterior approximation.

New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.

problem Challenges in planning for stochastic and partially-observable environments.
method Uses discrete autoencoders and a stochastic variant of Monte Carlo tree search.
result Significantly outperforms MuZero on stochastic chess and scales to DeepMind Lab.

We develop a scalable method for Bayesian neural networks with stochastic differential equations.

problem Uncertainty quantification in deep neural networks.
method Gradient-based stochastic variational inference in continuous-depth Bayesian neural networks.
result Gradient estimator with zero variance as the approximation improves.

New issue found in value-based reinforcement learning for stochastic environments.

problem Value-based reinforcement learning struggles with stochastic state transitions.
method Demonstrated using a multiobjective Markov Decision Process (MOMDP).
result Approaches may converge to Pareto-dominated solutions instead of optimal ones.

We present new stochastic differential equations, that are more general and simpler than the existing Ito-based stochastic differential equations. As an example, we apply our approach to the investment (portfolio) model.

2012-11-25abs ↗pdf ↗

Deep learning solves complex stochastic control with jumps.

problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.

Two new Frank-Wolfe algorithms improve convergence for constrained optimization.

problem Solving optimization problems with structured constraints in machine learning.
method Two new variants of the Frank-Wolfe (FW) method for stochastic finite-sum minimization.
result Best convergence guarantees for convex and non-convex objective functions.

This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.

problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.

A new method for high-dimensional RBDO using stochastic emulators.

problem Efficient RBDO in high-dimensional settings.
method Unified stochastic representation, stochastic emulators, deterministic mapping.
result Significant computational gains in high-dimensional settings.

New method optimizes sensor placement for stochastic systems efficiently.

problem Optimizing sensor placements for black-box stochastic systems with computational constraints.
method Trains a joint energy-based model on simulation data to learn parameter and solution distributions, allowing efficient sensor placement.
result Demonstrates lower computational cost and more informative sensor locations compared to conventional approaches.

Develops a new method to discover stochastic systems with non-Gaussian noise.

problem Discovering governing laws from complex systems with non-Gaussian noise.
method Theoretical framework and numerical algorithm to extract stochastic differential equations with Gaussian and non-Gaussian noise.
result Demonstrated the efficacy and accuracy of the approach on various systems.

An algorithm is proposed for solving stochastic and finite sum minimization problems. Based on a trust region methodology, the algorithm employs normalized steps, at least as long as the norms of the stochastic gradient estimates are within a specified interval. The complete algorithm---which dynamically chooses whethe…

2017-12-29abs ↗pdf ↗

The paper solves investment problems with uncertain factors using game theory.

problem Optimal forward investment in an incomplete market with model uncertainty.
method Combining stochastic differential games and ergodic BSDE approach.
result Representation of robust forward performance processes in factor form.

PALS extends PAL for optimizing stochastic simulators efficiently.

problem Optimizing stochastic simulators with high output variance and expensive evaluations.
method Bayesian optimization with probabilistic models, extending PAL for stochastic settings.
result PALS outperforms other methods in optimizing stochastic simulators.

Deep neural networks have dramatically achieved great success on a variety of challenging tasks. However, most successful DNNs have an extremely complex structure, leading to extensive research on model compression.As a significant area of progress in model compression, traditional gradual pruning approaches involve an…

2018-12-05abs ↗pdf ↗

The asymptotic pseudo-trajectory approach to stochastic approximation of Benaim, Hofbauer and Sorin is extended for asynchronous stochastic approximations with a set-valued mean field. The asynchronicity of the process is incorporated into the mean field to produce convergence results which remain similar to those of a…

2011-12-10abs ↗pdf ↗

Develops a GMM method to estimate roughness in stochastic volatility models.

problem Estimating roughness in stochastic volatility models with fractional Brownian motion.
method GMM approach for log-normal models with integrated variance and noisy realized variance.
result Consistent and asymptotically normal parameter estimator with bias correction.

New approach uses SGLD to minimize CVaR for portfolio weights.

problem Minimizing CVaR for portfolio weights with complete theoretical guarantees.
method Stochastic Gradient Langevin Dynamics (SGLD) with discontinuous updating.
result Theoretical guarantees for convergence in Wasserstein distances for convex and non-convex functions.

This paper presents a novel approach to numerically solve stochastic differential games for nonlinear systems. The proposed approach relies on the nonlinear Feynman-Kac theorem that establishes a connection between parabolic deterministic partial differential equations and forward-backward stochastic differential equat…

2019-06-11abs ↗pdf ↗

New method assesses financial and cyber risks under uncertainty.

problem Uncertainty in risk assessment for financial and cyber systems.
method Combines stochastic approximation and distorted mix method to compute worst case average value at risk.
result Efficient algorithm for tail uncertainty in multivariate distributions.

The paper solves TIC LQ control problems using stochastic differential games.

problem Time-inconsistent linear-quadratic stochastic control problems.
method Stochastic differential games, spike variation approach.
result Achieves Nash equilibrium for TIC problems, demonstrating impact of ambiguity aversion.

Paper introduces multitask neural networks for efficient stochastic control problems.

problem Infeasibility of simulating state variables in some stochastic control problems.
method Multitask neural networks with dynamic task balancing.
result Multitask neural networks outperform state-of-the-art approaches in derivatives pricing problems.

We consider the problem of multi-class classification and a stochastic opti- mization approach to it. We derive risk bounds for stochastic mirror descent algorithm and provide examples of set geometries that make the use of the algorithm efficient in terms of error in k.

2016-06-30abs ↗pdf ↗