用张量网络加速期权定价,大幅降低计算成本。
STN-GPR: A Singularity Tensor Network Framework for Efficient Option Pricing
- 基于张量列车表示价格曲面,无需完整训练数据直接构建代理模型。
- 在8维参数空间上,训练更快且测试误差更低,支持毫秒级查询响应。
- 适合金融风控中大规模组合重估,尤其适用于欧式与美式篮子期权。
我们提出一种张量网络代理模型用于期权定价,旨在解决市场风险管控中的大规模组合重估问题(如VaR和期望损失计算)。通过TT-Cross近似,将高维价格曲面表示为张量列车(TT)形式,直接从黑箱定价评估构建代理模型,无需生成完整训练张量。推理阶段采用拉普拉斯核,推导出核矩阵及其闭式逆的TT表示,在无噪声情况下避免密集矩阵分解与迭代求解。实验发现超参数优化始终偏好大核长度尺度,在此情形下高斯过程回归退化为离散点外的多线性插值,并推导出该极限下的低秩TT表示。在五资产篮子期权的八维参数空间(资产现价、行权价、利率、到期时间)上进行评估:对于欧式几何篮子看跌期权,该张量代理模型在更短训练时间内达到比标准GPR更低的测试误差,可扩展至更大的有效训练集;对于基于LSMC训练的美式算术篮子看跌期权,其随训练集规模增长的性能优于传统方法,单次查询可在毫秒级完成,整体运行时间主要受限于数据生成。
原文摘要 · Abstract (English)
We develop a tensor-network surrogate for option pricing, targeting large-scale portfolio revaluation problems arising in market risk management (e.g., VaR and Expected Shortfall computations). The method involves representing high-dimensional price surfaces in tensor-train (TT) form using TT-cross approximation, constructing the surrogate directly from black-box price evaluations without materializing the full training tensor. For inference, we use a Laplacian kernel and derive TT representations of the kernel matrix and its closed-form inverse in the noise-free setting, enabling TT-based Gaussian process regression without dense matrix factorization or iterative linear solves. We found that hyperparameter optimization consistently favors a large kernel length-scale and show that in this regime the GPR predictor reduces to multilinear interpolation for off-grid inputs; we also derive a low-rank TT representation for this limit. We evaluate the approach on five-asset basket options over an eight dimensional parameter space (asset spot levels, strike, interest rate, and time to maturity). For European geometric basket puts, the tensor surrogate achieves lower test error at shorter training times than standard GPR by scaling to substantially larger effective training sets. For American arithmetic basket puts trained on LSMC data, the surrogate exhibits more favorable scaling with training-set size while providing millisecond-level evaluation per query, with overall runtime dominated by data generation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。