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

Trend · papers per month

4387130173 · May 202619922001200920172026
48 results for exponential density

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 ↗

Polynomial-time algorithm estimates edge density of random graphs with privacy and robustness.

problem Estimating edge density of random graphs while maintaining privacy and robustness.
method Sum-of-squares algorithm for robust edge density estimation and reduction from privacy to robustness.
result Optimal error rate up to logarithmic factors, matching theoretical lower bounds.

Incorporates matrix exponential into generative flows for improved performance.

problem Improving generative flow models for better density estimation.
method Integrates matrix exponential into generative flows, proposing new layers and modifying network architecture.
result The proposed model achieves great performance on density estimation.

Paper introduces kernel deformed exponential families for sparse continuous attention.

problem Creating efficient attention mechanisms for sparse data.
method Developed kernel deformed exponential families, theoretically and experimentally.
result Kernel deformed exponential families can attend to multiple compact regions of data.

The COS method for European options pricing is improved with a new bound for the number of terms.

problem Determining the optimal number of terms in the COS method for accurate European option pricing.
method Using Fourier-cosine expansion, the study finds an explicit bound for the number of terms N in the cosine series approximation.
result The COS method achieves exponential convergence when the log-return density is smooth, but not when it has heavy tails.

Paper proves minimal resistance for a body in a fluid with decreasing density.

problem Minimal resistance for a body moving through a fluid with non-constant density.
method Local existence and regularity of radial solutions using a fixed-point theorem.
result Maximal domain of the solution is finite, terminating at a critical slope.

We analyze a plug-in estimator for a large class of integral functionals of one or more continuous probability densities. This class includes important families of entropy, divergence, mutual information, and their conditional versions. For densities on the dd-dimensional unit cube [0,1]d[0,1]^d that lie in a ββ-Hölder s…

2016-03-28abs ↗pdf ↗

We construct an infinite-dimensional information manifold based on exponential Orlicz spaces without using the notion of exponential convergence. We then show that convex mixtures of probability densities lie on the same connected component of this manifold, and characterize the class of densities for which this mixtur…

2001-04-23abs ↗pdf ↗

We analyze the data on personal income distribution from the Australian Bureau of Statistics. We compare fits of the data to the exponential, log-normal, and gamma distributions. The exponential function gives a good (albeit not perfect) description of 98% of the population in the lower part of the distribution. The lo…

2006-01-22abs ↗pdf ↗

The kernel exponential family is a rich class of distributions, which can be fit efficiently and with statistical guarantees by score matching. Being required to choose a priori a simple kernel such as the Gaussian, however, limits its practical applicability. We provide a scheme for learning a kernel parameterized by …

2018-11-20abs ↗pdf ↗

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.

New bounds on learning algorithm generalization error derived using information density.

problem Bounding the generalization error of learning algorithms.
method Exponential inequalities and information density/conditional information density.
result Novel bounds on average and tail probability of generalization error.

Random quotients of hyperbolic cubulated groups remain cubulated.

problem Understanding properties of random quotients of hyperbolic cubulated groups.
method Cubical small-cancellation theory, exponential growth of conjugacy classes, and hyperplane stabilizers' growth.
result Low-density random quotients of cubulated hyperbolic groups are cubulated and hyperbolic.

We investigate the class of tempered stable distributions and their associated processes. Our analysis of tempered stable distributions includes limit distributions, parameter estimation and the study of their densities. Regarding tempered stable processes, we deal with density transformations and compute their pp-var…

2019-07-11abs ↗pdf ↗

New method minimizes robust density power-based divergences for general parametric densities.

problem Computational complexity of minimizing DPD for general parametric densities.
method Stochastic approach to minimize DPD for general parametric density models.
result Proposed method can be applied to minimize other density power-based γ-divergences.

The L1 loss landscape of neural nets near local minima behaves differently, revealing exponential decay and increased vertex density.

problem Understanding the L1 loss landscape of neural nets near local minima.
method Iterative minimization of the loss function on adjacent vertices of the Deep ReLU Simplex algorithm.
result Exponential decay of loss levels and increased vertex density around local minima.

A nonparametric family of conditional distributions is introduced, which generalizes conditional exponential families using functional parameters in a suitable RKHS. An algorithm is provided for learning the generalized natural parameter, and consistency of the estimator is established in the well specified case. In ex…

2017-11-15abs ↗pdf ↗

Here we develop an option pricing method based on Legendre series expansion of the density function. The key insight, relying on the close relation of the characteristic function with the series coefficients, allows to recover the density function rapidly and accurately. Based on this representation for the density fun…

2016-10-10abs ↗pdf ↗

We propose a method to infer causal structures containing both discrete and continuous variables. The idea is to select causal hypotheses for which the conditional density of every variable, given its causes, becomes smooth. We define a family of smooth densities and conditional densities by second order exponential mo…

2009-10-29abs ↗pdf ↗

We construct the term structure of the (forward-looking, US market) equity risk premium from SPX option chains. The method is "model-light". Risk-neutral probability densities are estimated by fitting NN-component Gaussian mixture models to option quotes, where NN is a small integer (here 4 or 5). These densities are…

2019-10-31abs ↗pdf ↗

This work explores efficient reinforcement learning with density features in low-rank MDPs.

problem Efficient reinforcement learning with density features in low-rank MDPs.
method Proposes algorithms for off-policy estimation and online construction of exploratory data distributions.
result Demonstrates sample-efficient learning with density features in low-rank MDPs, overcoming technical challenges.

Instantaneous volatility of logarithmic return in the lognormal fractional SABR model is driven by the exponentiation of a correlated fractional Brownian motion. Due to the mixed nature of driving Brownian and fractional Brownian motions, probability density for such a model is less studied in the literature. We show i…

2017-02-26abs ↗pdf ↗

We study the asymptotic behaviour of the partial density function associated to sections of a positive hermitian line bundle that vanish to a particular order along a fixed divisor YY. Assuming the data in question is invariant under an S1S^1-action (locally around YY) we prove that this density function has a distri…

2013-12-04abs ↗pdf ↗

Density expansions for hypoelliptic diffusions (X1,...,Xd)(X^1,...,X^d) are revisited. In particular, we are interested in density expansions of the projection (XT1,...,XTl)(X_T^1,...,X_T^l), at time T>0T>0, with ldl \leq d. Global conditions are found which replace the well-known "not-in-cutlocus" condition known from heat-kernel asymptot…

2011-11-10abs ↗pdf ↗

New noncompact Coxeter polytopes found in various dimensions.

problem Classifying and constructing noncompact hyperbolic Coxeter polytopes.
method Maximal-cusp density and noncompact analog of Bogachev-Douba-Raimbault's argument.
result Infinitely many pairwise incommensurable noncompact Coxeter polytopes in dimensions 4-9.

Unified framework for training diffusion and flow models to sample from target distributions.

problem Training diffusion and flow models to sample from target distributions defined by exponential tilting.
method Unified framework combining stochastic optimal control and non-equilibrium thermodynamics perspectives.
result Unified bias-variance decompositions and theoretical support for adjoint-based methods.

The distribution of intertrade durations, defined as the waiting times between two consecutive transactions, is investigated based upon the limit order book data of 23 liquid Chinese stocks listed on the Shenzhen Stock Exchange in the whole year 2003. A scaling pattern is observed in the distributions of intertrade dur…

2008-04-22abs ↗pdf ↗

GGMPs improve non-Gaussian conditional density estimation.

problem Multimodality, heteroscedasticity, and strong non-Gaussianity in conditional density estimation.
method GGMP combines local Gaussian mixture fitting, cross-input component alignment, and per-component heteroscedastic GP training.
result GGMPs improve distributional approximation on synthetic and real-world datasets.

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 ↗

Unified method for calculating financial option prices from characteristic functions.

problem Calculating financial option prices from characteristic functions in high dimensions.
method Damped Fourier-cosine expansion (COS) method.
result The method converges exponentially if the characteristic function decays exponentially.

There has recently been a steady increase in the number iterative approaches to density estimation. However, an accompanying burst of formal convergence guarantees has not followed; all results pay the price of heavy assumptions which are often unrealistic or hard to check. The Generative Adversarial Network (GAN) lite…

2018-03-22abs ↗pdf ↗

Paper improves deep learning convergence rates for low-dimensional data.

problem Sub-optimal rates in deep learning due to unrealistic assumptions on intrinsic dimension.
method Introduced an entropic notion of intrinsic dimension for exponential families and demonstrated improved convergence rates.
result Test error scales as O~(n2β2β+dˉ2β(λ))\tilde{\mathcal{O}}\left(n^{-\frac{2β}{2β+ \bar{d}_{2β}(λ)}}\right), improving on best-known rates.

We consider a defaultable asset whose risk-neutral pricing dynamics are described by an exponential Levy-type martingale subject to default. This class of models allows for local volatility, local default intensity, and a locally dependent Levy measure. Generalizing and extending the novel adjoint expansion technique o…

2013-12-27abs ↗pdf ↗

Paper analyzes sparse aggregation in GLMs with Kullback-Leibler risk bounds.

problem Sparse aggregation in GLMs for parameter approximation.
method Exponential weighted aggregation scheme with Kullback-Leibler risk bounds.
result Sharp oracle inequality for Kullback-Leibler risk with leading constant 1 and minimax-optimal rate of aggregation.