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

2515017521,002 · Jun 202019922001200920172026
48 results for empirical cumulative density function

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.

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.

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 ↗

Researchers calculate the Laplace transform of a geometric Brownian motion integral.

problem Calculating the Laplace transform of a specific integral functional of geometric Brownian motion.
method Analytical calculation of the Laplace transform of the cumulative distribution and probability density functions.
result The Laplace transform of the integral functional of geometric Brownian motion is derived.

A flexible nonparametric online changepoint detection algorithm for high-frequency data.

problem Detecting changes in real-time in high-frequency data streams with limited computational resources.
method NP-FOCuS, a sequential likelihood ratio test for a change in the empirical cumulative density function, using functional pruning.
result NP-FOCuS outperforms current nonparametric online changepoint techniques in various settings.

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.

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 ↗

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.

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.

This paper investigates the rank distribution, cumulative probability, and probability density of price returns for the stocks traded in the KSE and the KOSDAQ market. This research demonstrates that the rank distribution is consistent approximately with the Zipf's law with exponent α=1.00α= -1.00 (KSE) and -1.31 (KOSDAQ),…

2004-05-18abs ↗pdf ↗

Paper models and forecasts intra-day electricity price spreads.

problem Forecasting intra-day price spreads for electricity traders and operators.
method Dynamic density functions based on skewed-t distributions, conditional on exogenous drivers.
result Best fitting and forecasting specifications selected using Pinball Loss function.

The task of calibration is to retrospectively adjust the outputs from a machine learning model to provide better probability estimates on the target variable. While calibration has been investigated thoroughly in classification, it has not yet been well-established for regression tasks. This paper considers the problem…

2018-06-20abs ↗pdf ↗

We investigate the distribution function and the cumulative probability for Korean household incomes, i.e., the current, labor, and property incomes. For our case, the distribution functions are consistent with a power law. It is also showed that the probability density of income growth rates almost has the form of a e…

2004-03-05abs ↗pdf ↗

This work tackles multivariate CDFs and copulas using tensor factorization.

problem Learning multivariate distributions, especially for mixed random variables, is challenging.
method Introducing a low-rank model for efficient sampling, inference, and uncertainty quantification.
result The proposed model outperforms traditional methods in various applications.

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.

Study online monotone density estimation with expert aggregation and log-optimal calibration.

problem Online monotone density estimation and log-optimal calibration.
method Proposed two online estimators: Grenander estimator and expert aggregation estimator.
result Online estimators achieve O(n1/3)O(n^{1/3}) cumulative log-likelihood gap and nlogn\sqrt{n\log{n}} pathwise regret bound.

We investigate the position of the Buchen-Kelly density in a family of entropy maximising densities which all match European call option prices for a given maturity observed in the market. Using the Legendre transform which links the entropy function and the cumulant generating function, we show that it is both the uni…

2011-02-01abs ↗pdf ↗

A new model uses neural networks to efficiently learn multivariate temporal point processes.

problem Efficiently modeling multivariate temporal point processes with low parameter complexity.
method Modeling the cumulative hazard function with neural networks for each variate.
result The proposed model achieves state-of-the-art performance on data fitting and event prediction tasks.

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.

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.

Develops deep learning for fast, accurate option pricing models.

problem Computational efficiency and accuracy in option pricing models.
method Neural network generators solving backward Kolmogorov equations for TPDFs.
result Ultra-fast, highly accurate option pricing models for various asset models.

Estimates financial market impacts of COVID-19 using time-varying kernel density.

problem Estimating the impact of COVID-19 on financial markets over time.
method Time-varying kernel density estimation with Kolmogorov-Smirnov statistic.
result Determines the chronology and regional disparities of financial market impacts.

New scoring rules for multivariate distributions and level sets.

problem Evaluating forecast accuracy for multivariate distributions and level sets.
method Theoretical framework for scoring rules, decomposition of multivariate scoring functions, numerical algorithm for computation.
result New scoring functions for multivariate distributions and level sets, including density and cumulative distribution level sets.

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 ↗

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.

While Gaussian probability densities are omnipresent in applied mathematics, Gaussian cumulative probabilities are hard to calculate in any but the univariate case. We study the utility of Expectation Propagation (EP) as an approximate integration method for this problem. For rectangular integration regions, the approx…

2011-11-29abs ↗pdf ↗

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.

The paper models financial order books using geometric shears and directional liquidity.

problem Understanding the geometry and dynamics of financial order books.
method Structural framework modeling liquidity as emergent observables, geometric shears, and directional imbalances.
result The geometry of financial order books can be described by a rigid drift and geometric shear, leading to a gamma-like profile of projected liquidity.

TVBO optimizes time-varying functions with asymptotically vanishing regret.

problem Understanding the asymptotic performance of TVBO for time-varying black-box functions.
method Provided upper and lower bounds for cumulative regret of TVBO algorithms.
result TVBO algorithms can achieve asymptotically vanishing regret under certain conditions.

A neural network method estimates densities from characteristic functions.

problem Estimating fixed-horizon probability densities from empirical characteristic functions.
method Data-driven Fourier-mixture neural-network method trained in Fourier space.
result Competitive performance and clear gains on heavy-tailed targets.

Paper uses a new copula to model risk aggregation and capital allocation.

problem Modeling dependence between risks for risk aggregation and capital allocation.
method Uses a generalized Archimedean copula (mixed Bernstein copula) to define dependence structure and derives closed-form risk measures.
result Closed-form expressions for tail value-at-risk and allocations are derived.

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 ↗

Improved regret bounds for adversarial linear contextual bandits.

problem Adversarial linear contextual bandits with changing loss functions.
method Truncated continuous exponential weights algorithm over the probability simplex, analyzing with linear bandit setting without contexts.
result Second-order bound of ildeO(KdVT) ilde O(K\sqrt{d V_T}) and first-order bound of ildeO(KdLT) ilde O(K\sqrt{d L_T^*}).

The paper proposes a new method for density estimation using spline quasi-interpolation for clustering.

problem Density estimation and clustering modeling for multivariate data.
method Spline quasi-interpolation for mono-variate approximation, copulas for multivariate modeling.
result The proposed method achieves accurate clustering of data using copulas and spline quasi-interpolation.

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.

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.