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.
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…
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.
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.
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.
Formula counts rational curves with a specific singular point in projective space.
problem Counting rational degree d curves with an m-fold point in CP2. method Recursive formula derived from Kontsevich's recursion formula, considering a family version.
result Obtained a recursive formula for the number of curves.
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 uses LSM to solve complex monetary utility functions.
problem Computing dynamic monetary utility functions with high dimensions.
method Least Squares Monte Carlo (LSM) algorithm.
result LSM algorithm successfully applied to recursive Cost-of-Capital valuation.
New Riemannian geometry for Compound Gaussian distributions applied to efficient change detection.
problem Change detection in multivariate image times series.
method Developed a recursive approach based on Riemannian optimization.
result Optimal performance achieved with computational efficiency.
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…
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 reviews graph convolutional neural networks (GCNNs) through the lens of edge-variant graph filters. The edge-variant graph filter is a finite order, linear, and local recursion that allows each node, in each iteration, to weigh differently the information of its neighbors. By exploiting this recursion, we fo…
A new method reduces CI tests for causal structure learning.
problem Exponential CI tests in constraint-based methods.
method Recursive Markov boundary-based approach.
result Significantly reduces CI tests compared to existing methods.
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.
A new recursive mixture estimation algorithm improves VAE inference efficiency and accuracy.
problem Inaccurate posterior approximation in traditional VAEs.
method Recursive mixture estimation algorithm using functional gradient approach for iterative component selection.
result Significantly higher test data likelihood compared to state-of-the-art methods on benchmark datasets.
New family of braided Thompson groups introduced using recursive braids.
problem Dehornoy-Brin braided Thompson group generalization.
method Using recursive braids and strand diagrams to define new groups.
result New groups BVn,r(H) are finitely generated if H is finitely generated. 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.
Novel method recursively partitions sample space for density estimation.
problem Estimating complex density functions efficiently and accurately.
method Recursive partitioning of the sample space, asymptotically exact.
result Asymptotically exact approximation of any density function.
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.
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.
The paper proposes a new probability distribution for rooted trees.
problem Overfitting in tree selection for statistical models.
method Bayesian approach with a generalized probability distribution for rooted trees.
result Recursive methods to evaluate the probability distribution without approximations.
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.
We propose a novel approach to model selection for simulator-based statistical models. The proposed approach defines a mixture of candidate models, and then iteratively updates the weight coefficients for those models as well as the parameters in each model simultaneously; this is done by recursively applying Bayes' ru…
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 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…
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.
New algorithm solves Schrödinger bridge problem with mismatched channels.
problem Solving Schrödinger bridge problem with input and noise channel mismatch.
method Design of a Sinkhorn recursion with memory for nonlinear PDEs.
result Demonstrates solving control-affine Schrödinger bridge problem.
Most of the existing solutions to enterprise threat management are preventive approaches prescribing means to prevent policy violations with varying degrees of success. In this paper we consider the complementary scenario where a number of security violations have already occurred, or security threats, or vulnerabiliti…
In this paper, we propose a StochAstic Recursive grAdient algoritHm (SARAH), as well as its practical variant SARAH+, as a novel approach to the finite-sum minimization problems. Different from the vanilla SGD and other modern stochastic methods such as SVRG, S2GD, SAG and SAGA, SARAH admits a simple recursive framewor…
Recursive causal discovery reduces errors and complexity in causal graph learning.
problem Challenges in causal discovery from limited data and computational complexity.
method Removable variables for recursive causal discovery, reducing problem size and CI tests.
result Worst-case performances nearly match lower bound, with state-of-the-art efficiency.
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.
Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation. While these algorithms perform well for bi-partitioning tasks, their recursive extensions yield unimpressive results for multiclass clustering tasks. This paper presents a g…
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…
The paper computes infinitesimals for group actions on a multispace of curves.
problem Examining group actions on a multispace of curves.
method Formal study using recursion relations, closely mimicking jet space prolongation.
result Produces a recursion relation for infinitesimals in the multispace.
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.
Quantization techniques have been applied in many challenging finance applications, including pricing claims with path dependence and early exercise features, stochastic optimal control, filtering problems and efficient calibration of large derivative books. Recursive Marginal Quantization of the Euler scheme has recen…
Researchers derived Kauffman bracket polynomial for Celtic link shadows using two methods.
problem Calculating the Kauffman bracket polynomial for Celtic link shadows.
method Two complementary approaches: recursive relation and 4-tangle algebra.
result Derived Kauffman bracket polynomial for CK42n shadows. Improved disentanglement of data factors using recursive training.
problem Current unsupervised disentanglement methods are inconsistent and fail to achieve levels of disentanglement seen in supervised approaches.
method Introduced PBT for VAEs, used UDR for heuristic scoring, and developed recursive rPU-VAE approach.
result Recursive training leads to robust disentanglement of data factors across multiple datasets.
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.
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.
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.
In its simplest form, the traffic flow prediction problem is restricted to predicting a single time-step into the future. Multi-step traffic flow prediction extends this set-up to the case where predicting multiple time-steps into the future based on some finite history is of interest. This problem is significantly mor…
In the spirit of [Surya07'], we develop an average problem approach to prove the optimality of threshold type strategies for optimal stopping of Lévy models with a continuous additive functional (CAF) discounting. Under spectrally negative models, we specialize this in terms of conditions on the reward function and ran…
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.
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.
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.