Swing contract pricing: with and without neural networks
From MaRDI portal
Publication:6581630
DOI10.3934/fmf.2024007zbMATH Open1544.49026MaRDI QIDQ6581630
Gilles Pagès, Christian Yeo, Vincent Lemaire
Publication date: 31 July 2024
Published in: Frontiers of Mathematical Finance (Search for Journal in Brave)
Optimal stochastic control (93E20) Stochastic learning and adaptive control (93E35) Discrete approximations in optimal control (49M25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive computation of the invariant distribution of a diffusion
- Variational inequalities and the pricing of American options
- Numerical methods for the pricing of swing options: a stochastic control approach
- Stability in distribution for a class of singular diffusions
- Approximation and estimation bounds for artificial neural networks
- Multilayer feedforward networks are universal approximators
- Neural network regression for Bermudan option pricing
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Deep neural networks algorithms for stochastic control problems on finite horizon: numerical applications
- Convergence rates of Gibbs measures with degenerate minimum
- WHEN ARE SWING OPTIONS BANG-BANG?
- Valuation of Commodity-Based Swing Options
- Optimal Quantization for the Pricing of Swing Options
- Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
- Universal approximation bounds for superpositions of a sigmoidal function
- Monte Carlo valuation of American options
- Sensitivity Analysis Using Itô--Malliavin Calculus and Martingales, and Application to Stochastic Optimal Control
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- A Stochastic Approximation Method
- Neural network approximation
- Approximation by superpositions of a sigmoidal function
- Unadjusted Langevin algorithm with multiplicative noise: total variation and Wasserstein bounds
- Convergence of Langevin-simulated annealing algorithms with multiplicative noise
This page was built for publication: Swing contract pricing: with and without neural networks