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.
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…
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.
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.
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
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…
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.
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.
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.
Theoretical study on AI models' resilience to data contamination during recursive training.
problem Data contamination in recursive training of generative AI models.
method General framework with minimal assumptions on real data distribution and flexible generative models.
result Contaminated recursive training converges with a rate equal to the minimum of baseline model's rate and contamination fraction.
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…
Paper estimates the order of vertices in random recursive trees.
problem Estimating the order of arrival of vertices in random recursive trees.
method Proposes an order estimator based on the Jordan centrality measure and defines risk measures.
result Establishes a nearly optimal estimator for the problem.
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.
A new method optimizes diffusion models with recursive likelihood ratios.
problem Efficiently aligning pre-trained diffusion models for specific applications.
method Recursive Likelihood Ratio (RLR) optimizer for Half-Order (HO) fine-tuning.
result The RLR method achieves unbiased and lower-variance gradients, improving model performance.
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 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…
Bayesian method for multivariate autoregressive models with exogenous inputs.
problem Estimating uncertainties in autoregressive models with exogenous inputs.
method Recursive Bayesian estimation via message passing in a factor graph.
result Produces full posterior distributions for autoregressive coefficients and noise precision.
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.
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.
The problem at the heart of this tutorial consists in modeling the path choice behavior of network users. This problem has been extensively studied in transportation science, where it is known as the route choice problem. In this literature, individuals' choice of paths are typically predicted using discrete choice mod…
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.
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation algorithm. Using the probabilistic model, we derive a matrix factorisation algorithm …
We extend topological recursion to twisted Higgs bundles with singularities.
problem Computing Taylor expansions of period matrices for twisted Higgs bundles.
method We introduce a twisted topological recursion on the spectral curve of a twisted Higgs bundle, encoding singularities and performing the recursion explicitly.
result The g=0 twisted Eynard-Orantin differentials compute the Taylor expansion of the spectral curve's period matrix, independent of the ambient space. 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.
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.
Model collapse occurs quickly for synthetic data generated by previous models.
problem Model quality degrades over recursive training on synthetic data.
method Theoretical and experimental evaluations of discrete and Gaussian distributions under near ML estimation.
result Model collapse for discrete distributions is approximately linearly dependent on the number of times a word occurs in the original corpus, and for Gaussian models, the standard deviation reduces to zero roughly at n iterations.
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 Q-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−γ), with tight bounds in S and A. Study torus knots in lens spaces using Gromov-Witten invariants and topological recursion.
problem Computing Gromov-Witten invariants for torus knots in lens spaces.
method Construct Lagrangian sub-manifolds and relate to topological recursion.
result Verify a conjecture in lens space for Gromov-Witten invariants.
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.
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.
Using the duality between Wilson loop expectation values of SU(N) Chern-Simons theory on S3 and topological open-string amplitudes on the local mirror of the resolved conifold, we study knots on S3 and their invariants encoded in colored HOMFLY polynomials by means of topological recursion. In the context of the …
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 W1(g) 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…
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.
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.
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.
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.
Online (also called "recursive" or "adaptive") estimation of fixed model parameters in hidden Markov models is a topic of much interest in times series modelling. In this work, we propose an online parameter estimation algorithm that combines two key ideas. The first one, which is deeply rooted in the Expectation-Maxim…
AdaVol adapts QML for real-time GARCH volatility prediction.
problem Real-time estimation of GARCH volatility in streaming data.
method Adaptive recursive estimation routine with Variance Targeting Estimation.
result AdaVol provides a stable and adaptive method for real-life data.
Paper develops efficient recursive learning for multi-channel systems with heterogeneous dynamics.
problem Accurately learning system dynamics in complex, multi-channel systems with nonlinear and noisy data.
method Formulates system as Gaussian process state-space models (GPSSMs), introduces heterogeneous multi-output kernel, and develops recursive inference framework.
result Matches SOTA offline GPSSMs in accuracy with 1/100 runtime, and outperforms SOTA online GPSSMs by 70% in accuracy under noise with 1/20 runtime.
Two new feature selection algorithms improve on RFE.
problem Optimal feature selection for faster and more accurate models.
method Fibonacci and k-Subsecting Recursive Feature Elimination.
result Faster feature selection with comparable predictive performance.
We propose a novel approach to parameter estimation for simulator-based statistical models with intractable likelihood. Our proposed method involves recursive application of kernel ABC and kernel herding to the same observed data. We provide a theoretical explanation regarding why the approach works, showing (for the p…
Recursive KalmanNet combines neural networks with Kalman filters for precise state estimation.
problem State estimation in systems with noisy measurements and non-Gaussian noise.
method Recursive KalmanNet uses a recurrent neural network to estimate states with consistent error covariance, optimizing for Gaussian negative log-likelihood.
result Recursive KalmanNet outperforms conventional Kalman filters and deep learning-based estimators in non-Gaussian noise conditions.