Improving the Interpretability of Artificial Neural Networks Using the Example of the Pricing Options Problems

In this paper, we demonstrate how to improve the interpretability of neural networks using standard problems of computational finance as an example. In our first approach, we justify that a feedforward neural network with one hidden layer and positive weights is a natural approximator for general cumulative distribution functions of continuous random variables. Using this kind of interpretation, we design a neural network architecture that, as a result of training, leads to a neural network analogue of the classical Black–Scholes formula. The main advantage of our second approach for the numerical solution of the Black–Scholes equation is that, based on theoretically justified formulas for the approximating neural network, we can analytically calculate the loss function at each training iteration.

Authors

Institutions

Publication Details

Journal
Journal of Communications Technology and Electronics
Published
2024-12-01
DOI
https://doi.org/10.1134/s106422692570007x
Primary Topic
Statistical and Computational Modeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improving the Interpretability of Artificial Neural Networks Using the Example of the Pricing Options Problems

Oleg Kudryavtsev, D. V. Postolova
Journal of Communications Technology and Electronics
Statistical and Computational Modeling
article

Improving the Interpretability of Artificial Neural Networks Using the Example of the Pricing Options Problems

Oleg Kudryavtsev, D. V. Postolova
article en

Abstract

In this paper, we demonstrate how to improve the interpretability of neural networks using standard problems of computational finance as an example. In our first approach, we justify that a feedforward neural network with one hidden layer and positive weights is a natural approximator for general cumulative distribution functions of continuous random variables. Using this kind of interpretation, we design a neural network architecture that, as a result of training, leads to a neural network analogue of the classical Black–Scholes formula. The main advantage of our second approach for the numerical solution of the Black–Scholes equation is that, based on theoretically justified formulas for the approximating neural network, we can analytically calculate the loss function at each training iteration.

Journal of Communications Technology and ElectronicsVol. 69(10-12)
Southern Federal University (RU), Don State Technical University (RU)
Openalex Percentile: Top 74%
Statistical and Computational Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.