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

Trend · papers per month

212423635846 · Jun 202019922001200920172026
48 results for empirical cumulative distribution

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.

ECOD detects outliers without parameters, fast and simple.

problem Detecting outliers in large, high-dimensional datasets efficiently and interpretably.
method ECOD estimates empirical cumulative distribution functions per dimension, then computes tail probabilities and outlier scores.
result ECOD outperforms state-of-the-art methods in accuracy, efficiency, and scalability.

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

Paper speeds up Gaussian process inference using Matérn kernels.

problem Efficiently performing Gaussian process inference for large datasets.
method Exact Matérn kernel decomposition into empirical cumulative distribution functions, combined with divide-and-conquer approach.
result The proposed algorithm significantly speeds up Gaussian process inference for low-dimensional problems with hundreds of thousands of data points.

The paper proposes a new method to evaluate LLM agent responses using ECDF clustering.

problem The standard evaluation of LLM agent responses via majority voting obscures response quality and distribution.
method The paper introduces a novel evaluation framework based on ECDF of cosine similarities and clustering of ECDFs using distances and kk-medoids algorithm.
result ECDF clustering reveals interpretable group structures in LLM responses, offering insights into agent settings.

The paper introduces a spline-based method for calibrating neural networks.

problem Ensuring neural network outputs are reliable for safety-critical applications.
method Approximating the empirical cumulative distribution function using splines to map network outputs to calibrated probabilities.
result The spline-based recalibration consistently outperforms existing methods on calibration measures.

AI learns to classify and represent univariate distributions in a 2D latent space.

problem Classifying and representing univariate empirical distributions.
method Unsupervised beta variational autoencoder (beta-VAE) to separate and represent distributions in a 2D latent space.
result The latent space representation separates distributions of different shapes while overlapping similar ones.

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.

Develops uniform convergence guarantees for a broad class of risk functionals in supervised learning.

problem Bounding generalization gaps for various risk functionals beyond the expectation.
method Establishes uniform convergence for Hölder risk functionals, providing guarantees for empirical risk minimization.
result First uniform convergence results for estimating the CDF of loss distributions, applicable to various risk functionals.

Diffusion models learn simple statistics before complex ones, revealing a sample complexity exponent.

problem Understanding the learning dynamics of diffusion models.
method Empirical observations and theoretical analysis of diffusion models and denoisers.
result Diffusion models learn simple statistics (pair-wise correlations) at linear sample complexity, while higher-order statistics (e.g., fourth cumulant) require cubic sample complexity.

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 ↗

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.

SafeML monitors ML systems for safety and security risks.

problem Ensuring safety and explainability of ML systems in safety-critical domains.
method Statistical difference measures of ECDF to detect distributional shifts.
result Approach can detect invalid application contexts of ML components.

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on which several probability distributions agree. Instead of minimizing an objective f…

2011-08-06abs ↗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.

EDRBO optimizes Bayesian optimization with continuous contexts using ensemble models and robust methods.

problem Bayesian optimization with unknown and continuous contextual distributions leads to suboptimal results.
method EDRBO uses ensemble surrogate models and Wasserstein ball ambiguity sets to handle uncertainty and maintain computational tractability.
result EDRBO achieves sublinear cumulative regret guarantees of order O(γTT)\mathcal{O}(γ_T \sqrt{T}).

We leverage neural networks as universal approximators of monotonic functions to build a parameterization of conditional cumulative distribution functions (CDFs). By the application of automatic differentiation with respect to response variables and then to parameters of this CDF representation, we are able to build bl…

2018-11-02abs ↗pdf ↗

Paper proposes a framework for reliable off-policy evaluation in reinforcement learning.

problem Quantifying uncertainty in off-policy estimates for safe deployment of target policies.
method Distributionally robust optimization for creating confidence bounds.
result Non-asymptotic and asymptotic guarantees for robust cumulative reward estimates.

We provide evidence that cumulative distributions of absolute normalized returns for the 100100 American companies with the highest market capitalization, uncover a critical behavior for different time scales ΔtΔt. Such cumulative distributions, in accordance with a variety of complex --and financial-- systems, can be m…

2017-02-20abs ↗pdf ↗

The paper studies quantile contributions and their relationship with order statistics in heavy-tailed distributions.

problem Challenges of classical statistical models in heavy-tailed distributions.
method Theoretical study of quantile contribution statistic and its relationship with order statistics. Derivation of closed-form expression for joint CDF of order statistics and quantile contributions.
result Established asymptotic normality of quantile contributions and characterized their limiting distribution.

A new model for stock price fluctuations is proposed, based upon an analogy with the motion of tracers in Gaussian random fields, as used in turbulent dispersion models and in studies of transport in dynamically disordered media. Analytical and numerical results for this model in a special limiting case of a single-sca…

2003-11-28abs ↗pdf ↗

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 ↗

Unified probabilistic gradient boosting for entire conditional distribution modeling.

problem Creating accurate probabilistic forecasts from regression tasks.
method Unified probabilistic gradient boosting framework using XGBoost and LightGBM, modeling conditional moments or CDF via Normalizing Flows.
result Achieves state-of-the-art forecast accuracy.

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.

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 ↗

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 ↗

New method identifies causal structure in count data using cumulants and path analysis.

problem Challenges in discovering causal structure from count data, especially due to non-identifiability.
method Poisson Branching Structural Causal Model (PB-SCM) with path analysis using high-order cumulants.
result Causal order is identifiable under specific conditions in PB-SCM using cumulant information.

Directed acyclic graphs (DAGs) are a popular framework to express multivariate probability distributions. Acyclic directed mixed graphs (ADMGs) are generalizations of DAGs that can succinctly capture much richer sets of conditional independencies, and are especially useful in modeling the effects of latent variables im…

2010-08-31abs ↗pdf ↗

We study the rank distribution, the cumulative probability, and the probability density of returns of stock prices of listed firms traded in four stock markets. We find that the rank distribution and the cumulative probability of stock prices traded in are consistent approximately with the Zipf's law or a power law. It…

2004-12-01abs ↗pdf ↗

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.

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.

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.

A new UU-test decides unimodality of datasets.

problem Deciding on the unimodality of a dataset for better data analysis.
method UU-test operates on the empirical cumulative density function (ecdf) to build a piecewise linear approximation that models the data as a Uniform Mixture Model.
result The UU-test provides a statistical model of the data in the form of a Uniform Mixture Model.