Papers, ranked by score

Ordered by a blend of empirical rigor (60%) and math complexity (40%).

Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs

In this paper, we present a randomized extension of the deep splitting algorithm introduced in [Beck, Becker, Cheridito, Jentzen, and Neufeld (2021)] using random neural networks suitable to approximately solve both high-dimensional nonlinear parabolic PDEs and PIDEs with jumps having (possibly) inf

Holy Grail Math 9.2 Rigor 6.8 ·  May 8, 2024

Non-concave stochastic optimal control in finite discrete time under model uncertainty

In this article we present a general framework for non-concave robust stochastic control problems under model uncertainty in a discrete time finite horizon setting. Our framework allows to consider a variety of different path-dependent ambiguity sets of probability measures comprising, as a natural

Holy Grail Math 8.5 Rigor 6.5 ·  April 8, 2024

Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems

In this paper we develop a Stochastic Gradient Langevin Dynamics (SGLD) algorithm tailored for solving a certain class of non-convex distributionally robust optimisation (DRO) problems. By deriving non-asymptotic convergence bounds, we build an algorithm which for any prescribed accuracy $\varepsilo

Holy Grail Math 8.5 Rigor 5 ·  March 14, 2024

Quantum Monte Carlo algorithm for option pricing and its complexity analysis

In this paper we provide a quantum Monte Carlo algorithm to solve multidimensional Black-Scholes PDEs with correlation for option pricing. The payoff function of the option is of general form and is only required to be continuous and piecewise affine, which covers most of the relevant payoff functio

Lab Rats Math 8.5 Rigor 4.5 ·  January 23, 2023

Generative Neural Operators of Log-Complexity Can Simultaneously Solve Infinitely Many Convex Programs

Neural operators (NOs) are a class of deep learning models designed to simultaneously solve infinitely many related problems by casting them into an infinite-dimensional space, whereon these NOs operate. A significant gap remains between theory and practice: worst-case parameter bounds from universa

Lab Rats Math 9 Rigor 3.5 ·  August 20, 2025

Robust mean-field control under common noise uncertainty

We propose and analyze a framework for discrete-time robust mean-field control problems under common noise uncertainty. In this framework, the mean-field interaction describes the collective behavior of infinitely many cooperative agents’ state and action, while the common noise – a random disturba

Lab Rats Math 8.5 Rigor 3 ·  November 6, 2025

Sensitivity of robust optimization problems under drift and volatility uncertainty

We examine optimization problems in which an investor has the opportunity to trade in $d$ stocks with the goal of maximizing her worst-case cost of cumulative gains and losses. Here, worst-case refers to taking into account all possible drift and volatility processes for the stocks that fall within

Lab Rats Math 8.5 Rigor 2.5 ·  November 19, 2023

Browse

All authors · Research topics · Papers with code · Download the scored dataset

📬 The Quant Space Weekly

One email a week: the most interesting quant finance papers, scored and summarized. No spam, unsubscribe anytime.