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

Trend · papers per month

75150225300 · Jun 202019922001200920172026
48 results for density 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.

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.

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.

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.

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.

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.

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 ↗

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.

New method uses SoS densities and α-divergences for efficient sequential transport maps.

problem Efficiently generating samples from approximated densities.
method Sequential transport maps using Sum-of-Squares (SoS) densities and α-divergences.
result Convex optimization problems with efficient semidefinite programming solutions.

New α\alpha-divergence loss function improves neural density ratio estimation.

problem Optimization challenges in existing DRE methods, especially overfitting and high sample requirements.
method Derived α\alpha-divergence loss function (α\alpha-Div) for neural density ratio estimation.
result The α\alpha-divergence loss function (α\alpha-Div) offers stable and effective optimization for DRE.

Unified view of KL-divergence and IPMs via DRE, with new DRM metrics.

problem Unified understanding of KL-divergence and IPMs.
method Unified representation via maximum likelihood density-ratio estimation (DRE).
result Unified form of IPMs and novel DRM metrics.

Study improves density estimation for compact domains using hh-lifted KL divergence.

problem Estimating probability density functions on compact domains.
method Introduced hh-lifted Kullback--Leibler (KL) divergence for risk minimization.
result Proved O(1/n)\mathcal{O}(1/{\sqrt{n}}) bound on estimation error.

Divergence estimators based on direct approximation of density-ratios without going through separate approximation of numerator and denominator densities have been successfully applied to machine learning tasks that involve distribution comparison such as outlier detection, transfer learning, and two-sample homogeneity…

2011-06-23abs ↗pdf ↗

New robust learning framework for regression NNs using β-divergences.

problem Outliers and data contamination in regression NNs training.
method Proposes rRNet based on β-divergence for robust learning of regression NNs.
result rRNet achieves optimal 50% asymptotic breakdown point for all β ∈ (0, 1].

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 ↗

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 ↗

Rank-statistic method approximates ff-divergences without density-ratio estimation.

problem Approximating ff-divergences without explicit density-ratio estimation.
method Mapping distribution rank histograms to discrete ff-divergence and averaging over random projections.
result The rank-statistic estimator is a lower bound of the true ff-divergence and converges under mild conditions.

A new metric evaluates generative models by comparing real and generated samples.

problem Evaluating the quality of generative models.
method Relative Density Ratio (RDR) function, optimization on variational form of φ-divergence.
result The RDR function provides a clear, interpretable, and numerically stable evaluation metric.

Reflective Hamiltonian Monte Carlo struggles with high-dimensional sampling.

problem Slow mixing in reflective Hamiltonian Monte Carlo with inexact reflections.
method Quantifying instantaneous non-uniformity with Sinkhorn divergence; analyzing particle motion in spheres and cubes; constructing low-dimensional toy models.
result Particles spontaneously unmix, leading to resonances in particle density.

Unified framework for robust, stable, and efficient density ratio estimation.

problem Density-chasm and support-chasm problems in density ratio estimation.
method Dequantified diffusion-Schrödinger bridge (D3RE) framework with DDBI and DSBI.
result Offers uniform approximation and bounded time scores in theory and empirical performance.

Bi-Lipschitz flows approximate a wide range of distributions.

problem Characterizing the expressivity of bi-Lipschitz normalizing flows.
method Linking score regularity to transport map bi-Lipschitzness via probability flow ODE.
result Gaussian pullbacks induced by bi-Lipschitz variance-preserving transport maps are L1L^1-dense among all probability densities.

Improved GANs estimate convergence rate for density estimation.

problem Improving the accuracy of density estimation with GANs.
method Proved an oracle inequality for JS divergence between GAN estimate and true density.
result JS-divergence rate of convergence is (logn/n)2β/(2β+d)(\log{n}/n)^{2β/(2β+ d)}.

Paper formulates particle flow using variational inference and Fisher-Rao gradient flow.

problem Estimating posterior densities in probabilistic models.
method Variational formulation of particle flow, Fisher-Rao gradient flow, Gaussian and Gaussian mixture approximations.
result Gaussian and Gaussian mixture approximations of Fisher-Rao particle flow reduce to Exact Daum and Huang particle flow under linear Gaussian assumptions.

New analysis of annealing paths in sampling and estimation.

problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.

Moser Flow generates models for complex geometries on manifolds without ODE solvers.

problem Learning generative models for complex geometries like spheres and tori.
method Moser Flow is a new class of continuous normalizing flows that parameterizes the model density as the divergence of a neural network.
result Moser Flow achieves significant improvements in density estimation, sample quality, and training complexity over existing methods.

Method uses normalizing flows to efficiently sample from complex target densities.

problem Sampling from complex target densities with zero values in regions of transformation.
method Normalizing flows to address exploding reverse Kullback-Leibler divergence.
result Demonstrated efficient sampling from multi-mode complex density function.

Generative adversarial networks (GANs) are successful deep generative models. GANs are based on a two-player minimax game. However, the objective function derived in the original motivation is changed to obtain stronger gradients when learning the generator. We propose a novel algorithm that repeats the density ratio e…

2016-10-10abs ↗pdf ↗

Machine learning classification limits estimated using Kullback-Leibler divergence and Cohen's Kappa.

problem Estimating the best possible performance of machine learning classification algorithms.
method Relating Kullback-Leibler divergence to Cohen's Kappa and using the Chernoff-Stein Lemma to estimate error rates.
result Classification algorithms could not have performed any better due to underlying probability density functions for the two classes.

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.

Proposes a new method for kernel density estimation using stagewise minimization and a simple dictionary.

problem Kernel density estimation with data-adaptive weighting parameters and sparse representation.
method Stagewise minimization algorithm based on UU-divergence and a simple dictionary.
result Develops non-asymptotic error bound for the proposed estimator.

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.

New method trains neural samplers to sample from multi-modal distributions efficiently.

problem Mode-seeking behavior of reverse KL divergence hinders effective sampling from multi-modal target distributions.
method Minimizing reverse diffusive KL divergence along diffusion trajectories of model and target densities.
result Demonstrated enhanced sampling performance across various multi-modal distributions.