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,657 papers · 148 categories

Trend · papers per month

166333499665 · Jun 202019922001200920172026
48 results for recursive functions

Topological recursion recovers a specific partition function for colored knots.

problem Recovering the extended Ooguri-Vafa partition function for colored HOMFLY-PT polynomials of torus knots.
method Applying topological recursion to the spectral curve of colored HOMFLY-PT polynomials of torus knots.
result Topological recursion reproduces the n-point functions of the extended Ooguri-Vafa partition function.

Harer and Zagier proved a recursion to enumerate gluings of a 2d2d-gon that result in an orientable genus gg surface, in their work on Euler characteristics of moduli spaces of curves. Analogous results have been discovered for other enumerative problems, so it is natural to pose the following question: how large is t…

2018-12-31abs ↗pdf ↗

We propose a general theory for constructing functorial assignments ΣΩΣE(Σ)Σ\longmapsto Ω_Σ \in E(Σ) for a large class of functors EE from a certain category of bordered surfaces to a suitable target category of topological vector spaces. The construction proceeds by successive excisions of homotopy classes of embedded pai…

2017-11-13abs ↗pdf ↗

The paper uses LSM to solve complex monetary utility functions.

problem Computing dynamic monetary utility functions with high dimensions.
method Least Squares Monte Carlo (LSM) algorithm.
result LSM algorithm successfully applied to recursive Cost-of-Capital valuation.

In this paper, we study and analyze the mini-batch version of StochAstic Recursive grAdient algoritHm (SARAH), a method employing the stochastic recursive gradient, for solving empirical loss minimization for the case of nonconvex losses. We provide a sublinear convergence rate (to stationary points) for general noncon…

2017-05-20abs ↗pdf ↗

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.

The paper uses tensor decompositions to improve neural network models for tree data.

problem Encoding structural knowledge from tree-structured data efficiently.
method Introduces new aggregation functions using Canonical and Tensor-Train decompositions.
result Proposed models outperform traditional methods on tree classification tasks.

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 produce examples of codimension one foliations of the Euclidean and hyperbolic planes with bounded geometry which are topologically products, but for which leaves are non-recursively distorted. That is, the function which compares intrinsic distances in leaves with extrinsic distances in the ambient space grows fast…

2000-02-23abs ↗pdf ↗

Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architectur…

2016-07-15abs ↗pdf ↗

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.

Greedy training of recursive partitioning estimators faces a computational barrier when the true function doesn't satisfy a specific property.

problem Computational inefficiency of greedy training for recursive partitioning estimators.
method Analysis of greedy training for sparse regression functions over binary features.
result Greedy training requires exponential samples when the true function doesn't satisfy a specific property (MSP), but only logarithmic samples when it does.

R2-B2 optimizes game interactions with recursive reasoning.

problem Optimizing interactions between boundedly rational agents with unknown payoff functions.
method Recursive Reasoning-Based Bayesian Optimization (R2-B2) for repeated games.
result R2-B2 achieves faster asymptotic convergence to no regret than non-recursive methods.

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.

The topological recursion of Eynard and Orantin governs a variety of problems in enumerative geometry and mathematical physics. The recursion uses the data of a spectral curve to define an infinite family of multidifferentials. It has been conjectured that, under certain conditions, the spectral curve possesses a non-c…

2013-12-24abs ↗pdf ↗

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.

New Riemannian geometry for Compound Gaussian distributions applied to efficient change detection.

problem Change detection in multivariate image times series.
method Developed a recursive approach based on Riemannian optimization.
result Optimal performance achieved with computational efficiency.

We introduce a recursive adaptive group lasso algorithm for real-time penalized least squares prediction that produces a time sequence of optimal sparse predictor coefficient vectors. At each time index the proposed algorithm computes an exact update of the optimal 1,\ell_{1,\infty}-penalized recursive least squares (R…

2011-01-29abs ↗pdf ↗

Worldsheet skein D-module for Hopf link conormal uniquely determines partition functions.

problem Understanding HOMFLYPT polynomials and their geometric origins.
method Defining worldsheet skein module and D-module, considering skein valued open curve counts.
result Worldsheet skein D-module for Hopf link conormal is generated by three operator polynomials.

New spin on Hurwitz theory connects to Gromov-Witten theory and topological recursion.

problem Counting ramified covers with sign from theta characteristics.
method Using polynomiality properties and spectral curves, proving equivalence to ELSV formula.
result Spin Hurwitz numbers are computed via ELSV formula involving Chiodo class.

The paper analyzes distances and volumes in lens spaces using recursion and formulas.

problem The problem of moments for distances between points on lens spaces.
method Derivation of recursion relations, formulas for moments and moment generating function, explicit formula for ball volumes.
result Explicit formulas for the volume of balls of all radii in lens spaces.

Continuous optimization is an important problem in many areas of AI, including vision, robotics, probabilistic inference, and machine learning. Unfortunately, most real-world optimization problems are nonconvex, causing standard convex techniques to find only local optima, even with extensions like random restarts and …

2016-11-08abs ↗pdf ↗

A new Bayesian method optimizes time-dependent expensive functions with lookahead.

problem Maximizing a time-dependent, expensive oracle with limited evaluations.
method Recursive, two-step lookahead expected payoff (r2LEY) acquisition function.
result r2LEY outperforms myopic methods in synthetic and real-world datasets.

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.

Stochastic discount factor (SDF) processes in dynamic economies admit a permanent-transitory decomposition in which the permanent component characterizes pricing over long investment horizons. This paper introduces an empirical framework to analyze the permanent-transitory decomposition of SDF processes. Specifically, …

2014-12-15abs ↗pdf ↗

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 risk-sensitive reinforcement learning with entropic risk measures and generative models.

problem Risk-sensitive reinforcement learning in discounted MDPs with recursive entropic risk measures.
method Introduced Model-Based ERM QQ-Value Iteration (MB-RS-QVI) and derived PAC bounds on sample complexity for value and policy learning.
result PAC bounds show exponential dependence on β/(1γ)|β|/(1-γ), with tight bounds in SS and AA.

New method for estimating treatment effects without complex propensity models.

problem Estimating treatment effects in dynamic treatment regimes.
method Recursive Riesz representer estimation for de-biasing corrections.
result Directly estimates de-biasing corrections without auxiliary models.