Papers, ranked by score

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

Quantum Calibration of Local-Volatility Surfaces from Sparse Option Quotes

Hoshisashi

Calibrating a volatility surface from sparse option prices requires repeated solutions of a pricing equation as the volatility parameters change. We implement a hybrid quantum and classical method for this inverse problem using the Dupire local-volatility model. A positive coefficient…

Holy Grail Math 8.5 Rigor 7.0 Code
Costs: Not applicableOut-of-sample: UnclearResolution: Synthetic Data
More details
Evaluation
Pricing / calibration

Whack-a-mole Online Learning: Physics-Informed Neural Network for Intraday Implied Volatility Surface

Hoshisashi et al.

Calibrating the time-dependent Implied Volatility Surface (IVS) using sparse market data is an essential challenge in computational finance, particularly for real-time applications. This task requires not only fitting market data but also satisfying a specified partial differential equation (PDE)…

Holy Grail Math 8.5 Rigor 7.0
Costs: Not applicableOut-of-sample: UnclearResolution: Unclear
More details
Authors
Kentaro Hoshisashi, Carolyn E. Phelan, Paolo Barucca
Evaluation
Pricing / calibration

No-Arbitrage Deep Calibration for Volatility Smile and Skewness

Hoshisashi et al.

Volatility smile and skewness are two key properties of option prices that are represented by the implied volatility (IV) surface. However, IV surface calibration through nonlinear interpolation is a complex problem due to several factors, including limited input data, low liquidity, and noise.…

Holy Grail Math 8.5 Rigor 5.5
Costs: Not applicableOut-of-sample: HoldoutResolution: Unclear
More details
Authors
Kentaro Hoshisashi, Carolyn E. Phelan, Paolo Barucca
Evaluation
Pricing / calibration

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.