Research
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,695 papers · 148 categories

Trend · papers per month

15314661 · May 202619922001200920172026
48 results for cumulant recursion

The study examines neural networks with random weights and biases, finding that depth-to-width ratio controls fluctuations and correlations.

problem Exploring the exploding and vanishing gradient problem in neural networks with random weights and biases.
method Sharp estimates of joint cumulants and solving cumulant recursions in powers of 1/n.
result The depth-to-width ratio L/nL/n plays a crucial role in controlling fluctuations and correlations, leading to the occurrence of exploding and vanishing gradients.

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.

Proposes a method to partition univariate data into unimodal subsets.

problem Partitioning univariate multimodal data into unimodal subsets.
method Recursive splitting around valley points of the data density using properties of critical points on the convex hull of the ecdf plot.
result Obtains a hierarchical statistical model of the initial dataset as a mixture of UMMs.

Symmetry in neural networks affects generalization, as shown by CLT and RG transformations.

problem Improving generalization in neural networks by incorporating physical symmetries.
method Evaluation of symmetry constraints and expressivity in MLPs and GNNs using the CLT as a test case.
result Overly complex or overconstrained models generalize poorly, revealing a competition between symmetry constraints and expressivity.

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 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…

2018-03-05abs ↗pdf ↗

New algorithm reduces regret in linear mixture SSPs without cost bounds.

problem Learning optimal paths in stochastic environments with cost constraints.
method Extended value iteration with variance-aware confidence set.
result Achieves nearly minimax optimal regret bound of O(dBK)O(dB_*\sqrt{K}).

Paper addresses global convergence of MLR estimation under weak data conditions.

problem Learning mixed linear regression models with general data conditions.
method Two-step recursive identification algorithm using least squares and EM principles.
result Global convergence and optimal clustering performance established under general data conditions.

Controller-Augmented Hidden Markov Models (CHMMs) are a framework for constrained sequential inference.

problem Hidden Markov models fail under pathwise constraints like precedence, visitation, or monotonic state progression.
method CHMMs compile constraints into finite-state controllers, then use standard forward-backward and Viterbi recursions to compute exact constrained posteriors and paths.
result CHMMs provide exact constrained inference, monotone ascent in constrained EM, and linear complexity in controller cardinality.

New algorithm identifies causal effects in latent confounding models.

problem Identifying causal effects in linear non-Gaussian models with latent confounding.
method Recursive algorithm using rank conditions on higher-order cumulants.
result Algorithm achieves comparable performance to overcomplete ICA without knowing the number of latent variables.

Overview of risk-sensitive Markov decision processes with Optimized Certainty Equivalent.

problem Optimizing decision-making under risk in Markov processes.
method Analyzes risk-sensitive criteria using Optimized Certainty Equivalent, including entropic risk and Conditional Value-at-Risk.
result Conditions for the existence of optimal policies and solution procedures are provided.

Derives a general derivative identity for conditional mean in Gaussian noise.

problem Understanding conditional mean in Gaussian noise channels.
method Derives a general derivative identity for the conditional mean of X{\bf X} given Y=y{\bf Y}={\bf y} in a Markov chain UXY{\bf U} \leftrightarrow {\bf X} \leftrightarrow {\bf Y}.
result Provides a unifying view of conditional mean identities and derives new ones.

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.

Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.

problem Understanding how LLMs internalize statistical structure during next-token prediction.
method Cumulant-expansion framework treating softmax entropy as perturbation around center distribution.
result Cumulants reveal distinct signatures for mathematical vs. general text prompts, quantifying feature-learning dynamics.

The CSA-ES is an Evolution Strategy with Cumulative Step size Adaptation, where the step size is adapted measuring the length of a so-called cumulative path. The cumulative path is a combination of the previous steps realized by the algorithm, where the importance of each step decreases with time. This article studies …

2012-12-01abs ↗pdf ↗

Using methods introduced by Scargle in 1978 we derive a cumulative version of the Lomb periodogram that exhibits frequency independent statistics when applied to cumulative noise. We show how this cumulative Lomb periodogram allows us to estimate the significance of log-periodic signatures in the S&P 500 anti-bubble th…

2003-02-25abs ↗pdf ↗

The rough Heston model emerges from scaling bivariate INAR processes, linking microstructure to option pricing.

problem Modeling and pricing financial options with heavy-tailed and cumulative processes.
method Scaling limit of bivariate INAR processes converging to rough Heston model, explicit formulas linking asymmetry parameters to volatility.
result Weak-error estimates and FFT-accelerated simulation for European and path-dependent options.

Harer and Zagier proved a recursion to enumerate gluings of a 2d2d-gon that result in an orientable genus gg 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…

2018-12-31abs ↗pdf ↗

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.

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.

Kernelized cumulants improve statistical analysis in high-dimensional spaces.

problem Statistical analysis in high-dimensional spaces with low variance estimators.
method Extending cumulants to RKHS using tensor algebra and kernel trick.
result Kernelized cumulants provide new all-purpose statistics with computational tractability.

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…

2014-11-20abs ↗pdf ↗

Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.

problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.

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)W_1^{(g)} of the genus expansion of the one-loop mean are polynomials. We find a generalization of th…

2015-12-31abs ↗pdf ↗

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…

2016-05-19abs ↗pdf ↗

Private estimation of many quantiles using differential privacy.

problem Estimating quantiles of a distribution privately.
method Two approaches: 1) Private estimation of empirical quantiles, 2) Uniform density estimation.
result There is a tradeoff between estimating quantiles at specific points and uniformly estimating the quantile function.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

A new GAN loss function based on cumulant generating functions improves stability and robustness.

problem Improving the stability and performance of GANs.
method Cumulant GAN loss function based on variational R{é}nyi divergence.
result Cumulant GAN achieves linear convergence to Nash equilibrium and superior performance in image generation.

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.

In this paper, we investigate cost-aware joint learning and optimization for multi-channel opportunistic spectrum access in a cognitive radio system. We investigate a discrete time model where the time axis is partitioned into frames. Each frame consists of a sensing phase, followed by a transmission phase. During the …

2018-04-11abs ↗pdf ↗

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.