A New Trinomial Recombination Tree Algorithm and Its Applications
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “trinomial trees”
Method uses trinomial trees to price nontraditional options.
problem Pricing of random-expiry options with early expiry.
method Developed a trinomial tree approach to interpret early expiry.
result The method is free of arbitrage and can be implemented efficiently.
We extend the classical Cox-Ross-Rubinstein binomial model in two ways. We first develop a binomial model with time-dependent parameters that equate all moments of the pricing tree increments with the corresponding moments of the increments of the limiting Itô price process. Second, we introduce a new trinomial model i…
Hedging via Perpetual Derivatives: Trinomial Option Pricing and Implied Parameter Surface Analysisq-fin.MF
We develop a trinomial tree model for pricing perpetual derivatives and European options.
problem Pricing perpetual derivatives and European options in a market with two risky assets and a perpetual derivative of one of them.
method We introduce a recombining trinomial tree model, consider a market with two risky assets and a perpetual derivative, and use a replicating portfolio to price options and generate relationships between risk-neutral and real-world parameters.
result We develop implied parameter surfaces for real-world parameters in the model using historical data.
Researchers use Mellin-Barnes integrals to study trinomial equations and their braids.
problem Analyzing the roots of trinomial algebraic equations.
method Global analytic continuation and Mellin-Barnes integral representations.
result Precise description of the Galois group of trinomial equations.
Study scaling limits for option pricing in trinomial models.
problem Analyzing exponential hedging in trinomial models converging to Black-Scholes.
method Purely probabilistic approach using duality, martingale, and weak-convergence techniques.
result Derives a scaling limit for exponential certainty-equivalent prices in trinomial models.
Develops trinomial models using cubature methods for financial derivative pricing.
problem Pricing financial derivatives in complex stochastic market models.
method Cubature methods applied to Wiener space for constructing trinomial models.
result Numerical solutions compare favorably with Black-Scholes model.
Researchers tackle insider trading in incomplete markets using a discrete-time jump process approach.
problem Tackles insider trading in incomplete markets under the trinomial model.
method Uses a marked binomial process and stochastic analysis with Malliavin calculus.
result Identifies insider expected additional utility with Shannon entropy of extra information.
Abstract and counterexamples show limitations of cost-efficiency in incomplete markets.
problem Understanding cost-efficiency in incomplete financial markets.
method Simple 3-state model and expected utility maximization problem.
result Characterization of perfectly cost-efficient claims and its application to incomplete markets.
The paper develops a valuation framework for GLWB-LTC contracts with Levy dynamics and stochastic interest rates.
problem Valuation of GLWB-LTC contracts with financial guarantees, longevity protection, and health-contingent LTC payments.
method Coupling a recombining Hull-White trinomial tree with an IMEX finite difference scheme, incorporating a seven-state health model.
result Hybrid tree-IMEX method delivers stable long-maturity prices consistent with simulation benchmarks.
An explicit formula is derived for the value of weak information in a discrete time model that works for a wide range of utility functions including the logarithmic and power utility. We assume a complete market with a finite number of assets and a finite number of possible outcomes. Explicit calculations are performed…
We consider the mean-variance hedging problem under partial Information. The underlying asset price process follows a continuous semimartingale and strategies have to be constructed when only part of the information in the market is available. We show that the initial mean variance hedging problem is equivalent to a ne…
First, we consider the problem of hedging in complete binomial models. Using the discrete-time Föllmer-Schweizer decomposition, we demonstrate the equivalence of the backward induction and sequential regression approaches. Second, in incomplete trinomial models, we examine the extension of the sequential regression app…
There is a vast literature on numerical valuation of exotic options using Monte Carlo, binomial and trinomial trees, and finite difference methods. When transition density of the underlying asset or its moments are known in closed form, it can be convenient and more efficient to utilize direct integration methods to ca…
New algorithms speed up American option pricing significantly.
problem Efficiently pricing American options in finance.
method Parallel discrete-time finite-difference algorithms using Fast Fourier Transform.
result Significant improvement in time complexity and performance.
Correlations in the Bond-Future Marketcond-mat.stat-mech
We analyze the time series of overnight returns for the bund and btp futures exchanged at LIFFE (London). The overnight returns of both assets are mapped onto a one-dimensional symbolic-dynamics random walk: The `bond walk'. During the considered period (October 1991 - January 1994) the bund-future market opened earlie…
Boosting meta-trees improve decision tree performance.
problem Overfitting in decision trees.
method Boosting approach to construct multiple meta-trees.
result Ensembles of meta-trees prevent overfitting.
The paper studies geometric properties of quasi-trees and tree approximations.
problem Geometric properties and tree approximations of quasi-trees.
method Construction of a tree approximating quasi-trees, proving quasi-isometric properties.
result Every quasi-tree is -quasi-isometric to a simplicial tree.
Efficiently updates posterior tree distributions over meta-trees.
problem Updating posterior distributions over meta-trees efficiently.
method Batch updating method for posterior tree distributions.
result More efficient batch updating method.
This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for preferring the multiple tree approach. Ideally, we would like to consider predictio…
We introduce a novel incremental decision tree learning algorithm, Hoeffding Anytime Tree, that is statistically more efficient than the current state-of-the-art, Hoeffding Tree. We demonstrate that an implementation of Hoeffding Anytime Tree---"Extremely Fast Decision Tree", a minor modification to the MOA implementat…
We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…
This paper introduces TNTK to study infinite soft tree ensembles.
problem Understanding the behavior of infinite soft tree ensembles.
method Introduced Tree Neural Tangent Kernel (TNTK) to analyze infinite soft tree ensembles.
result Identified several non-trivial properties of infinite soft tree ensembles.
Paper analyzes soft tree ensembles using NTK, finding only leaf count matters.
problem Understanding impact of various tree architectures in ensemble learning.
method Formulated and analyzed Neural Tangent Kernel (NTK) for soft tree ensembles.
result Only the number of leaves at each depth is relevant for tree architecture in ensemble learning.
Researchers improve tree model recovery from noisy data.
problem Learning tree structured models from corrupted data.
method Linear latent tree models and continuous corruption model.
result Chow-Liu algorithm consistently learns tree from noisy data.
Optimal survival trees ensemble reduces tree count and improves predictive performance.
problem Improving predictive performance in survival analysis.
method Grows a forest of optimal survival trees by ranking and selecting the best trees based on out-of-bag error.
result Reduces the number of trees in the ensemble while improving predictive performance.
Width trees link link invariants and bridge number.
problem Understanding link invariants through geometric structures.
method Associate width trees to links and use their geometric properties to bound link invariants.
result Width trees uniquely realize certain link invariants under specific conditions.
Paper studies ensemble probabilistic regression trees for smooth approximations.
problem Smooth approximations of regression functions.
method Ensemble versions of probabilistic regression trees.
result Ensemble probabilistic regression trees are consistent and perform well.
The task of translating between programming languages differs from the challenge of translating natural languages in that programming languages are designed with a far more rigid set of structural and grammatical rules. Previous work has used a tree-to-tree encoder/decoder model to take advantage of the inherent tree s…
Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly trained with backpropagation, like a neural network. Even though this continuity …
Characterizes fundamental groups of disjointly tree-graded spaces.
problem Understanding fundamental groups of complex geometric structures.
method Defines and analyzes disjointly tree-graded spaces, characterizing their fundamental groups.
result Fundamental groups of disjointly tree-graded spaces embed into inverse limits of free products of fundamental groups of pieces.
SBT model uses randomized sharding and sub-models to improve Bayesian Additive Regression Trees.
problem Improving efficiency and accuracy of Bayesian Additive Regression Trees.
method Randomized sharding, sub-models, intersection tree structure, optimal design.
result Theoretical optimal weights and worst-case complexity of SBT model.
Decision Machines embeds decision trees into vector spaces for improved optimization.
problem Overfitting and difficulty in finding optimal decision tree structure.
method Embedding Boolean tests into a binary vector space and representing tree structure as matrices.
result Optimized decision trees with enhanced predictive power.
Trees and their products compared to octahedron.
problem Comparing trees and their products to octahedron.
method Product comparison of trees to octahedron.
result Trees and their products meet octahedron comparison.
Tree Index evaluates cluster quality by creating decision trees from data.
problem Evaluating the quality of cluster results from various techniques.
method Tree Index creates a decision tree from clustered data, combining entropy and depth of leaves.
result Tree Index discriminates between sensible and non-sensible clusters on brain dataset.
TES-AE uses tree grammars to speed up autoencoding for tree data.
problem Challenges in autoencoding tree data due to its non-vectorial and discrete nature.
method TES-AE combines reservoir computing with tree grammars for faster training.
result TES-AE outperforms D-VAE in speed and accuracy for tree data.
Flexible tree ensemble learning framework supports arbitrary loss functions and multi-task learning.
problem Limited modeling capabilities of existing tree ensemble learning toolkits.
method Differentiable tree ensembles with tensor-based formulation for efficient training.
result Our framework leads to 100x more compact and 23% more expressive tree ensembles.
Kauri is a novel unsupervised binary tree for clustering that outperforms existing methods.
problem Learning a tree end-to-end for clustering without labels is an open challenge.
method Greedy maximization of the kernel KMeans objective without centroids.
result Kauri often outperforms existing unsupervised clustering methods, especially with non-linear kernels.
We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…
HATT improves online decision tree ensembles by using a more eager splitting strategy.
problem Improving the efficiency of online decision tree ensembles.
method Replacing Hoeffding Tree's split strategy with HATT, which uses the Hoeffding Test for candidate splits.
result HATT outperforms Hoeffding Tree in online bagging and boosting ensembles, as shown by significant performance improvements in various testbenches.
Optimal Survival Trees improve accuracy in medical data analysis.
problem Analyzing censored outcomes in medical data.
method Mixed-integer optimization and local search techniques.
result Improves accuracy in large datasets compared to existing methods.
A novel tree algorithm improves time series forecasting accuracy.
problem Improving accuracy in non-linear time series forecasting.
method Developed a hierarchical TAR model as a regression tree that trains globally across series, introducing a forecasting-specific tree algorithm with cross-series learning.
result Significantly higher accuracy than state-of-the-art tree-based algorithms and benchmarks across four metrics.
Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from a tree ensemble, and calculates frequent variable interactions. An rule-based le…
Thin Tree Positionmath.CO
We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…
Uniformly branching treesmath.CV
Uniformly branching trees are equivalent to certain metric spaces.
problem Characterizing metric spaces equivalent to uniformly branching trees.
method Proving equivalence between trivalent quasiconformal trees and uniformly branching trees.
result Any two uniformly branching trees are quasisymmetrically equivalent.
ForestPrune optimizes tree ensemble pruning for compactness and speed.
problem Large tree ensembles in predictive models consume excessive memory and reduce interpretability.
method Developed a specialized optimization algorithm to efficiently prune tree ensembles by depth layers.
result ForestPrune produces compact, high-performing models that outperform existing post-processing methods.
PhyloVAE learns tree topologies without supervision.
problem Learning accurate tree representations from evolutionary data.
method Unsupervised learning via variational autoencoders with efficient tree generation.
result PhyloVAE generates high-resolution tree topologies efficiently.
Latent tree modelsmath.ST
Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in:…