arXiv research

The paper explores generalizations of Mirzakhani's recursion and computes volumes for physical gravity models.

LASER compresses recursive model activations by exploiting their low-dimensional structure.

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…

The paper computes a knot's Kauffman bracket polynomial using recursive concatenation of a 4-tangle shadow.

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…

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 recursion formula for non-orientable surfaces resolves divergences.

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

New invariant $c_{sm}$ simplifies computing geometric invariants of recursive group orbits.

The paper computes infinitesimals for group actions on a multispace of curves.

The paper uses LSM to solve complex monetary utility functions.

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 work generalizes a formula linking Seiberg-Witten prepotential and topological recursion.

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 $\ell_{1,\infty}$-penalized recursive least squares (R…

SRRM improves recursive transport surrogates in the small-discrepancy regime.

Paper computes Alexander polynomials for arborescent links.

Novel method recursively partitions sample space for density estimation.

This study presents a rapid multiple incremental and decremental mechanism based on Weight-Error Curves (WECs) for support-vector analysis. Recursion-free computation is proposed for predicting the Lagrangian multipliers of new samples. This study examines Ridge Support Vector Models, subsequently devising a recursion-…

New ELM algorithms reduce computation time and complexity.

We show that the set $SCL^{rp}$ of stable commutator lengths on recursively presented groups equals the set of non-negative right-computable numbers. Hence all non-negative algebraic or computable numbers are in $SCL^{rp}$ and $SCL^{rp}$ is not closed under subtraction. We also show that every non-negative real number …

DiCoLa recursively decomposes causal structure learning for latent variables.

An efficient method to compute a single linkage dendrogram.

New estimator reduces nested expectation estimation costs.

This paper develops efficient algorithms for multibody dynamics using screw and Lie group theory.

In this paper, the method of approximate transformation groups which was proposed by Baikov, Gazizov and Ibragimov, is extended on Hamiltonian and bi-Hamiltonian systems of evolution equations. Indeed, as a main consequence, this extended procedure is applied in order to compute the approximate conservation laws and ap…

New algorithm speeds up online mapping of unknown terrains.

We propose a general theory for constructing functorial assignments $Σ\longmapsto Ω_Σ \in 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…

TKFT models computation via smooth vector fields, simulating functions in a single dynamical step.

We extend topological recursion to twisted Higgs bundles with singularities.

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

This paper focuses on projection-free methods for solving smooth Online Convex Optimization (OCO) problems. Existing projection-free methods either achieve suboptimal regret bounds or have high per-iteration computational costs. To fill this gap, two efficient projection-free online methods called ORGFW and MORGFW are …

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.

A new method optimizes diffusion models with recursive likelihood ratios.

Recursive causal discovery reduces errors and complexity in causal graph learning.

We derive a recursive formula for arithmetic Asian option prices with finite observation times in semimartingale models. The method is based on the relationship between the risk-neutral expectation of the quadratic variation of the return process and European option prices. The computation of arithmetic Asian option pr…

Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.

Counting lattice points in moduli space of Klein surfaces.

We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the next one, and b) recursive decoding, where the signal estimate from…

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…

We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating examples, we have corrected previous misunderstandings on the topological prope…

The class of Gaussian Process (GP) methods for Temporal Difference learning has shown promise for data-efficient model-free Reinforcement Learning. In this paper, we consider a recent variant of the GP-SARSA algorithm, called Sparse Pseudo-input Gaussian Process SARSA (SPGP-SARSA), and derive recursive formulas for its…

In this paper, a new method is proposed for sparse PCA based on the recursive divide-and-conquer methodology. The main idea is to separate the original sparse PCA problem into a series of much simpler sub-problems, each having a closed-form solution. By recursively solving these sub-problems in an analytical way, an ef…

In this paper, we develop an approach to recursively estimate the quadratic risk for matrix recovery problems regularized with spectral functions. Toward this end, in the spirit of the SURE theory, a key step is to compute the (weak) derivative and divergence of a solution with respect to the observations. As such a so…

We use Kauffman's bracket polynomial to define a complex-valued invariant of virtual rational tangles that generalizes the well-known fraction invariant for classical rational tangles. We provide a recursive formula for computing the invariant, and use it to compute several examples.

Two new inverse-free ELM algorithms for incremental and decremental learning are proposed.

In quantitative finance, it is often necessary to analyze the distribution of the sum of specific functions of observed values at discrete points of an underlying process. Examples include the probability density function, the hedging error, the Asian option, and statistical hypothesis testing. We propose a method to c…

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…

DESTRESS optimizes decentralized nonconvex optimization with optimal IFO complexity and efficient communication.