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

57113170226 · Jun 202019922001200920172026
48 results for Power Divergence

Unified representation of density-power-based divergences simplifies estimation to M-estimation.

problem Outliers in density estimation.
method Define a norm-based Bregman density power divergence (NB-DPD) that reduces to M-estimation.
result NB-DPD connects and generalizes existing divergences, highlighting robustness properties.

Study explores relationship between Hölder and FDPD divergences.

problem Understanding the relationship between Hölder and FDPD divergences.
method Intersection and generalization of divergence families, proving nonnegativity, deriving inequalities.
result Established ξξ-Hölder divergence and derived inequalities.

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.

This paper improves active learning by using robust divergences for committee disagreement.

problem Active learning with high measurement costs.
method Query by committee with Bregman divergence (including Kullback-Leibler divergence as a special case).
result The proposed method is more robust and performs as well as or better than conventional methods.

Study compares statistical properties and power of divergence measures for credit risk monitoring.

problem Detecting distributional shifts in credit risk models.
method Derives statistical properties and chi-square benchmark values for Jensen-Shannon Divergence and Kullback-Leibler Divergence, demonstrating their applicability in credit risk monitoring.
result Jensen-Shannon Divergence and Kullback-Leibler Divergence follow chi-square distributions and reveal practical trade-offs in minimizing false positives vs. detecting changes.

Improved Bayesian inference using power priors with historical data.

problem Improving Bayesian inference with historical data.
method Generalized power priors that adapt to the α\alpha parameter of Amari's α\alpha-divergence.
result Improved performance through appropriate choices of the α\alpha parameter.

The paper introduces a new method for estimating optimal policies in dynamic treatment regimes using information geometry.

problem Estimating optimal policies in dynamic treatment regimes.
method Minimum information divergence method based on γγ-power divergence.
result The γγ-power divergence method effectively seeks the optimal policy by vanishing the divergence between policy-equivalent Q-functions.

Improved VAE for heavy-tailed data using Student's t-distributions.

problem Over-regularization in VAEs with Gaussian priors.
method Proposed t3t^3VAE framework with Student's t-distributions for prior, encoder, and decoder.
result Significantly outperforms other models on heavy-tailed datasets.

A new robust PCA estimator combining M-estimators and minimum divergence estimators.

problem Adverse effect of outlying observations in PCA for high-dimensional data.
method Minimum density power divergence estimator combined with a computationally efficient algorithm.
result High breakdown guarantee regardless of data dimension with theoretical support and practical applications.

This paper generalizes beta divergence beyond its classical form associated with power variance functions of Tweedie models. Generalized form is represented by a compact definite integral as a function of variance function of the exponential dispersion model. This compact integral form simplifies derivations of many pr…

2013-06-14abs ↗pdf ↗

For distributions P\mathbb{P} and Q\mathbb{Q} with different supports or undefined densities, the divergence D(PQ)\textrm{D}(\mathbb{P}||\mathbb{Q}) may not exist. We define a Spread Divergence D~(PQ)\tilde{\textrm{D}}(\mathbb{P}||\mathbb{Q}) on modified P\mathbb{P} and Q\mathbb{Q} and describe sufficient conditions for t…

2018-11-21abs ↗pdf ↗

We extend CS divergence to conditional distributions and show its advantages in time series data and sequential decision making.

problem Quantifying the closeness between conditional distributions.
method Developed and estimated a conditional Cauchy-Schwarz divergence using kernel density estimation.
result Conditional CS divergence outperforms previous methods in time series clustering and sequential decision making.

Differential privacy is a de facto standard in data privacy, with applications in the public and private sectors. A way to explain differential privacy, which is particularly appealing to statistician and social scientists is by means of its statistical hypothesis testing interpretation. Informally, one cannot effectiv…

2019-05-24abs ↗pdf ↗

The t-distributed Stochastic Neighbor Embedding (t-SNE) is a powerful and popular method for visualizing high-dimensional data. It minimizes the Kullback-Leibler (KL) divergence between the original and embedded data distributions. In this work, we propose extending this method to other f-divergences. We analytically a…

2018-11-03abs ↗pdf ↗

In high-dimensional data, many sparse regression methods have been proposed. However, they may not be robust against outliers. Recently, the use of density power weight has been studied for robust parameter estimation and the corresponding divergences have been discussed. One of such divergences is the γγ-divergence a…

2016-04-22abs ↗pdf ↗

E2^2M optimizes tensor density estimation by relaxing αα-divergence to KL-divergence.

problem Analytical challenges in traditional αα-divergence optimization for tensor-based density estimation.
method E2^2M algorithm: relaxes optimization to KL-divergence, then applies tensor many-body approximation.
result Flexible modeling of various low-rank structures and their mixtures.

While Generative Adversarial Networks (GANs) have empirically produced impressive results on learning complex real-world distributions, recent works have shown that they suffer from lack of diversity or mode collapse. The theoretical work of Arora et al. suggests a dilemma about GANs' statistical properties: powerful d…

2018-06-27abs ↗pdf ↗

A new distribution addresses scalability and numerical stability issues of the vMF.

problem Scalability and numerical stability issues in sampling from the von Mises-Fisher (vMF) distribution.
method Proposes the Power Spherical distribution, retaining vMF's properties but addressing its drawbacks.
result Demonstrates the stability of Power Spherical distributions and applies it to a variational auto-encoder.

We study the risk criterion for investments based on the drawdown from the maximal value of the capital in the past. Depending on investor's risk attitude, thus his risk exposure, we find that the distribution of these drawdowns follows a general power law. In particular, if the risk exposure is Kelly-optimal, the expo…

1998-08-26abs ↗pdf ↗

Generative adversarial network (GAN) is a minimax game between a generator mimicking the true model and a discriminator distinguishing the samples produced by the generator from the real training samples. Given an unconstrained discriminator able to approximate any function, this game reduces to finding the generative …

2018-10-28abs ↗pdf ↗

We study the geometry of probability distributions with respect to a generalized family of Csiszár ff-divergences. A member of this family is the relative αα-entropy which is also a Rényi analog of relative entropy in information theory and known as logarithmic or projective power divergence in statistics. We apply E…

2020-01-14abs ↗pdf ↗

In the presence of model risk, it is well-established to replace classical expected values by worst-case expectations over all models within a fixed radius from a given reference model. This is the "robustness" approach. We show that previous methods for measuring this radius, e.g. relative entropy or polynomial diverg…

2015-10-06abs ↗pdf ↗

Proposes a new method to improve Bayesian computation accuracy using flexible classification.

problem Bayesian computations accuracy check using rank-based simulation-based calibration has limitations.
method Replaces marginal rank test with a flexible classification approach that learns from data.
result Improves statistical power and provides an interpretable divergence measure of miscalibration.

Paper introduces SDM for detecting LLM hallucinations, improving on entropy tests.

problem Challenges of Large Language Models (LLMs) with non-factual, nonsensical responses.
method Joint clustering on sentence embeddings to measure semantic divergence between prompts and responses.
result SDM framework detects deeper form of arbitrariness in LLM responses.

Improved hypothesis testing and change-point detection using diffusion-based methods.

problem Limited power of score-based hypothesis tests and change-point detection.
method Extending score-based Fisher divergence to diffusion-divergence by multiplying score functions with a matrix-valued function or weight matrix.
result Theoretical quantification and demonstration of optimal performance of diffusion-based algorithms.

In this note, we point out a basic link between generative adversarial (GA) training and binary classification -- any powerful discriminator essentially computes an (f-)divergence between real and generated samples. The result, repeatedly re-derived in decision theory, has implications for GA Networks (GANs), providing…

2017-09-05abs ↗pdf ↗

We introduce a new test for detection of power-law cross-correlations among a pair of time series - the rescaled covariance test. The test is based on a power-law divergence of the covariance of the partial sums of the long-range cross-correlated processes. Utilizing a heteroskedasticity and auto-correlation robust est…

2013-07-17abs ↗pdf ↗

We propose a direct estimation method for Rényi and f-divergence measures based on a new graph theoretical interpretation. Suppose that we are given two sample sets XX and YY, respectively with NN and MM samples, where η:=M/Nη:=M/N is a constant value. Considering the kk-nearest neighbor (kk-NN) graph of YY in the j…

2017-02-17abs ↗pdf ↗

Paper tackles non-convex constrained DRO with a stochastic algorithm for large-scale applications.

problem Training robust models against data distribution shifts with non-convex loss functions.
method Developed a stochastic algorithm for non-convex constrained DRO with a complexity independent of dataset size.
result Algorithm finds ε-stationary points with computational complexity of O(ε^(-3k_*-5)) for general Cressie-Read divergence.

Paper resolves bias in ALFT training using generalized alignment games.

problem Systematic bias in estimating logarithmic rewards from small batches.
method Generalized Distributional Alignment Games, U-statistics, minimax polynomial estimators, Variance-Optimal Augmented Polynomial Optimization Program (AQP) Estimator.
result Proves optimal bias and accelerated convergence in ALFT training.

The variational autoencoder (VAE) is a powerful generative model that can estimate the probability of a data point by using latent variables. In the VAE, the posterior of the latent variable given the data point is regularized by the prior of the latent variable using Kullback Leibler (KL) divergence. Although the stan…

2018-09-14abs ↗pdf ↗