New recursion formula for non-orientable surfaces resolves divergences.
problem Computing volumes of moduli spaces for non-orientable surfaces.
method Generalization of Mirzakhani's recursion to non-orientable surfaces, handling divergences with integral kernels.
result Regularized volumes can be computed with a cutoff on crosscap size.
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 investigate the special Kähler geometry of the base of the Hitchin integrable system in terms of spectral curves and topological recursion. The Taylor expansion of the special Kähler metric about any point in the base may be computed by integrating the g=0 Eynard-Orantin invariants of the corresponding spectral …
New definition of Born geometry connects to known geometries.
problem Defining and understanding Born geometries.
method Using Künneth structures and recursion operators.
result Born connection derived from Künneth connection for integrable geometries.
We propose a general theory for constructing functorial assignments Σ⟼ΩΣ∈E(Σ) for a large class of functors E 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…
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.
ERM uses energy-based selection to improve recursive reasoning.
problem Lack of principled inference mechanism in recursive models.
method Energy-guided Recursive Model (ERM) introduces Hopfield energies for trajectory selection.
result ERM achieves optimal solutions on various puzzles.
The coupled KdV-mKdV system arises as the classical part of one of superextensions of the KdV equation. For this system, we prove its complete integrability, i.e., existence of a recursion operator and of infinite series of symmetries.
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.
We briefly recall the history of the Nijenhuis torsion of (1,1)-tensors on manifolds and of the lesser-known Haantjes torsion. We then show how the Haantjes manifolds of Magri and the symplectic-Haantjes structures of Tempesta and Tondo generalize the classical approach to integrable systems in the bi-hamiltonian and s…
We review properties of so-called special conformal Killing tensors on a Riemannian manifold (Q,g) and the way they give rise to a Poisson-Nijenhuis structure on the tangent bundle TQ. We then address the question of generalizing this concept to a Finsler space, where the metric tensor field comes from a regular La…
Symplectic groupoids create Poisson integrators for complex systems.
problem Creating efficient integrators for non-linear Poisson structures.
method Recursive solutions of Hamilton-Jacobi equation, interpreted as Lagrangian bisections.
result Constructs Poisson integrators using symplectic groupoids.
Study volumes of Klein surfaces, extending Mirzakhani's recursion.
problem Volumes of moduli spaces of bordered Klein surfaces.
method Generalization of Mirzakhani's recursion, integration over regularised moduli space.
result Explicit formula for Klein bottle moduli space volumes, recursion for arbitrary topologies.
DiCoLa recursively decomposes causal structure learning for latent variables.
problem Learning causal structures in high-dimensional settings with latent variables.
method Recursive decomposition framework for divide-and-conquer causal discovery.
result Theoretical soundness and completeness of DiCoLa framework.
New approach solves utility maximization problems using Delta family.
problem Utility maximization in stochastic control problems.
method Directly solving DP equation with Delta function representation.
result Explicit series representation of value function.
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 possesses a zero curvature representation, a third-order symmetry, and a nonlocal transformatio…
Proposes a recursive MPC scheme with probabilistic safety guarantees for uncertain dynamic systems.
problem Probabilistic safety guarantees for MPC in dynamic environments with unknown stochastic agents.
method Uses conformal prediction to derive high-confidence prediction regions and gradually relax safety constraints online.
result Ensures recursive feasibility of MPC schemes by relaxing safety constraints over time.
In a recent significant advance, using Laguerre series, the valuation of Asian options has been reduced by Dufresne to computing the negative moments of Yor's accumulation processes. For these he has given functional recursion rules whose probabilistic structure has been the object of intensive recent studies of Yor an…
RocketStack integrates predictions from multiple base learners using a recursive stacking architecture up to ten levels.
problem Feature redundancy, complexity, and computational burden in deep stacking.
method Level-aware recursive stacking with pruning and compression techniques.
result Increasing accuracy with depth and outperforming standalone ensembles at later levels.
We use the explicit relation between genus filtrated s-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces Mg,sdisc (discrete volumes), to express Gaussian means…
We introduce a new method of calculating intersections on \bar{M}_{g,n}, using localization of equivariant cohomology. As an application, we give a proof of Mirzakhani's recursion relation for calculating intersections of mixed psi and kappa_1 classes.
Paper connects volumes of moduli spaces of super Riemann surfaces to integrals over stable Riemann surfaces.
problem Relating volumes of moduli spaces of super Riemann surfaces to integrals over stable Riemann surfaces.
method Relates volumes of moduli spaces of super Riemann surfaces to integrals over the moduli space of stable Riemann surfaces Mg,n. result Proves recursion between volumes of moduli spaces of super hyperbolic surfaces using algebraic geometry.
Study optimal hedging for claims with random weights in discrete time.
problem Optimal hedging for claims with random weights in discrete time.
method Explicit recursive representation of optimal hedging strategy, without ND condition.
result Obtained explicit optimal hedging strategy in a recursive form.
We present infinitely many nonlocal conservation laws, a pair of compatible local Hamiltonian structures and a recursion operator for the equations describing surfaces in three-dimensional space that admit nontrivial deformations which preserve both principal directions and principal curvatures (or, equivalently, the s…
Introduces a new 2C extension of the heavenly equation.
problem Solving the general heavenly equation and its extensions.
method Infinite hierarchy of nonlocal symmetries and recursion operator.
result Solutions correspond to 4D hyper-para-Hermitian metrics.
Causal trees struggle with accuracy in estimating treatment effects.
problem Estimating heterogeneous causal treatment effects using recursive decision trees.
method Adaptive recursive partitioning with and without sample splitting.
result Causal tree estimators can have uniform-norm errors decreasing more slowly than any power of the sample size.
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.
Proves conjecture about integer sums of torus knot torsions.
problem Integrality of sums of (g-1)st powers of adjoint Reidemeister torsions for torus knots.
method Introduced Verlinde numbers from modular S-matrix, proved integrality through recursion formulas.
result Proven integrality of sums of (g-1)st powers of adjoint Reidemeister torsions for all torus knots and non-negative g.
New algorithm speeds up online mapping of unknown terrains.
problem Increasing computational demands of GP mapping as area expands.
method Recursive GP mapping using local basis functions in an information filter.
result Reduces overall computational complexity and speeds up mapping.
The paper uses Fourier integral theorem for estimating multivariate distributions.
problem Estimating multivariate distributions and conditional distribution functions.
method Natural Monte Carlo and fully nonparametric estimators based on Fourier integral theorem.
result Explicit Monte Carlo estimators without estimated covariance matrix.
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.
Using geometrical approach exposed in arXiv:math/0304245 and arXiv:nlin/0511012, we explore the Camassa-Holm equation (both in its initial scalar form, and in the form of 2x2-system). We describe Hamiltonian and symplectic structures, recursion operators and infinite series of symmetries and conservation laws (local an…
Model predicts credit portfolio losses with contagion effects.
problem Predicting credit portfolio losses with contagion effects.
method Introduced a model with a recursive algorithm and flexible distributions.
result Good fit for synthetic CDO tranches of the iTraxx index.
Recursive neural networks have widely been used by researchers to handle applications with recursively or hierarchically structured data. However, embedded control flow deep learning frameworks such as TensorFlow, Theano, Caffe2, and MXNet fail to efficiently represent and execute such neural networks, due to lack of s…
In this paper, a rapid and high accurate numerical method for pricing discrete single and double barrier knock-out call options is presented. According to the well-known Black-Scholes framework, the price of option in each monitoring date could be calculate by computing a recursive integral formula upon the heat equati…
Paper tackles model collapse in recursive generative models using a weighted training scheme.
problem Model collapse in recursive generative models trained on synthetic data.
method Iteratively trains models on real and synthetic data, evaluates weighted training schemes.
result Optimal weighting scheme for synthetic data follows a unified expression, revealing a trade-off with model performance.
Paper defines Farey Recursive Functions and explores their properties.
problem Understanding recursive functions on rationals.
method Defined and studied Farey Recursive Functions using Farey graph.
result Farey Recursive Functions naturally connect to 2-bridge knots and links.
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 research connects combinatorial Teichmüller space geometry to Weil-Petersson geometry.
problem Understanding the geometry of combinatorial Teichmüller space.
method Developed a parallel between combinatorial Teichmüller space and Weil-Petersson geometry, using measured foliations and Fenchel-Nielsen coordinates.
result Established a geometric recursion and topological recursion for mapping class group invariants.
Fractal Flow enhances normalizing flows with interpretable latent space and hierarchical modeling.
problem High-dimensional density estimation and generative modeling challenges.
method Integrates topic modeling (LDA) and fractal strategy into normalizing flows.
result Achieves latent clustering, controllable generation, and superior estimation accuracy.
Constructs a Lie groupoid integrating singular foliations.
problem Integrating singular foliations into higher Lie groupoids.
method Recursive use of bi-submersions and geometric resolutions.
result Finite-dimensional Lie groupoid integrating singular foliations.
Tab-TRM uses recursive model for insurance pricing on tabular data.
problem Insurance pricing on tabular data.
method Adapts recursive latent reasoning to insurance modeling using a compact, parameter-efficient network.
result Improves insurance pricing accuracy using iterative refinement of latent tokens.
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…
Harer and Zagier proved a recursion to enumerate gluings of a 2d-gon that result in an orientable genus g 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…
New framework uses simplicial and categorical methods to detect market inconsistencies.
problem Detecting inconsistencies in financial markets using non-measure-preserving transitions.
method Simplicial and categorical formulation of AB type arbitrage in filtered market systems.
result Holonomy along loops reveals global inconsistencies invisible at local levels.
We study an optimal multiple stopping problem for call-type payoff driven by a spectrally negative Levy process. The stopping times are separated by constant refraction times, and the discount rate can be positive or negative. The computation involves a distribution of the Levy process at a constant horizon and hence t…
Solves a recursion for Gromov-Witten invariants of the unknot.
problem Determining Gromov-Witten invariants for a specific Lagrangian brane.
method Uses a skein-theoretic recursion and geometric solutions.
result Solves the recursion to find the expected hook-content formula.
New recursion found for hyperbolic sphere volumes.
problem Volume calculation of hyperbolic sphere moduli spaces.
method Proved a non-linear recursive relation.
result Generalized Zograf's result for conical points and geodesic boundaries.