Efficiently price high-dimensional Bermudan options using tensor compression.
problem High-dimensional option pricing with computational complexity.
method Hierarchical tensor compression for Monte Carlo and dual martingale methods.
result Tensor compression alleviates the curse of dimensionality for Bermudan option pricing.
We propose a new forward-backward stochastic differential equation solver for high-dimensional derivatives pricing problems by combining deep learning solver with least square regression technique widely used in the least square Monte Carlo method for the valuation of American options. Our numerical experiments demonst…
A new method uses Gaussian processes and deep kernel learning to price high-dimensional American options efficiently.
problem Challenges in pricing high-dimensional American options, especially with excessive computational costs.
method Modified Gaussian process regression with deep kernel learning and sparse variational Gaussian processes.
result The method outperforms least squares Monte Carlo in high-dimensional scenarios, especially with Merton's jump diffusion model.
The paper develops a new model for high-dimensional spatial arbitrage pricing.
problem Estimating spatial interactions in high-dimensional asset pricing.
method Integrates spatial interactions with multi-factor analysis using generalized shrinkage Yule-Walker (SYW) estimation.
result Established asymptotic properties for high-dimensional spatial arbitrage pricing models.
Paper uses ML for high-dimensional option pricing under uncertain volatility model.
problem High-dimensional option pricing under uncertain volatility.
method Two ML approaches: GTU and NNU.
result Significant improvement in option pricing precision.
Jointly tackles assortment and pricing in retail, using bandit models.
problem Maximizing revenue or profit in retail through optimal assortment and pricing.
method Contextual bandits with a flexible, interpretable model for high-dimensional contexts and actions.
result Proves lower regret compared to state-of-the-art methods in various bandit and pricing models.
Develops SPT with price impact, deriving formulas for wealth and arbitrage conditions.
problem Tackles price impact in high-dimensional markets.
method Incorporates nonlinear price impact and impact decay models.
result Derives master formula for trading strategies and wealth dynamics.
New online method for multivariate probabilistic electricity price forecasting.
problem Multivariate probabilistic forecasting of electricity prices.
method Online multivariate distributional regression with LASSO regularization.
result Robust and interpretable joint prediction intervals for 24-hour electricity prices.
Study evaluates Deep PDE solvers for high-dimensional option pricing, identifying key sources of error.
problem Empirical study on error analysis of Deep PDE solvers for high-dimensional option pricing.
method Comparative experiments with Deep BSDE method and other solvers, identifying three main sources of error.
result Deep BSDE method is superior and robust to option specifications, improving with larger batch sizes and fewer time steps.
The paper proposes a new algorithm for the high-dimensional financial data -- the Groupwise Interpretable Basis Selection (GIBS) algorithm, to estimate a new Adaptive Multi-Factor (AMF) asset pricing model, implied by the recently developed Generalized Arbitrage Pricing Theory, which relaxes the convention that the num…
Nowadays many financial derivatives, such as American or Bermudan options, are of early exercise type. Often the pricing of early exercise options gives rise to high-dimensional optimal stopping problems, since the dimension corresponds to the number of underlying assets. High-dimensional optimal stopping problems are,…
Deep BSDE method for pricing and hedging complex financial portfolios.
problem Simultaneous pricing and delta-gamma hedging of large portfolios of multi-asset Bermudan options.
method Discretely reflected BSDEs, One Step Malliavin scheme, neural network regression Monte Carlo method.
result Efficient and accurate pricing and hedging strategies for high-dimensional portfolios.
Develops a dynamic latent-factor model for high-dimensional asset characteristics.
problem Estimating asset pricing tests with high-dimensional data.
method Dynamic latent-factor model with Double Selection Lasso regularization.
result The inflation-mimicking portfolio in the crypto asset class has positive risk compensation.
Efficient method for high-dimensional American option pricing and hedging.
problem High-dimensional American option pricing and hedging.
method Gradient-enhanced sparse Hermite polynomial expansions combined with least squares Monte Carlo.
result Outperforms state-of-the-art methods in high dimensions with comparable computational cost.
Paper introduces a new IV regression method for mixed-frequency data.
problem Estimating high-dimensional slope parameters in mixed-frequency data.
method Tikhonov-regularized estimator for high-dimensional linear IV regression.
result High-dimensional slope parameter can be accurately estimated using a low-frequency instrumental variable.
Complexity helps identify sparse risk factors in asset pricing.
problem Tension between feature richness and economic parsimony in high-dimensional asset pricing.
method Expanding feature space and using basis pursuit to discover sparse risk factors.
result Nonlinear feature expansions combined with basis pursuit yield superior out-of-sample performance.
Quantum computing improves Monte Carlo option pricing for complex derivatives.
problem Complex financial derivatives require extensive computations in high-dimensional spaces.
method Developed a quantum algorithm for simulating many potential asset paths in parallel.
result Quantum algorithm provides highly accurate option pricing and risk analysis.
Deep neural networks approximate option prices in high-dimensional Lévy models efficiently.
problem Approximating option prices in high-dimensional financial models with jumps.
method Use of deep ReLU neural networks to approximate option prices in multivariate Lévy processes with polynomial growth in network size and dimension.
result Established sufficient conditions for polynomial growth in network size and dimension to approximate option prices with error ε.
We review and apply Quasi Monte Carlo (QMC) and Global Sensitivity Analysis (GSA) techniques to pricing and risk management (greeks) of representative financial instruments of increasing complexity. We compare QMC vs standard Monte Carlo (MC) results in great detail, using high-dimensional Sobol' low discrepancy sequen…
Tensor Neural Networks solve high-dimensional PDEs for financial pricing.
problem High-dimensional PDEs in financial pricing.
method Tensor Neural Networks (TNN) and Tensor Network Initializer (TNN Init).
result TNN provides significant parameter savings and faster training than DNN.
KANHedge improves hedging of high-dimensional options using learnable B-spline activation functions.
problem Challenges in high-dimensional option pricing and hedging due to the curse of dimensionality.
method Introduces KANHedge, a novel BSDE-based hedger leveraging Kolmogorov-Arnold Networks with learnable B-spline activation functions.
result KANHedge provides improved hedging performance, achieving significant reductions in hedging cost metrics.
Paper proposes a new dynamic pricing method with always-valid online statistical learning.
problem Designing dynamic pricing policies that adapt to online uncertainty and maintain validity.
method Regularized online statistical learning with theoretical guarantees and three major advantages.
result Proposed OORMLP pricing policy secures logarithmic regret in decision horizon.
Efficient method for pricing Bermudan moving average options using GPR-GHQ.
problem High-dimensional pricing of Bermudan moving average options in energy markets.
method Gaussian Process Regression and Gauss-Hermite quadrature.
result GPR-GHQ method efficiently handles long windows and high dimensionality.
Quantum computing speeds up option pricing for multiple assets.
problem High-dimensional integration bottleneck in option pricing.
method Calibrated marginal distributions, Gaussian copula, QAMC with QAE.
result QAMC reduces integration queries by 10-100 times for similar precision.
Pricing of high-dimensional options is one of the most important problems in Mathematical Finance. The objective of this manuscript is to present an original self-contained treatment of the multidimensional pricing. During the past decades the Black-Scholes this model, which essentially is based on the log-normal assum…
Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibration, and risk assessment need to be performed accurately and in real-time. Among the growing literature addressing this problem, Gass et al…
Deep neural network approximates multivariate option pricing.
problem High-dimensional partial differential equations in option pricing.
method Deep parametric PDE method using neural networks.
result Option prices computed in milliseconds for up to 25 dimensions.
A new deep learning method for option pricing in rough volatility models.
problem Efficient pricing of European options in high-dimensional rough volatility models.
method Time-stepping deep gradient flow method reformulating the option pricing PDE as an energy minimization problem.
result The method respects asymptotic behavior and known bounds for option prices.
Simulates multi-asset spot and option markets using normalizing flows.
problem High-dimensionality of market call prices and dynamic preservation across simulators.
method Normalizing flows for efficient low-dimensional representations, conditional invertibility for joint distribution calibration.
result Calibrated simulators maintain dynamics of each underlying and accurately represent market call prices.
We present here a regress later based Monte Carlo approach that uses neural networks for pricing high-dimensional contingent claims. The choice of specific architecture of the neural networks used in the proposed algorithm provides for interpretability of the model, a feature that is often desirable in the financial co…
Deep Penalty Method solves high-dimensional optimal stopping problems using deep learning.
problem High-dimensional optimal stopping problems in American option pricing.
method Inspired by penalty method for PDEs, approximates penalized PDE with Deep BSDE framework.
result Error bound of DPM is O ( 1 λ ) + O ( λ h ) + O ( h ) O(\frac{1}{\lambda}) + O(\lambda h) + O(\sqrt{h}) O ( λ 1 ) + O ( λh ) + O ( h ) . Study improves Hayashi-Yoshida estimator for high-dimensional stock covolatility.
problem Inconsistent performance of Hayashi-Yoshida estimator in high dimensions.
method Analyzed the limiting spectral distribution of the Hayashi-Yoshida estimator.
result Established the connection between the estimator's spectrum and the true covariance matrix in high dimensions.
Tensor trains speed up option pricing for multi-asset options.
problem Speeding up option pricing for multi-asset options.
method Tensor train learning algorithms to compress functions with parameter dependence.
result The proposed method outperforms Monte Carlo-based pricing in computational complexity.
The paper uses graph learning to detect valid instruments in high-dimensional data for house pricing.
problem Endogeneity bias and invalid instrument validation in high-dimensional data.
method Merge variable selection algorithms and probabilistic graphs to estimate house prices and causal structure.
result Efficient data-driven instrument selection and invalid instrument purge in high-dimensional data.
CB-APM uses analyst consensus as a bottleneck to interpret stock returns.
problem Tackles the challenge of understanding and predicting stock returns using professional beliefs.
method Embeds analyst consensus as a structural bottleneck, treating it as a sufficient statistic for market information.
result CB-APM portfolios exhibit strong monotonic return gradients and robust across different economic conditions.
New method optimizes share buyback contracts without optimal control's limitations.
problem High-dimensional state spaces and risk penalty selection issues in traditional methods.
method Applies optimized heuristic strategies and classical pricing methods.
result Maximizes contract value and disentangles repurchase from hedging.
A new stock index model simplifies high-dimensional stock data.
problem Reflecting the overall stock market activity in high-dimensional data.
method Manifold learning and feature detection on discrete Laplace-Beltrami operator.
result The MF index series approximates the stock market better and has lower risk.
A machine learning model manages portfolio risk in high dimensions.
problem Managing risk in high-dimensional financial portfolios.
method A supervised learning approach using replicating martingales and polynomial/neural network bases.
result The model outperforms naive Monte Carlo and least-squares Monte Carlo methods.
Deep learning for financial derivatives pricing and hedging.
problem Model-free pricing and optimal hedging of financial derivatives.
method Neural networks for offline training and online application.
result Accurate model-free price bounds and optimal hedging strategies.
New method smooths integrands for efficient option pricing.
problem Improving numerical performance of option pricing methods.
method Combining hierarchical adaptive sparse grids, quasi-Monte Carlo, and numerical smoothing.
result Improved efficiency of ASGQ and QMC methods for high-dimensional problems.
Deep RNNs compute American option prices and deltas efficiently.
problem Computing prices and deltas of high-dimensional American options.
method Two deep RNNs, one for price and one for delta, learn over spacetime.
result Linear time and constant memory cost compared to feedforward networks.
We consider dynamic pricing with many products under an evolving but low-dimensional demand model. Assuming the temporal variation in cross-elasticities exhibits low-rank structure based on fixed (latent) features of the products, we show that the revenue maximization problem reduces to an online bandit convex optimiza…
We conduct an extensive empirical study on short-term electricity price forecasting (EPF) to address the long-standing question if the optimal model structure for EPF is univariate or multivariate. We provide evidence that despite a minor edge in predictive performance overall, the multivariate modeling framework does …
A new deep learning model improves asset pricing predictions.
problem Improving asset pricing models for better predictions.
method Pseudo-Siamese Network (SNAP) for conditional asset pricing.
result The SNAP model outperforms benchmarks in out-of-sample prediction and Sharpe ratio.
A hybrid framework prices options using neural networks and VAE latent space.
problem Lack of explicit asset dynamics information in compressed volatility surfaces.
method Combining Weighted Monte Carlo with neural networks trained on VAE latent space.
result Effective pricing of vanilla and exotic options on idealized vol surface.
A neural network model tackles high-dimensional data with latent structures.
problem Modeling high-dimensional data with latent low-dimensional structures.
method Integrates PCA and Soft PCA layers into neural network architecture for factor modeling and non-linear transformations.
result Demonstrates improved performance in forecasting and nowcasting with real-world data.
The paper uses DNN for electricity price forecasting and XAI for understanding the factors.
problem Complex interactions and dependencies in electricity markets make it hard to understand price dynamics.
method Used DNN for forecasting and XAI (SHAP, Gradient, heatmaps) for understanding factors.
result Introduced novel concepts SSHAP values and SSHAP lines for enhanced representation of high-dimensional tabular models.
Study uses neural networks to improve option pricing accuracy.
problem Reducing variance in Monte Carlo estimators for option pricing.
method Characterizes neural networks' universal approximation property and applies it to sampling measures.
result Sampling measures generated by neural networks can approximate optimal measures arbitrarily well.