We apply Cartan's method of equivalence to find a Bäcklund autotransformation for the tangent covering of the universal hierarchy equation. The transformation provides a recursion operator for symmetries of this equation.
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
48 results for “recursive coverings”
Single Hurwitz numbers enumerate branched covers of the Riemann sphere with specified genus, prescribed ramification over infinity, and simple branching elsewhere. They exhibit a remarkably rich structure. In particular, they arise as intersection numbers on moduli spaces of curves and are governed by the topological r…
Classical Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. Monotone Hurwitz numbers restrict the enumeration by imposing a further monotonicity condition on such factorisations. In …
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.
We formulate and discuss two conjectures concerning recursive formulae for Branson's -curvatures. The proposed formulae describe all -curvatures on manifolds of all even dimensions in terms of respective lower order -curvatures and lower order GJMS-operators. They are universal in the dimension of the underlyi…
In general, Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. In this paper, we initiate the study of monotone orbifold Hurwitz numbers. These are simultaneously variations of the or…
Asymptotic Properties of Recursive Maximum Likelihood Estimation in Non-Linear State-Space Modelsmath.ST
Using stochastic gradient search and the optimal filter derivative, it is possible to perform recursive (i.e., online) maximum likelihood estimation in a non-linear state-space model. As the optimal filter and its derivative are analytically intractable for such a model, they need to be approximated numerically. In [Po…
The Dirichlet random walkmath.PR
The Dirichlet random walk on manifolds has a positive escape rate if the cover is non-amenable.
problem Analyzing the stochastic behavior of Dirichlet random walks on manifolds.
method Defining a recursive process on Galoisian covers and proving a theorem about the escape rate.
result The escape rate is positive if and only if the cover is non-amenable.
New algorithm reduces prediction error in online learning without knowing base measure.
problem Smoothed online learning without knowledge of base measure.
method R-Cover algorithm based on recursive coverings.
result First algorithm to guarantee sublinear regret for agnostic smoothed online learning without prior knowledge of base measure.
New theorem removes uniform finite upper bound for shrinkability of null decompositions.
problem Shrinkability of null decompositions with non-singleton elements.
method Defining squeezable and squashable subsets, proving their equivalence, and applying these definitions to null decompositions.
result Any null decomposition of a compact metric space whose non-singleton elements are recursively squeezable is shrinkable.
New RL approach uses resets to learn complex MDPs efficiently.
problem Learning complex MDPs with high-dimensional states and function approximation.
method Local simulator access and recursive value function search.
result Proven sample-efficient learning for MDPs with low coverability.
Paper analyzes time series prediction using empirical risk minimization.
problem Optimizing 1-step-ahead prediction for time series.
method Empirical risk minimization applied to recursive algorithms for time series forecasting.
result Empirical risk minimization achieves optimal predictive performance.
In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric topology obtained by S.Choi, who estab…
The worldsheet skein D-module and basic curves on Lagrangian fillings of the Hopf link conormalmath.SG
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.
We address the problem of Bayesian structure learning for domains with hundreds of variables by employing non-parametric bootstrap, recursively. We propose a method that covers both model averaging and model selection in the same framework. The proposed method deals with the main weakness of constraint-based learning--…
In this paper, we compare two definitions of Rauzy classes. The first one was introduced by Rauzy and was in particular used by Veech to prove the ergodicity of the Teichmüller flow. The second one is more recent and uses a "labeling" of the underlying intervals, and was used in the proof of some recent major results a…
This paper shows that every Gromov hyperbolic group can be described by a finite subdivision rule acting on the 3-sphere. This gives a boundary-like sequence of increasingly refined finite cell complexes which carry all quasi-isometry information about the group. This extends a result from Cannon and Swenson in 1998 th…
We study the contribution of multiple covers of an irreducible rational curve C in a Calabi-Yau threefold Y to the genus 0 Gromov-Witten invariants in the following cases. (1) If the curve C has one node and satisfies a certain genericity condition, we prove that the contribution of multiple covers of degree d is given…
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…
Farey Recursive Functionsmath.GT
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 abstract conjectures a link between knot homologies and quiver partition functions.
problem Understanding the relationship between knot homologies and quiver partition functions.
method Interpreting quiver nodes as holomorphic curves with boundary on the knot conormal, and studying recursion relations.
result Generalized quiver partition functions are related to knot homologies.
Some Generalizations of Mirzakhani's Recursion and Masur-Veech Volumes via Topological Recursionsmath-ph
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 asymptotic behavior of the stochastic gradient algorithm with a biased gradient estimator is analyzed. Relying on arguments based on the dynamic system theory (chain-recurrence) and the differential geometry (Yomdin theorem and Lojasiewicz inequality), tight bounds on the asymptotic bias of the iterates generated b…
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.
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.
Harer and Zagier proved a recursion to enumerate gluings of a -gon that result in an orientable genus 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…
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.
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.
The paper proves manifold splitting theorems with nonnegative intermediate curvature.
problem Proving rigidity results for manifolds with nonnegative intermediate curvatures.
method New recursion theorem for spectral intermediate curvatures and cylindrical splitting theorems.
result Smooth metrics with uniformly positive intermediate curvature constructed.
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.
This work generalizes a formula linking Seiberg-Witten prepotential and topological recursion.
problem Analyzing the relationship between Seiberg-Witten curves and topological recursion.
method Analytical approach using Seiberg-Witten family of curves.
result A generalized formula relating Seiberg-Witten prepotential to the genus zero part of topological recursion on a Seiberg-Witten curve.
LASER compresses recursive model activations by exploiting their low-dimensional structure.
problem Understanding and optimizing the geometric structure of recursive reasoning trajectories.
method Dynamic low-rank basis tracking via matrix-free subspace tracking with a fidelity-triggered reset mechanism.
result Recursive activations occupy a linear, low-dimensional subspace that can be compressed efficiently.
We describe a method for recursively calculating Gromov-Witten invariants of all blowups of the projective plane. This recursive formula is different from the recursive formulas due to Göttsche and Pandharipande in the zero genus case, and Caporaso and Harris in the case of no blowups. We use tropical curves and a recu…
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.
We derive the Do and Norbury recursion formula for the one-loop mean of an irregular spectral curve from a variant of replica method by Brezín and Hikami. We express this recursion in special times in which all terms of the genus expansion of the one-loop mean are polynomials. We find a generalization of th…
This paper concerns the recursive utility maximization problem under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a s…
Deep Quadratic Hedgingq-fin.CP
Deep learning solves high-dimensional quadratic hedging problems.
problem High-dimensional incomplete markets with mean-variance and local risk minimization.
method Deep learning-based BSDE solver for optimal hedging strategies.
result High-dimensional quadratic hedging is efficiently computed with deep learning.
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.
Benchmarking recursive collapse claims with a new framework under false-positive control.
problem Evaluating recursive systems for failure patterns and warning claims.
method Developed Loopzero framework for testing recursive failures, specified claim boundaries in Lean, evaluated under FP constraint, and compared with standard detectors.
result No standard detectors or Loopzero's pre-registered quantile detector achieved the required operating point under the false-positive contract.
SRRM improves recursive transport surrogates in the small-discrepancy regime.
problem Insufficient understanding of recursive partitioning methods' statistical behavior and resolution in the small-discrepancy regime.
method Introduced Selective Recursive Rank Matching (SRRM) to improve the resolution of Recursive Rank Matching (RRM).
result SRRM yields a higher-fidelity practical surrogate for the Wasserstein distance at moderate additional computational cost.
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.
In this article, we aim at improving the prediction of expert aggregation by using the underlying properties of the models that provide expert predictions. We restrict ourselves to the case where expert predictions come from Kalman recursions, fitting state-space models. By using exponential weights, we construct diffe…
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 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.
New recursive relation found for a specific torus knot.
problem Finding a recursive relation for a specific torus knot.
method Extending colored Jones polynomials to knots in torus knot complements and examining a particular knot.
result An analogous recursive relation exists for a specific torus knot.
Geometric recursionmath.GT
We propose a general theory for constructing functorial assignments for a large class of functors 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…
Recursively Trained Diffusion Models: Limiting Collapse Distribution and Spectral Characterizationstat.ML
Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.
problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution
Paper presents novel online MTL methods using WRLS and OSLSSVR.
problem Online Multi-Task Learning (MTL) Regression Problems
method Develops recursive versions of WRLS and OSLSSVR for MTL.
result Achieves exact and approximate recursions with quadratic cost.