STN-GPR: A Singularity Tensor Network Framework for Efficient Option Pricing

• URL: http://arxiv.org/abs/2603.26318v1
• Date: Fri, 27 Mar 2026 11:35:03 GMT
• Title: STN-GPR: A Singularity Tensor Network Framework for Efficient Option Pricing
• Abstract summary: We develop a tensor-network surrogate for option pricing, targeting large-scale portfolio revaluation problems.<n>For European basket puts, the tensor surrogate achieves lower test error at shorter training times than standard GPR by scaling to substantially larger effective training sets.<n>For American arithmetic basket puts, the surrogate exhibits more favorable scaling with training-set size while providing millisecond-level evaluation per query.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Randomized neural operator for parametric PDEs with fast training and conformal uncertainty quantification [47.720075875232226]
  We introduce PCA--RaNN, a neural operator that combines a PCA-based dimensionality reduction with fixed random features.<n>It recasts operator learning as fixed regression, reducing latent regression to three orders of magnitude.
  arXiv  Detail & Related papers  (2026-06-28T15:02:26Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• Dimensionality Reduction for Robust Federated Learning: A Theoretical Analysis and Convergence Guarantee [14.954293251332894]
  Federated Learning (FL) enables clients to collaboratively train models without sharing raw data, but it is highly vulnerable to Byzantine attacks.<n>Existing robust approaches can neutralize these threats but incur substantial computational overhead.<n>We propose a universal acceleration framework for vector-level distance-based robust aggregators.
  arXiv  Detail & Related papers  (2026-05-27T11:39:47Z)
• Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs [56.246783503873225]
  This paper revisits the weighted strategy for non-stationary parametric bandits.<n>We propose a simpler weight-based algorithm that is as efficient as window/restart-based algorithms.<n>Our framework can be used to improve regret bounds of other parametric bandits.
  arXiv  Detail & Related papers  (2026-01-03T04:50:21Z)
• Laplace Approximation For Tensor Train Kernel Machines In System Identification [6.101839518775971]
  We introduce a Bayesian tensor train kernel machine that applies Laplace approximation to estimate the posterior distribution over a selected TT-core.<n>Experiments show that core selection is largely independent of TT-ranks and feature structure, and that VI replaces cross-validation while offering up to 65x faster training.
  arXiv  Detail & Related papers  (2025-12-02T08:55:59Z)
• Test time training enhances in-context learning of nonlinear functions [51.56484100374058]
  Test-time training (TTT) enhances model performance by explicitly updating designated parameters prior to each prediction.<n>We investigate the combination of TTT with in-context learning (ICL), where the model is given a few examples from the target distribution at inference time.
  arXiv  Detail & Related papers  (2025-09-30T03:56:44Z)
• PT$^2$-LLM: Post-Training Ternarization for Large Language Models [52.4629647715623]
  Large Language Models (LLMs) have shown impressive capabilities across diverse tasks, but their large memory and compute demands hinder deployment.<n>We propose PT$2$-LLM, a post-training ternarization framework tailored for LLMs.<n>At its core is an Asymmetric Ternary Quantizer equipped with a two-stage refinement pipeline.
  arXiv  Detail & Related papers  (2025-09-27T03:01:48Z)
• Decentralized Nonconvex Composite Federated Learning with Gradient Tracking and Momentum [78.27945336558987]
  Decentralized server (DFL) eliminates reliance on client-client architecture.<n>Non-smooth regularization is often incorporated into machine learning tasks.<n>We propose a novel novel DNCFL algorithm to solve these problems.
  arXiv  Detail & Related papers  (2025-04-17T08:32:25Z)
• Making Sense of Touch: Unsupervised Shapelet Learning in Bag-of-words Sense [0.0]
  This paper introduces NN-STNE, a neuralization network using t-distributed neighbor manipulation (t-SNE) data to reduce input dimensions by mapping as to shapelet data.
  arXiv  Detail & Related papers  (2025-02-06T15:50:40Z)
• Lean and Mean Adaptive Optimization via Subset-Norm and Subspace-Momentum with Convergence Guarantees [5.399838579600896]
  We introduce two complementary complement techniques for efficient optimization that reduce memory requirements while accelerating training of large-scale neural networks.<n>The first technique, Subset-m step size, generalizes AdaGrad-Norm and AdaGrad(-Norm) through step-size sharing.<n>The second technique, Subspace-Momentum, reduces the momentum state's memory footprint by momentum to a low-dimensional subspace.
  arXiv  Detail & Related papers  (2024-11-11T16:48:07Z)
• Truncated tensor Schatten p-norm based approach for spatiotemporal traffic data imputation with complicated missing patterns [77.34726150561087]
  We introduce four complicated missing patterns, including missing and three fiber-like missing cases according to the mode-drivenn fibers. Despite nonity of the objective function in our model, we derive the optimal solutions by integrating alternating data-mputation method of multipliers.
  arXiv  Detail & Related papers  (2022-05-19T08:37:56Z)
• STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization [74.1615979057429]
  We investigate non-batch optimization problems where the objective is an expectation over smooth loss functions. Our work builds on the STORM algorithm, in conjunction with a novel approach to adaptively set the learning rate and momentum parameters.
  arXiv  Detail & Related papers  (2021-11-01T15:43:36Z)
• Semi-orthogonal Embedding for Efficient Unsupervised Anomaly Segmentation [6.135577623169028]
  We generalize an ad-hoc method, random feature selection, into semi-orthogonal embedding for robust approximation. With the scrutiny of ablation studies, the proposed method achieves a new state-of-the-art with significant margins for the MVTec AD, KolektorSDD, KolektorSDD2, and mSTC datasets.
  arXiv  Detail & Related papers  (2021-05-31T07:02:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.