Paper: arXiv 2504.19717
Authors: Syoiti Ninomiya, Yuji Shinozaki
Abstract
This paper presents an algorithm for applying the high-order recombination method, originally introduced by Lyons and Litterer in ``High-order recombination and an application to cubature on Wiener space’’ (Ann. Appl. Probab. 22(4):1301–1327, 2012), to practical problems in mathematical finance. A refined error analysis is provided, yielding a sharper condition for space partitioning. Based on this condition, a computationally feasible recursive partitioning algorithm is developed. Numerical examples are also included, demonstrating that the proposed algorithm effectively avoids the explosive growth in the cardinality of the support required to achieve high-order approximations.
Complexity vs Empirical Score
- Math Complexity: 9.5/10
- Empirical Rigor: 3.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper is heavily mathematical, featuring advanced stochastic calculus, measure theory, and recursive algorithms with extensive LaTeX derivations, but lacks empirical backtests, datasets, or implementation-heavy details, focusing instead on theoretical algorithmic development.
Research Flowchart
flowchart TD A["Research Goal<br>Develop a computationally feasible<br>high-order recombination algorithm<br>for weak approximation of SDEs"] --> B["Key Methodology<br>Refined Error Analysis &<br>Recursive Partitioning Condition"] B --> C["Data/Input<br>Stochastic Differential Equations<br>in Mathematical Finance"] C --> D["Computational Process<br>High-Order Recombination &<br>Cardinality Control"] D --> E["Key Outcomes<br>Sharper partitioning criteria,<br>explosive growth avoidance,<br>high-order accuracy in finance"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a high-order recombination algorithm for weak approximation of SDEs, including a refined error analysis and a recursive partitioning method.
Source sentence
Based on this condition, a computationally feasible recursive partitioning algorithm is developed.
Assumes 4
- The vector fields in the SDE satisfy the UFG condition. model
Source sentence
Assume that the vector fields in the SDE (1) satisfy the UFG condition, that X is the diffusion process defined by (1), and that Q(s) is an m-similar operator.
- The vector fields satisfy the uniform Hörmander (UH) condition. model
Source sentence
The vector fields V0, V1, . . . , Vd are said to satisfy the uniform H¨ormandar (UH) condition if there exists ℓ∈N such that ...
- Test functions are distinct homogeneous polynomials of degree at most m, with g1(x)=1 and gi(0)=0 for i>1. other
Source sentence
we consider the set of test functions G to consist of distinct homogeneous polynomials of degree at most m and we assume that g1(x) = 1 and g2(0) = g3(0) = · · · = gMG(0) = 0.
- The payoff function f belongs to CLip(RN;R). statistical
Source sentence
In the original work of Kusuoka [11, 13], Theorem 2 is proved under the assumption that f ∈C∞b (RN; R). This assumption can, however, be relaxed to f ∈CLip(RN; R), as pointed out in Section 3 of [18].
Data
Synthetic data only.
Costs
Not applicable
Finds 4
- The refined error analysis yields a sharper condition for space partitioning, allowing a feasible recursive partitioning algorithm. theoretical
Source sentence
A refined error analysis is provided, yielding a sharper condition for space partitioning.
- The proposed algorithm avoids the explosive growth in the cardinality of the support required for high-order approximations. theoretical
Source sentence
Numerical examples are also included, demonstrating that the proposed algorithm effectively avoids the explosive growth in the cardinality of the support required to achieve high-order approximations.
- Recombination does not compromise the order of the discretisation error under the LL patch condition. theoretical
Source sentence
In other words, the recombination does not compromise the order of the discretisation error.
- Theorem 5 refines Theorem 4 by incorporating patch weights as well as radii, improving error bounds. theoretical
Source sentence
Taking the weight of each patch into account yields Theorem 5 below, which refines Theorem 4 by incorporating not only the radii of the patches but also their weights.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 28 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.