IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2601.05290.html

Multi-Period Martingale Optimal Transport: Classical Theory, Neural Acceleration, and Financial Applications

Author

Listed:
  • Sri Sairam Gautam B

Abstract

This paper develops a computational framework for Multi-Period Martingale Optimal Transport (MMOT), addressing convergence rates, algorithmic efficiency, and financial calibration. Our contributions include: (1) Theoretical analysis: We establish discrete convergence rates of $O(\sqrt{\Delta t} \log(1/\Delta t))$ via Donsker's principle and linear algorithmic convergence of $(1-\kappa)^{2/3}$; (2) Algorithmic improvements: We introduce incremental updates ($O(M^2)$ complexity) and adaptive sparse grids; (3) Numerical implementation: A hybrid neural-projection solver is proposed, combining transformer-based warm-starting with Newton-Raphson projection. Once trained, the pure neural solver achieves a $1{,}597\times$ online inference speedup ($4.7$s $\to 2.9$ms) suitable for real-time applications, while the hybrid solver ensures martingale constraints to $10^{-6}$ precision. Validated on 12,000 synthetic instances (GBM, Merton, Heston) and 120 real market scenarios.

Suggested Citation

  • Sri Sairam Gautam B, 2026. "Multi-Period Martingale Optimal Transport: Classical Theory, Neural Acceleration, and Financial Applications," Papers 2601.05290, arXiv.org, revised Apr 2026.
    • Handle: RePEc:arx:papers:2601.05290
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2601.05290
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. NESTEROV, Yurii, 2012. "Efficiency of coordinate descent methods on huge-scale optimization problems," LIDAM Reprints CORE 2511, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Blanka Horvath & Aitor Muguruza & Mehdi Tomas, 2021. "Deep learning volatility: a deep neural network perspective on pricing and calibration in (rough) volatility models," Quantitative Finance, Taylor & Francis Journals, vol. 21(1), pages 11-27, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Changqing Teng & Guanglian Li, 2025. "Efficient Simulation and Calibration of the Rough Bergomi Model via Wasserstein Distance," Papers 2512.00448, arXiv.org, revised Apr 2026.
    2. Patrick Büchel & Michael Kratochwil & Maximilian Nagl & Daniel Rösch, 2022. "Deep calibration of financial models: turning theory into practice," Review of Derivatives Research, Springer, vol. 25(2), pages 109-136, July.
    3. Xuefei Lu & Alessandro Rudi & Emanuele Borgonovo & Lorenzo Rosasco, 2020. "Faster Kriging: Facing High-Dimensional Simulators," Operations Research, INFORMS, vol. 68(1), pages 233-249, January.
    4. Eduardo Abi Jaber & Shaun & Li, 2024. "Volatility models in practice: Rough, Path-dependent or Markovian?," Papers 2401.03345, arXiv.org, revised Apr 2025.
    5. Alessio Brini & David A. Hsieh & Patrick Kuiper & Sean Moushegian & David Ye, 2025. "Empirical Models of the Time Evolution of SPX Option Prices," Papers 2506.17511, arXiv.org.
    6. Hyun-Gyoon Kim & Hyeongmi Kim & Jeonggyu Huh, 2025. "Considering Appropriate Input Features of Neural Network to Calibrate Option Pricing Models," Computational Economics, Springer;Society for Computational Economics, vol. 66(1), pages 77-104, July.
    7. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Andrej Čopar & Blaž Zupan & Marinka Zitnik, 2019. "Fast optimization of non-negative matrix tri-factorization," PLOS ONE, Public Library of Science, vol. 14(6), pages 1-15, June.
    9. Duy Khuong Nguyen & Tu Bao Ho, 2017. "Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization," Journal of Global Optimization, Springer, vol. 68(2), pages 307-328, June.
    10. Abbaszadehpeivasti, Hadi & de Klerk, Etienne & Zamani, Moslem, 2023. "Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming," Other publications TiSEM 88512ac0-c26a-4a99-b840-3, Tilburg University, School of Economics and Management.
    11. Jiří Witzany & Milan Fičura, 2023. "Machine Learning Applications to Valuation of Options on Non-liquid Markets," FFA Working Papers 5.001, Prague University of Economics and Business, revised 24 Jan 2023.
    12. Guo, Jingjun & Kang, Weiyi & Wang, Yubing, 2024. "Multi-perspective option price forecasting combining parametric and non-parametric pricing models with a new dynamic ensemble framework," Technological Forecasting and Social Change, Elsevier, vol. 204(C).
    13. Lijuan Wang & Yijia Hu & Yan Zhou, 2024. "Cross-border Commodity Pricing Strategy Optimization via Mixed Neural Network for Time Series Analysis," Papers 2408.12115, arXiv.org.
    14. Ion Necoara & Andrei Patrascu, 2014. "A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints," Computational Optimization and Applications, Springer, vol. 57(2), pages 307-337, March.
    15. Sjur Didrik Flåm, 2019. "Blocks of coordinates, stochastic programming, and markets," Computational Management Science, Springer, vol. 16(1), pages 3-16, February.
    16. Villarino, Joel P. & Leitao, Alvaro, 2026. "On deep learning for computing the dynamic initial margin and margin value adjustment," Applied Mathematics and Computation, Elsevier, vol. 510(C).
    17. David Degras, 2021. "Sparse group fused lasso for model segmentation: a hybrid approach," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(3), pages 625-671, September.
    18. Masoud Ahookhosh & Le Thi Khanh Hien & Nicolas Gillis & Panagiotis Patrinos, 2021. "A Block Inertial Bregman Proximal Algorithm for Nonsmooth Nonconvex Problems with Application to Symmetric Nonnegative Matrix Tri-Factorization," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 234-258, July.
    19. Jian Lv & Chenxu Wang & Wenyong Yuan & Zhenyi Zhang, 2025. "The Study on Option Pricing Based on Wiener–Itô Chaos Expansion and Generative Adversarial Networks," Computational Economics, Springer;Society for Computational Economics, vol. 66(4), pages 2675-2713, October.
    20. Ion Necoara & Yurii Nesterov & François Glineur, 2017. "Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 227-254, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2601.05290. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.