6 papers in the archive (2023–2025),
average empirical rigor 6.4/10, average math complexity 8.5/10, 6 with linked code. Quadrant mix: Holy Grail ×5, Lab Rats ×1.
Scores are our LLM-assisted heuristics (methodology), not peer review or citation counts. Author pages are generated from paper metadata; name variants may split one person across pages.
arXiv author page →
Papers, ranked by score
Ordered by a blend of empirical rigor (60%) and math complexity (40%).
In this work, we develop a novel efficient quadrature and sparse grid based polynomial interpolation method to price American options with multiple underlying assets. The approach is based on first formulating the pricing of American options using dynamic programming, and then employing static…
Holy GrailMath 9.0Rigor 7.5Code
Costs: Not applicableOut-of-sample: NoneResolution: Synthetic Data
The rough Bergomi (rBergomi) model can accurately describe the historical and implied volatilities, and has gained much attention in the past few years. However, there are many hidden unknown parameters or even functions in the model. In this work, we investigate the potential of learning the…
Holy GrailMath 9.2Rigor 7.1Code
Costs: Not applicableOut-of-sample: UnclearResolution: Synthetic Data
We present a new deep primal-dual backward stochastic differential equation framework based on stopping time iteration to solve optimal stopping problems. A novel loss function is proposed to learn the conditional expectation, which consists of subnetwork parameterization of a continuation value…
Holy GrailMath 8.5Rigor 7.0Code
Costs: Not applicableOut-of-sample: NoneResolution: Synthetic Data
We propose an efficient and easy-to-implement gradient-enhanced least squares Monte Carlo method for computing price and Greeks (i.e., derivatives of the price function) of high-dimensional American options. It employs the sparse Hermite polynomial expansion as a surrogate model for the…
Holy GrailMath 8.5Rigor 7.0Code
Costs: Not applicableOut-of-sample: NoneResolution: Synthetic Data
Despite the empirical success in modeling volatility of the rough Bergomi (rBergomi) model, it suffers from pricing and calibration difficulties stemming from its non-Markovian structure. To address this, we propose a comprehensive computational framework that enhances both simulation and…
Holy GrailMath 8.0Rigor 6.0Code
Costs: Not applicableOut-of-sample: UnclearResolution: Synthetic Data
Current deep learning-based calibration schemes for rough volatility models are based on the supervised learning framework, which can be costly due to a large amount of training data being generated. In this work, we propose a novel unsupervised learning-based scheme for the rough Bergomi…
Lab RatsMath 8.0Rigor 4.0Code
Costs: Not applicableOut-of-sample: HoldoutResolution: Daily Data