Research
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

3775112149 · May 202619922001200920172026
48 results for recursive equations

The paper explores generalizations of Mirzakhani's recursion and computes volumes for physical gravity models.

problem Computing volumes for physical gravity models.
method Topological recursion and physical two-dimensional gravity models.
result Derivation of Virasoro constraints and cut-and-join equations for generalized Mirzakhani's recursions.

This paper develops efficient algorithms for multibody dynamics using screw and Lie group theory.

problem Efficient modeling and computation of multibody systems.
method Recursive algorithms and Lie group formulations for multibody dynamics.
result Derivation of efficient Newton-Euler and Lagrange equations for multibody systems.

We derive a recursion relation for hyperbolic string vertices and apply it to string field theory.

problem Deriving a recursion relation for hyperbolic string vertices and its implications for string field theory.
method Using systolic volumes and a modified Mirzakhani's recursion, we construct a higher-order vertex determination for hyperbolic string field theory.
result The higher order vertices in hyperbolic string field theory are determined by the cubic vertex iteratively for any background.

The paper studies risk-sensitive MDPs with recursive risk measures.

problem Risk-sensitive decision-making in MDPs with unbounded costs.
method Recursive application of static risk measures, Bellman equation derivation, existence of optimal policies.
result Existence of Markovian optimal policies for infinite planning horizons, contractive model for stationary optimal policy.

Using methods of math.DG/0304245 and [I.S.Krasil'shchik and P.H.M.Kersten, Symmetries and recursion operators for classical and supersymmetric differential equations, Kluwer, 2000], we accomplish an extensive study of the N=1 supersymmetric Korteweg-de Vries equation. The results include: a description of local and non…

2003-05-15abs ↗pdf ↗

Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.

problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.

Deep learning solves dynamic programming with recursive utility.

problem Challenges in solving high-dimensional discrete-time dynamic programming problems with recursive utility.
method Certainty Equivalent Learning (CEL) algorithm that learns certainty-equivalent value directly with neural networks.
result Accurate value and policy approximations in high-dimensional problems, comparable to VFI in some cases.

Solves optimal stopping problem with Poisson constraints using jumps.

problem Optimal stopping with Poisson constraints and jumps.
method Penalized backward stochastic differential equation (PBSDE) with jumps, decomposition method based on Jacod-Pham, comparison theorem of BSDEs with jumps.
result Solves American option pricing in nonlinear markets with Poisson constraints.

Study uses reinforcement learning to optimize portfolios under recursive utility.

problem Improving portfolio allocation using risk-sensitive objectives.
method Approximated certainty equivalent via Monte Carlo, trained actor-critic algorithms (PPO, A2C).
result Recursive-utility agent outperforms discounted baseline in Sharpe ratio, max drawdown, and cumulative return.

This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.

problem Improving learning dynamics in recursive ensemble learning.
method Develops second-order recursive architectures with Fibonacci-type update flows.
result Establishes global convergence conditions and generalization bounds for recursive ensembles.

We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain evaluations of <G,kc> grow exponentially as k goes to infinity and the growth rate…

2014-03-10abs ↗pdf ↗

In this paper, we give some new genus-3 universal equations for Gromov-Witten invariants of compact symplectic manifolds. These equations were obtained by studying new relations in the tautological ring of the moduli space of 2-pointed genus-3 stable curves. A byproduct of our search for genus-3 equations is a new genu…

2011-04-22abs ↗pdf ↗

This paper concerns the recursive utility maximization problem. We assume that the coefficients of the wealth equation and the recursive utility are concave. Then some interesting and important cases with nonlinear and nonsmooth coefficients satisfy our assumption. After given an equivalent backward formulation of our …

2016-07-04abs ↗pdf ↗

Paper develops a high-order recombination algorithm for financial modeling.

problem Creating accurate approximations of stochastic differential equations in finance.
method High-order recombination method applied to practical financial problems.
result Algorithm effectively avoids explosive growth in support cardinality for high-order approximations.

Researchers study heavy-tail properties of SGD using stochastic recurrence equations.

problem Analyzing heavy-tail properties of Stochastic Gradient Descent (SGD).
method Modeling SGD iterations as multivariate affine stochastic recursions and applying the theory of irreducible-proximal (i-p) matrices.
result Extended results of Gürbüzbalaban et al. (2020) by using the theory of i-p matrices.

We find a remarkable subalgebra of higher symmetries of the elliptic Euler-Darboux equation. To this aim we map such equation into its hyperbolic analogue already studied by Shemarulin. Taking into consideration how symmetries and recursion operators transform by this complex contact transformation, we explicitly give …

2006-02-08abs ↗pdf ↗

A twistor construction of the hierarchy associated with the hyper-Kähler equations on a metric (the anti-self-dual Einstein vacuum equations, ASDVE, in four dimensions) is given. The recursion operator R is constructed and used to build an infinite-dimensional symmetry algebra and in particular higher flows for the hyp…

2000-01-03abs ↗pdf ↗

This research extends topological recursion to hyperbolic surfaces with tight boundaries and conical defects.

problem Calculating volumes of hyperbolic surfaces with special boundaries.
method Generalized topological recursion to handle tight boundaries and conical defects.
result Weil-Petersson volumes are polynomial in boundary lengths for hyperbolic surfaces with tight boundaries and conical defects.

We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based approach and aim to provide a tutorial to the computations.

2011-10-20abs ↗pdf ↗

Combines neural networks with splitting-up method for filtering equations.

problem Approximating the solution of filtering equations for signal processes.
method Combines splitting-up method with neural networks.
result Produces an approximation of the unnormalised conditional distribution.

CEFOL uses deep learning for dynamic programming with recursive utility.

problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.

Quantization techniques have been applied in many challenging finance applications, including pricing claims with path dependence and early exercise features, stochastic optimal control, filtering problems and efficient calibration of large derivative books. Recursive Marginal Quantization of the Euler scheme has recen…

2017-01-06abs ↗pdf ↗

Rediscovered by a systematic search, a forgotten class of integrable surfaces is shown to disprove the Finkel-Wu conjecture. The associated integrable nonlinear partial differential equation zyy+(1/z)xx+2=0 z_{yy} + (1/z)_{xx} + 2 = 0 possesses a zero curvature representation, a third-order symmetry, and a nonlocal transformatio…

2010-02-04abs ↗pdf ↗

Adaptive learning of SPDE solutions using score-based diffusion models.

problem Model errors and reduced accuracy in SPDE solutions due to incomplete physical knowledge and environmental variability.
method Score-based diffusion models with recursive Bayesian inference, incorporating simulation data and observational information.
result Accuracy and robustness of the proposed method demonstrated on benchmark SPDEs.

Paper proposes a recursive GPSSM for efficient online learning.

problem Efficient online learning for dynamical models with limited prior information.
method Recursive Gaussian Process State-Space Model with adaptive capabilities for domains and hyperparameters.
result Superior accuracy, computational efficiency, and adaptability compared to state-of-the-art methods.

Paper finds a new principle for optimizing consumption and wealth using Tsallis entropy.

problem Optimal consumption-investment problem with recursive utility.
method Established connection to quadratic BSDE, derived stochastic maximum principle.
result Proved existence of optimal strategy and analyzed coupled system.

This paper refines the Gaussian Sinkhorn algorithm for general multivariate models.

problem Finite-dimensional solutions for general Gaussian multivariate models.
method Recursive formulation of the Sinkhorn algorithm for Gaussian models, including closed form expressions of entropic transport maps and Schrödinger bridges.
result Refined convergence analysis of Gaussian Sinkhorn algorithms.

The reduction problem of the chiral field equation on symmetric spaces is studied. It is shown that the symmetric chiral field has infinitely many local conservation laws. A recursive formula for these conservation laws is derived and the first associated integral of motion are given explicitly. Furthermore, the Zakhar…

2013-09-11abs ↗pdf ↗

We study an optimal investment/consumption problem in a model capturing market and credit risk dependencies. Stochastic factors drive both the default intensity and the volatility of the stocks in the portfolio. We use the martingale approach and analyze the recursive system of nonlinear Hamilton-Jacobi-Bellman equatio…

2018-06-19abs ↗pdf ↗

We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption-investment strategy by studying the associated quadratic backward stochastic differential equation (BSDE in short). We characterize the op…

2013-07-02abs ↗pdf ↗

We introduce a dynamic credit portfolio framework where optimal investment strategies are robust against misspecifications of the reference credit model. The risk-averse investor models his fear of credit risk misspecification by considering a set of plausible alternatives whose expected log likelihood ratios are penal…

2016-03-27abs ↗pdf ↗