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.
New recursive algorithm estimates conditional kernel mean embeddings in Hilbert space.
problem Estimating conditional distributions in RKHS for supervised learning.
method Recursive algorithm in L2 space for conditional kernel mean map. result Strong L2 consistency of recursive estimator proved. 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.
A subset E of a metric space X is said to be starlike-equivalent if it has a neighbourhood which is mapped homeomorphically into Rn for some n, sending E to a starlike set. A subset E⊂X is said to be recursively starlike-equivalent if it can be expressed as a finite nested union of closed s…
After establishing the uniqueness of the continuation of local Cauchy data for harmonic maps between two Riemannian manifolds M and N, we prove (i) a reflection principle for a smooth minimal submanifold Y of a Riemannian manifold M that contains a reflective submanifold of M as a hypersurface and (ii) the reflection p…
Paper studies metric ribbon graphs and provides a recursion for their volumes.
problem Calculating volumes of combinatorial moduli spaces of directed metric ribbon graphs.
method Decomposes directed ribbon graphs into simpler graphs with one vertex, proving a canonical recursion scheme for volumes.
result Explicit recursion for volumes of four-valent metric ribbon graphs provided.
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…
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.
Machine learning algorithms for generating molecular structures offer a promising new approach to drug discovery. We cast molecular optimization as a translation problem, where the goal is to map an input compound to a target compound with improved biochemical properties. Remarkably, we observe that when generated mole…
Strong stability of ergodic iterations proven without ergodic driving sequence.
problem Ensuring strong stability of ergodic iterations under non-ergodic driving sequences.
method Revisiting processes driven by stationary ergodic sequences, proving strong stability under mild conditions on recursive maps.
result Strong stability of iterations proven without ergodic driving sequence.
We prove that the general fibre of the i-th Gauss map has dimension m if and only if at the general point the (i+1)-th fundamental form consists of cones with vertex a fixed Pm−1, extending a known theorem for the usual Gauss map. We prove this via a recursive formula for expressing higher fundamenta…
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.
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.
Formulates Markov property for risk-sensitive dynamic optimisation.
problem Risk-sensitive dynamic optimisation problems in discrete time.
method Formulates probabilistic Markov property under dynamic risk framework.
result Property holds for standard risk measures and has multiple equivalent versions.
Study eigenvalue distributions of neural kernels for linear-width networks.
problem Eigenvalue distributions of neural kernels in linear-width networks.
method Asymptotic analysis of Conjugate Kernel and Neural Tangent Kernel under random initialization and approximate orthogonality.
result Eigenvalue distributions converge to deterministic limits, described by recursive fixed-point equations.
Cardinality potentials are a generally useful class of high order potential that affect probabilities based on how many of D binary variables are active. Maximum a posteriori (MAP) inference for cardinality potential models is well-understood, with efficient computations taking O(DlogD) time. Yet efficient marginalizat…
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…
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.
Generates infinite-depth hierarchical clusters from few examples.
problem Inadequate finite-sample clustering methods for fine-scale hierarchical structures.
method Classification fields generated by a local refinement rule, approximated by predictors.
result Learned predictors can approximate infinite-depth hierarchical structures.
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--…
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 Recurrent Predictive State Policy (RPSP) networks, a recurrent architecture that brings insights from predictive state representations to reinforcement learning in partially observable environments. Predictive state policy networks consist of a recursive filter, which keeps track of a belief about the stat…
This paper contains the technical foundations from stochastic differential geometry for the construction of geometrically intrinsic nonlinear recursive filters. A diffusion X on a manifold N is run for a time interval T, with a random initial condition. There is a single observation consisting of a nonlinear function o…
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…
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.
The article improves prediction by aggregating Kalman recursions online.
problem Improving expert aggregation in prediction models.
method Using exponential weights and state-space models to aggregate Kalman recursions.
result New algorithms outperform existing methods in Kalman recursion expert aggregation.
The materials accompany a lecture short course presented at the 2011 Park City Mathematics Institute, Graduate Summer School on Moduli Spaces of Riemann Surfaces. The lectures were part of/coordinated with an overall program, including lectures by Ursula Hamenstadt on Teichmueller Theory, Andy Putman on Mapping Class a…
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.
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.
We find a remarkable subalgebra of higher symmetries of the elliptic Euler-Darboux equation. To this aim we map such equation into its hyperbolic analogue already studied by Shemarulin. Taking into consideration how symmetries and recursion operators transform by this complex contact transformation, we explicitly give …
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.
Constructs classifiers for neural networks with specific data configurations.
problem Finding global minima of deep ReLU neural networks on sequentially separable data.
method Explicitly constructs zero loss neural network classifiers using cumulative parameters and truncation maps.
result Global minimizers can be described with a limited number of parameters based on the data structure.
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.
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.
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 (2p+1,2) torus knot complements and examining a particular knot. result An analogous recursive relation exists for a specific (2p+1,2) torus knot. 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.
New results on homology torsion growth for various groups.
problem Understanding the growth of higher torsion homologies for arithmetic lattices and other groups.
method Quantitative homotopical method called effective rebuilding, constructing small classifying spaces of finite index subgroups.
result Strong asymptotic bounds for the torsion growth in principal congruence subgroups.