Gaussian Recombining Split Tree
Binomial trees are widely used in the financial sector for valuing securities with early exercise characteristics, such as American stock options. However, while effective in many scenarios, pricing options with CRR binomial trees are limited. Major limitations are volatility estimation, constant volatility assumption, subjectivity in parameter choices, and impracticality of instantaneous delta hedging. This paper presents a novel tree: Gaussian Recombining Split Tree (GRST), which is recombining and does not need log-normality or normality market assumption. GRST generates a discrete probability mass function of market data distribution, which approximates a Gaussian distribution with known parameters at any chosen time interval. GRST Mixture builds upon the GRST concept while being flexible to fit a large class of market distributions and when given a 1-D time series data and moments of distributions at each time interval, fits a Gaussian mixture with the same mixture component probabilities applied at each time interval. Gaussian Recombining Split Tre Mixture comprises several GRST tied using Gaussian mixture component probabilities at the first node. Our extensive empirical analysis shows that the option prices from the GRST align closely with the market.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Compositional Servoing by Recombining Demonstrations
Learning-based manipulation policies from image inputs often show weak task transfer capabilities. In contrast, visual servoing methods allow efficient task transfer in high-precision scenarios while requiring only a few…
Node Splitting SVMs for Survival Trees Based on an L2-Regularized Dipole Splitting Criteria
This paper proposes a novel, node-splitting support vector machine (SVM) for creating survival trees. This approach is capable of non-linearly partitioning survival data which includes continuous, right-censored outcomes…
Merging MCMC Subposteriors through Gaussian-Process Approximations
Markov chain Monte Carlo (MCMC) algorithms have become powerful tools for Bayesian inference. However, they do not scale well to large-data problems. Divide-and-conquer strategies, which split the data into batches and, …
Bayesian InferenceMIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound
Streaming decision trees are natural candidates for open-world continual learning, as they perform local updates, enjoy bounded memory, and static decision boundaries. Despite these, they still fail in online class-incre…
class-incremental learningContinual LearningComplementary Theory of Evolutionary Genetics
This theory seeks to define species and to explore evolutionary forces and genetic elements in speciation and species maintenance. The theory explains how speciation and species maintenance are caused by natural selectio…