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.

169,341 papers · 148 categories

Trend · papers per month

68136203271 · Jun 202019922001200920182026
48 results for recursive integral equations

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.

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 ↗

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 ↗

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.

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.

Deep neural networks approximate unknown governing equations from data.

problem Approximating unknown governing equations from observational data.
method Residual network (ResNet) and multi-step methods (RT-ResNet, RS-ResNet) for equation recovery.
result Deep neural networks can recover governing equations without time derivative data.

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.

The paper analyzes American options with time-varying caps, finding complex exercise regions and deriving option pricing formulas.

problem Valuation of American capped call options with time-varying caps, especially when the cap grows or decreases over time.
method Probabilistic arguments and local time, characterizing exercise boundaries through recursive integral equations and piecewise constant segments.
result General representation formulas for option prices, derived from exercise boundaries and local time of the underlying process.

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 introduce the notion of weak reduciblity for Dupin submanifolds with arbitrary codimension. We give a complete characterization of all weakly reducible Dupin submanifolds, as a consequence of a general result on a broader class of Euclidean submanifolds. As a main application, we derive an explicit recursive procedu…

2004-03-24abs ↗pdf ↗

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 ↗

Quaternion-Kaehler four-manifolds, or equivalently anti-self-dual Einstein manifolds, are locally determined by one scalar function subject to Przanowski's equation. Using twistorial methods we construct a Lax Pair for Przanowski's equation, confirming its integrability. The Lee form of a compatible local complex struc…

2012-05-17abs ↗pdf ↗

Geometric recursion constructs measurable functions on moduli spaces.

problem Constructing measurable functions on moduli spaces of bordered Riemann surfaces.
method Inductive construction via excisions of pairs of pants, with convergence conditions.
result Geometric recursion produces functions that can be integrated with respect to the Weil-Petersson measure.

A fast numerical method for pricing double barrier options using Lagrange interpolation.

problem Pricing discrete double barrier knock-out call options efficiently.
method Approximating recursive solutions of the heat equation with Lagrange interpolation on Jacobi polynomials nodes.
result The method significantly reduces CPU time as the number of monitoring dates increases.

Study efficient reinforcement learning for partially observed systems with linear structure.

problem Efficient reinforcement learning for partially observed Markov decision processes with linear structure.
method Proposes OP-TENET algorithm using a Bellman operator with finite memory, adversarial integral equation, and optimistic exploration.
result Achieves ε-optimal policy within O(1/ε^2) episodes with polynomial sample complexity in intrinsic dimension.

SciRE-Solver accelerates DMs sampling by recursively calculating the score function derivative.

problem Slow iterative process of diffusion models due to estimating the score function derivative.
method Recursive Difference (RD) method combined with truncated Taylor expansion of score-integrand.
result SciRE-Solver achieves state-of-the-art FIDs with significantly fewer score function evaluations.

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.

CRUs model irregular time series with continuous hidden states.

problem Handling irregular time intervals in sequential data.
method Continuous Recurrent Units (CRUs) that integrate hidden states via a linear stochastic differential equation.
result CRUs outperform methods based on neural ordinary differential equations in irregular time series interpolation.

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.

The paper optimizes wealth with concave coefficients in a recursive utility maximization problem.

problem Optimizing wealth with concave coefficients in a recursive utility maximization problem.
method Equivalent backward formulation, Fenchel-Legendre transform, convex duality method.
result Derives the optimal terminal wealth for investors with ambiguity aversion.

The paper characterizes optimal solutions for utility optimization with stochastic elements.

problem Optimal portfolio optimization under uncertainty.
method Characterization of fully coupled FBSDEs in terms of BSDEs.
result Explicit examples and methods to quantify incompleteness and find optimal solutions.

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 ↗

Analyzes RNNs using ODEs to map their properties and improve stability.

problem Understanding and improving the stability of RNNs.
method Relates RNNs to ODEs, mapping their properties to integration methods.
result Establishes sufficient conditions for RNN training stability and designs new architectures.

Improved accuracy in quantization methods for financial derivatives.

problem Efficient numerical methods for evaluating functionals of stochastic differential equations.
method Recursive Marginal Quantization of higher-order schemes (Euler, Milstein, simplified weak order 2.0).
result Higher-order schemes provide improved weak order convergence and accurate marginal distributions.

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 ↗