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

Trend · papers per month

4081121161 · May 202619922001200920172026
48 results for cumulative variance

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.

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.

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 paper prices energy spread options using a complex stochastic model.

problem Pricing energy spread options with specific stochastic dynamics.
method Uses an exponential Ornstein-Uhlenbeck process driven by variance gamma processes, applying the Esscher transform and FFT method.
result Derives an analytical formula for pricing forwards and spread options.

We introduce the class of affine forward variance (AFV) models of which both the conventional Heston model and the rough Heston model are special cases. We show that AFV models can be characterized by the affine form of their cumulant generating function, which can be obtained as solution of a convolution Riccati equat…

2018-01-19abs ↗pdf ↗

New algorithm offers costless model selection in contextual bandits.

problem Minimizing cumulative regret in stochastic contextual bandits.
method Gradually increasing class complexity and adapting to the simplest class with dominant estimation variance.
result Costless model selection is feasible under certain conditions, providing improved regret guarantees.

Derives operational-time variance kernel for reaction boundaries in financial markets.

problem Separating components in volatility models to better understand market dynamics.
method Derives a variance kernel for a latent-order-book reaction boundary, separating structural boundary cumulant, clock projection, and pricing-measure choice.
result Operational variance has a closed asymptotic form for long-memory forcing, with effective signed-forcing intensity and resilience.

The study compares parametric and nonparametric models for estimating mean-variance mixtures and finds that nonparametric models perform better.

problem Estimating the distribution of a normal mean-variance mixture under uncertainty.
method Comparison of six parametric mixing laws with a grid nonparametric maximum likelihood estimator, using a paired block bootstrap for score comparison.
result Nonparametric models outperform parametric models in estimating the distribution of a normal mean-variance mixture.

We introduce a faithful representation of the heavy tail multivariate distribution of asset returns, as parsimonous as the Gaussian framework. Using calculation techniques of functional integration and Feynman diagrams borrowed from particle physics, we characterize precisely, through its cumulants of high order, the d…

1998-11-19abs ↗pdf ↗

This paper presents a multinomial method for option pricing when the underlying asset follows an exponential Variance Gamma process. The continuous time Variance Gamma process is approximated by a discrete time Markov chain with the same firsts four cumulants. This approach is particularly convenient for pricing Americ…

2016-12-31abs ↗pdf ↗

Derives variance kernel for reaction boundary in financial models.

problem Separating components in financial volatility models.
method Operational-time variance kernel, damped Abel response kernel, closed asymptotic form.
result Operational variance has a closed asymptotic form involving various parameters.

The paper analyzes worst-case distortion risk metrics and weighted entropy under partial information.

problem Analyzing worst-case distortion risk metrics and weighted entropy with limited information.
method General distributions, partial information (mean and variance), various entropies and risk measures.
result Provides worst-case results for distortion risk metrics and weighted entropy.

This study optimizes stock portfolios for Indian sectors using historical data.

problem Challenges in optimizing stock portfolios due to volatility and future value estimation.
method Used Sharpe, Sortino, and Calmar ratios to design mean-variance optimized portfolios.
result Identified the ratio that maximizes cumulative returns for most sectors.

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.

Paper proposes a method to estimate confidence bands for survival random forests.

problem No statistically valid and computationally feasible approach for estimating confidence bands for survival random forests.
method Extending recent developments in infinite-order incomplete U-statistics, the paper proposes an unbiased confidence band estimation.
result The proposed method accurately estimates the confidence band and achieves desired coverage rate.

The paper proves a regret bound for a sub-Gaussian mixture on unbounded data.

problem Tackles the challenge of achieving regret bounds for sub-Gaussian mixtures on unbounded data.
method Uses path-wise (deterministic) regret bounds and a cumulative variance process to derive the bound.
result Shows that on a specific event, the regret is eventually bounded by ln(ln V_T).

The objective in a traditional reinforcement learning (RL) problem is to find a policy that optimizes the expected value of a performance metric such as the infinite-horizon cumulative discounted or long-run average cost/reward. In practice, optimizing the expected value alone may not be satisfactory, in that it may be…

2018-10-22abs ↗pdf ↗

The paper develops a robust algorithm for contextual bandits with heavy-tailed rewards.

problem Contextual bandits with heavy-tailed rewards.
method Develops an algorithm based on Catoni's estimator for robust statistics, applying it to contextual bandits with general function approximation.
result Establishes regret bounds that depend on cumulative reward variance and logarithmically on the reward range and number of rounds.

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}).

A new method reduces variance in PG methods for RL, improving efficiency and convergence.

problem Improving sample efficiency and convergence of policy gradient methods in reinforcement learning.
method Proposes a gradient truncation mechanism and designs TSIVR-PG method to maximize rewards and utility.
result Shows sample complexity of TSIVR-PG to find ε-stationary policy and global ε-optimal policy.

Study identifies contagion in aggregated defaults despite environmental changes.

problem Identify contagion in aggregated default counts with fluctuating probabilities.
method Compare three contagion mechanisms (Davis-Lo, Torri, Vasicek) under i.i.d. and hierarchical specifications.
result Threshold contagion is largely absorbed into environmental heterogeneity, while cumulative contagion leaves a persistent signature.

New method estimates SW distance using CDFs for scalable data parallelism.

problem Estimating SW distance efficiently for large datasets.
method Estimators based on CDFs of projected measures, avoiding sorting.
result Efficient estimation for large datasets and federated learning.

The stochastic multi-armed bandit (MAB) problem is a common model for sequential decision problems. In the standard setup, a decision maker has to choose at every instant between several competing arms, each of them provides a scalar random variable, referred to as a "reward." Nearly all research on this topic consider…

2018-06-04abs ↗pdf ↗

Cryptocurrency markets show similar returns but different volatility responses to infrastructure and regulatory shocks.

problem Understanding how cryptocurrency markets differentiate between infrastructure and regulatory shocks.
method Event-level block bootstrap inference on 31 cryptocurrency events across Bitcoin, Ethereum, Solana, and Cardano (2019-2025).
result No statistically significant difference in cumulative abnormal returns between infrastructure failures and regulatory enforcement.

New method quantifies uncertainty in reinforcement learning models.

problem Quantifying uncertainty over expected cumulative rewards in reinforcement learning.
method Proposes a new uncertainty Bellman equation to more accurately estimate value function variance.
result Our method converges to the true posterior variance over values and improves sample-efficiency.

The paper proposes a new method for clustering survival data using smoothed log-hazard trajectories.

problem Clustering survival data based on instantaneous risk dynamics.
method Functional Principal Component Analysis applied to B-spline smoothed log-hazard trajectories.
result The proposed method provides an interpretable representation of relative temporal risk dynamics.

Improved regret bounds for online convex optimization under stochastic and adversarial settings.

problem Interpolating between stochastic and adversarial online convex optimization.
method Optimistic online mirror descent (OMD) for the Stochastically Extended Adversarial (SEA) model.
result Established new regret bounds for various function classes.

We consider a stochastic bandit problem with infinitely many arms. In this setting, the learner has no chance of trying all the arms even once and has to dedicate its limited number of samples only to a certain number of arms. All previous algorithms for this setting were designed for minimizing the cumulative regret o…

2015-05-18abs ↗pdf ↗

This paper addresses dueling bandits with contextual information, improving regret bounds by accounting for variance.

problem Minimizing cumulative regret in dueling bandits with contextual information.
method Proposes a new SupLinUCB-type algorithm for contextual dueling bandits with variance-aware regret bound.
result Achieves a variance-aware regret bound of ildeO(dt=1Tσt2+d) ilde O\big(d\sqrt{\sum_{t=1}^Tσ_t^2} + d\big).

Significant improvements in regret analysis for adaptive online learning problems.

problem Exploiting low variance in online learning problems without known variances.
method Novel peeling-based regret analysis leveraging elliptical potential `count` lemma.
result Significant improvements in regret bounds for linear bandits and linear mixture MDPs.

Study tackles infinitely many-armed bandits with rotting rewards, achieving tight regret bounds.

problem Infinitely many-armed bandits with rotting rewards.
method Adaptive sliding window UCB algorithm for slow and abrupt rotting scenarios.
result Achieves tight regret bounds for both slow and abrupt rotting scenarios.

This paper analyzes OCBA algorithms' convergence rates for DEDS optimization.

problem Optimizing discrete-event dynamic systems with limited computing resources.
method Characterizes convergence rates of two OCBA algorithms under different performance measures.
result OCBA algorithms achieve optimal convergence rates under probability of correct selection and expected opportunity cost measures.

In this study we prove the existence of statistical arbitrage opportunities in the Black-Scholes framework by considering trading strategies that consists of borrowing from the risk free rate and taking a long position in the stock until it hits a deterministic barrier level. We derive analytical formulas for the expec…

2014-06-21abs ↗pdf ↗

The paper studies empirical processes from nearest neighbors in regression.

problem Estimating conditional cumulative distribution functions and local linear regression.
method Uniform central limit theorem and non-asymptotic bound under local bracketing entropy and uniform entropy numbers.
result Gaussian limit of empirical process with simple covariance.

We extend and test empirically the multifractal model of asset returns based on a multiplicative cascade of volatilities from large to small time scales. The multifractal description of asset fluctuations is generalized into a multivariate framework to account simultaneously for correlations across times scales and bet…

2000-08-04abs ↗pdf ↗

This paper optimizes importance sampling for rare-event options pricing under the Heston model.

problem Efficiently pricing European call options with short maturity and deep out-of-the-money strikes.
method Asymptotic importance sampling schemes leveraging the large deviation principle and state-dependent change of measure.
result Proposed IS methods achieve logarithmic efficiency in short-maturity and deep OTM regimes, significantly reducing variance.

This paper optimizes cryptocurrency portfolios by integrating sentiment analysis with technical indicators.

problem Effective portfolio management in volatile cryptocurrency markets.
method Dynamic portfolio strategy using technical indicators and sentiment analysis.
result The integrated approach outperforms traditional benchmarks and achieves stronger risk-adjusted returns.

Model predicts stock price changes and forecasts using tokenized data.

problem Challenges in stock price forecasting and prediction due to dynamic data and statistical differences.
method Introduces PCIE model with tokenization to handle both forecasting and prediction.
result PCIE model outperforms state-of-the-art models in forecast and prediction tasks.