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.

169,181 papers · 148 categories

Trend · papers per month

295887116 · Jun 202619922001200920182026
48 results for cumulative production

This paper describes an agent-based model of interacting firms, in which interacting firm agents rationally invest capital and labor in order to maximize payoff. Both transactions and production are taken into account in this model. First, the performance of individual firms on a real transaction network was simulated.…

2006-07-31abs ↗pdf ↗

We consider a financial contract that delivers a single cash flow given by the terminal value of a cumulative gains process. The problem of modelling and pricing such an asset and associated derivatives is important, for example, in the determination of optimal insurance claims reserve policies, and in the pricing of r…

2007-10-15abs ↗pdf ↗

We develop an algebraic framework for the description and analysis of financial behaviours, that is, behaviours that consist of transferring certain amounts of money at planned times. To a large extent, analysis of financial products amounts to analysis of such behaviours. We formalize the cumulative interest compliant…

2009-01-20abs ↗pdf ↗

One approach for constructing copula functions is by multiplication. Given that products of cumulative distribution functions (CDFs) are also CDFs, an adjustment to this multiplication will result in a copula model, as discussed by Liebscher (J Mult Analysis, 2008). Parameterizing models via products of CDFs has some a…

2015-11-09abs ↗pdf ↗

Are large scale research programs that include many projects more productive than smaller ones with fewer projects? This problem of economy of scale is particularly relevant for understanding recent mergers in particular in the pharmaceutical industry. We present a quantitative theory based on the characterization of d…

2000-01-31abs ↗pdf ↗

A new pricing strategy maximizes revenue in high-dimensional product spaces with varying customer preferences.

problem Maximizing revenue in a high-dimensional product space with heterogeneous price sensitivity.
method Proposes M3P, a pricing policy that achieves a specific regret bound under heterogeneous price sensitivity.
result Achieves a TT-period regret of O(log(Td)(T+dlog(T)))O(\log(Td) (\sqrt{T} + d\log(T))).

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.

This work studies the chord length distribution, in the case where both ends lie on a NN-dimensional hypersphere (N2N \geq 2). Actually, after connecting this distribution to the recently estimated surface of a hyperspherical cap \cite{SLi11}, closed-form expressions of both the probability density function and the cu…

2014-11-20abs ↗pdf ↗

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 ↗

A large number of online services provide automated recommendations to help users to navigate through a large collection of items. New items (products, videos, songs, advertisements) are suggested on the basis of the user's past history and --when available-- her demographic profile. Recommendations have to satisfy the…

2013-01-08abs ↗pdf ↗

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.

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.

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.

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.

Proposes a curriculum learning algorithm to maximize cumulative return in reinforcement learning.

problem Maximizing cumulative return in reinforcement learning tasks.
method Task sequencing algorithm maximizing cumulative return, using curriculum learning to minimize suboptimal actions.
result Significantly better performance on cumulative return maximization compared to metaheuristic algorithms.

Bayesian methods improve inference for cumulative probit models on large datasets.

problem Challenges in Bayesian inference for large cumulative probit models.
method Proposed scalable algorithms using Variational Bayes and Expectation Propagation.
result Superior computational performance and accuracy compared to MCMC.

The problem of an arbitrary truncated Levy flight description using the method of cumulant approach has been solved. The set of cumulants of the truncated Levy distribution given the assumption of arbitrary truncation has been found. The influence of truncation shape on the truncated Levy flight properties in the Gauss…

2010-06-12abs ↗pdf ↗

New method learns stochastic thermodynamics from system currents.

problem Understanding entropy production in complex dynamical systems.
method Constructs learning framework using currents and machine learning loss functions.
result Derives loss functions for thermodynamic functions directly from dynamics.

CENNSurv models cumulative effects of time-dependent exposures on survival outcomes.

problem Challenges in modeling cumulative effects of time-dependent exposures on survival outcomes.
method CENNSurv, a novel deep learning approach that captures dynamic risk relationships from time-dependent data.
result CENNSurv reveals multi-year lagged and short-term behavioral shifts in survival outcomes.

HOFLON automates process start-ups and grade-changes using offline RL and online optimization.

problem Manual operation of start-ups and grade-changes by experts is declining, leaving plant owners without the necessary tacit know-how.
method HOFLON combines offline RL to learn a latent manifold and long-horizon Q-critic, and online optimization to maximize Q-critic while penalizing deviations and excessive variable changes.
result HOFLON outperforms standard offline RL in industrial case studies, delivering better cumulative rewards than historical data.

A novel bandit problem with delayed arms, showing optimal strategies and lower bounds.

problem Optimizing reward in a stochastic multi-armed bandit setting with delayed arms.
method Mapping to PINWHEEL scheduling problem, simple greedy algorithm, UCB based algorithm, lower bounds.
result Simple greedy algorithm is asymptotically (11/e)(1-1/e) optimal and UCB based algorithm has clogT+o(logT)c \log T + o(\log T) cumulative regret.

New algorithms minimize simple and cumulative regret in contextual bandits.

problem Minimizing simple and cumulative regret in contextual bandit settings.
method Proposed new algorithms using conformal arm sets (CASs).
result Near-optimal minimax guarantees for simple regret and state-of-the-art guarantees for cumulative regret.

New method calibrates classifier probabilities with guaranteed coverage.

problem Inaccurate probability estimates by classifiers in high-risk applications.
method Adaptive temperature scaling algorithm for conformal prediction.
result Improves calibration error measures and standard metrics across various tasks.

Paper converts quantiles to cumulative distribution functions to simplify risk measures.

problem Technical assumptions in risk measure calculations.
method Invention of converting integrated quantiles to integrated cumulative distribution functions.
result Avoids the need for probability density function existence.

Develops regression trees for estimating cumulative incidence curves in competing risks.

problem Estimating cumulative incidence functions in competing risks settings.
method Uses augmented estimators of the Brier score risk to build and prune regression trees.
result Demonstrates the utility of the proposed methods through simulation studies and real data.

IPO optimizes reinforcement learning with constraints for better performance.

problem Maximizing long-term reward while satisfying cumulative constraints in decision problems.
method Interior-point Policy Optimization (IPO) using logarithmic barrier functions.
result IPO outperforms state-of-the-art baselines in reward maximization and constraint satisfaction.

A new model relaxes constraints on exponential dispersion models.

problem Tight conditions on cumulant function limit the class of exponential dispersion models.
method Introduces K-LED model with Legendre cumulant function and Bregman divergence guidance.
result The model allows for easier computation of mean parameter and includes various distributions.

Paper proposes a new method to identify causal graphs with latent variables using higher-order cumulants.

problem Estimating causal directed acyclic graphs with latent confounders.
method Uses higher-order cumulants to identify causal structures among observed and latent variables.
result Validates the proposed algorithm through simulations and real-world data.

The paper identifies causal effects in latent variable models using higher-order cumulants.

problem Challenges in identifying causal effects in latent variable models with latent confounders.
method Using higher-order cumulants, the paper addresses two challenging setups: a single proxy variable and underspecified instrumental variables.
result Causal effects are identifiable with a single proxy or instrument.

We show power-scaling behaviors for fluctuations in share volume, which no other studies have so far done. After analyzing a database of the daily transactions for all securities listed on the Tokyo Stock Exchange, we selected 1050 large companies that each had an unbroken series of daily trading activity from January …

2003-02-24abs ↗pdf ↗

Proposes a new sampling method for online learning with cumulative oversampling.

problem Budgeted Influence Maximization in online learning.
method Cumulative Oversampling (CO) method for online learning.
result CO-based algorithm achieves comparable regret to UCB-based algorithms and performs similarly to Thompson Sampling.

The paper tackles non-cumulative objectives in reinforcement learning and proposes modifications to existing algorithms.

problem Optimizing objectives that are not naturally expressed as summations of rewards in various fields.
method The paper modifies the Bellman optimality equation to handle non-cumulative objectives by replacing summation with a generalized operation.
result The modified Bellman updates can converge to the globally optimal solution under certain conditions.

Sandpile Economics explains how economies can be prone to large crises from small shocks.

problem Capitalist economies' recurrent crises disproportionate to shocks.
method Formal framework interpreting instability as geometric fragility of production networks.
result Curvature of production networks predicts medium-run output dynamics and resilience.

New method corrects bias in datasets using cumulative distribution functions.

problem Varying domains and biased datasets lead to differences between training and target distributions.
method Empirical cumulative distribution function estimates of the target distribution, rigorously generalized.
result Method is more robust, not reliant on parameter tuning, and performs similarly to state-of-the-art techniques.

The paper revisits expected signatures in semimartingale models, providing new formulae and simplifying complexity.

problem Computing expected signatures in semimartingale models.
method Revisits and provides new formulae for computing expected signatures in a general semimartingale setting.
result Log-transform of expected signatures simplifies complexity, leading to signature cumulants.

Develops a test for strict stationarity in stochastic processes.

problem Testing strict stationarity of discrete time stochastic processes.
method Window averaged sample estimate of second order cumulant spectrum, asymptotic complex standard normal distribution test.
result Test statistic derived and demonstrated with 137Cs gamma ray decay data.