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

183365548730 · Jun 202019922001200920172026
48 results for neighborhood cumulative density function

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.

UN-AVOIDS visualizes and detects anomalies without needing labeled data.

problem The need for a unified framework to visualize and detect anomalies.
method UN-AVOIDS is an unsupervised, nonparametric approach that transforms data into a new space (NCDF) for both visualization and detection.
result UN-AVOIDS assigns invariant anomalous scores and achieves high AUC in detecting anomalies.

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 ↗

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.

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.

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 ↗

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.

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.

Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popul…

2016-12-14abs ↗pdf ↗

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.

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.

When selecting locations for a set of facilities, standard clustering algorithms may place unfair burden on some individuals and neighborhoods. We formulate a fairness concept that takes local population densities into account. In particular, given kk facilities to locate and a population of size nn, we define the "n…

2019-08-23abs ↗pdf ↗

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.

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 ↗

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.

Graph representation learning, aiming to learn low-dimensional representations which capture the geometric dependencies between nodes in the original graph, has gained increasing popularity in a variety of graph analysis tasks, including node classification and link prediction. Existing representation learning methods …

2019-10-04abs ↗pdf ↗

We propose a novel approach for density estimation with exponential families for the case when the true density may not fall within the chosen family. Our approach augments the sufficient statistics with features designed to accumulate probability mass in the neighborhood of the observed points, resulting in a non-para…

2012-06-22abs ↗pdf ↗

GT is a new method for denoising and enhancing datasets using Gaussian density estimates.

problem Improving latent structures in datasets.
method GT is an iterative method that generates a new distance function by computing the 2\ell^2-Wasserstein distance between Gaussian density estimates.
result GT is stable under perturbations and asymptotically ellipsoidal neighborhoods in the continuous case.

Structure learning in random fields has attracted considerable attention due to its difficulty and importance in areas such as remote sensing, computational biology, natural language processing, protein networks, and social network analysis. We consider the problem of estimating the probabilistic graph structure associ…

2011-11-02abs ↗pdf ↗

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

Plots show miscalibration directly as slopes of secant lines.

problem Detecting discrepancies between probabilistic predictions and actual outcomes.
method Cumulative differences between observed and expected values displayed as slopes of secant lines.
result Directly shows miscalibration without binning or kernel density estimation.

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.

In this work, we study the problem of reconstructing shapes from simple nonasymptotic densities measured only along shape boundaries. The particular density we study is also known as the integral area invariant and corresponds to the area of a disk centered on the boundary that is also inside the shape. It is easy to s…

2013-08-12abs ↗pdf ↗

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.

New approach to Generalized Beta family using SDEs.

problem Understanding the Generalized Beta family of distributions.
method Using a mean-reverting SDE for a power of the variable, leading to a modified GB distribution.
result Provides alternative forms and cumulative distribution functions for GB distributions.

Algorithm infers sampling distribution from i.i.d. samples without supervision.

problem Learning probability distributions from unlabeled data.
method Unsupervised tree boosting using additive tree ensembles and new distributional operations.
result Algorithm outperforms deep learning in multivariate density estimation.

We investigate relaxation and correlations in a class of mean-reverting models for stochastic variances. We derive closed-form expressions for the correlation functions and leverage for a general form of the stochastic term. We also discuss correlation functions and leverage for three specific models -- multiplicative,…

2019-07-11abs ↗pdf ↗

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.