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.
The problem of filtering information from large correlation matrices is of great importance in many applications. We have recently proposed the use of the Kullback-Leibler distance to measure the performance of filtering algorithms in recovering the underlying correlation matrix when the variables are described by a mu…
We show that the Kullback-Leibler distance is a good measure of the statistical uncertainty of correlation matrices estimated by using a finite set of data. For correlation matrices of multivariate Gaussian variables we analytically determine the expected values of the Kullback-Leibler distance of a sample correlation …
The Wasserstein probability metric has received much attention from the machine learning community. Unlike the Kullback-Leibler divergence, which strictly measures change in probability, the Wasserstein metric reflects the underlying geometry between outcomes. The value of being sensitive to this geometry has been demo…
Machine learning classification limits estimated using Kullback-Leibler divergence and Cohen's Kappa.
This paper provides performance guarantees for neural estimation of statistical distances.
Paper calculates KL divergence for isotropic Gaussian-Markov fields.
Two new deterministic offspring selection methods reduce statistical distance in SMC and pMCMC.
New optimization method corrects data-driven optimizer's curse.
Parallel sampling for smooth distributions with fast convergence.
The paper optimizes distribution estimation with high probability in Kullback-Leibler divergence.
SHAP Distance assesses semantic fidelity of synthetic tabular data.
The paper introduces a new Wasserstein distance for approximating posteriors in inverse problems.
The density matrices are positively semi-definite Hermitian matrices of unit trace that describe the state of a quantum system. The goal of the paper is to develop minimax lower bounds on error rates of estimation of low rank density matrices in trace regression models used in quantum state tomography (in particular, i…
We propose a novel probabilistic approach to multilevel clustering problems based on composite transportation distance, which is a variant of transportation distance where the underlying metric is Kullback-Leibler divergence. Our method involves solving a joint optimization problem over spaces of probability measures t…
Due to the success of the bag-of-word modeling paradigm, clustering histograms has become an important ingredient of modern information processing. Clustering histograms can be performed using the celebrated -means centroid-based algorithm. From the viewpoint of applications, it is usually required to deal with symm…
Learning word representations has garnered greater attention in the recent past due to its diverse text applications. Word embeddings encapsulate the syntactic and semantic regularities of sentences. Modelling word embedding as multi-sense gaussian mixture distributions, will additionally capture uncertainty and polyse…
This paper presents a distance-based discriminative framework for learning with probability distributions. Instead of using kernel mean embeddings or generalized radial basis kernels, we introduce embeddings based on dissimilarity of distributions to some reference distributions denoted as templates. Our framework exte…
Wasserstein Generative Adversarial Networks (WGANs) provide a versatile class of models, which have attracted great attention in various applications. However, this framework has two main drawbacks: (i) Wasserstein-1 (or Earth-Mover) distance is restrictive such that WGANs cannot always fit data geometry well; (ii) It …
This paper introduces GEMINI, a new mutual information metric for unsupervised neural network training.
This paper studies convergence behavior of latent mixing measures that arise in finite and infinite mixture models, using transportation distances (i.e., Wasserstein metrics). The relationship between Wasserstein distances on the space of mixing measures and f-divergence functionals such as Hellinger and Kullback-Leibl…
The paper optimizes designs for distinguishing between Gaussian process models.
Empirical analysis of the foreign exchange market is conducted based on methods to quantify similarities among multi-dimensional time series with spectral distances introduced in [A.-H. Sato, Physica A, 382 (2007) 258--270]. As a result it is found that the similarities among currency pairs fluctuate with the rotation …
Hybrid clustering combines partitional and hierarchical clustering for computational effectiveness and versatility in cluster shape. In such clustering, a dissimilarity measure plays a crucial role in the hierarchical merging. The dissimilarity measure has great impact on the final clustering, and data-independent prop…
This paper analyzes discrete diffusion models, deriving convergence bounds for their generated samples.
The subject of this article is the introduction of a new concept of well-posedness of Bayesian inverse problems. The conventional concept of (Lipschitz, Hellinger) well-posedness in [Stuart 2010, Acta Numerica 19, pp. 451-559] is difficult to verify in practice and may be inappropriate in some contexts. Our concept sim…
The Wasserstein distance is a powerful metric based on the theory of optimal transport. It gives a natural measure of the distance between two distributions with a wide range of applications. In contrast to a number of the common divergences on distributions such as Kullback-Leibler or Jensen-Shannon, it is (weakly) co…
This paper introduces GEMINI, a new metric for unsupervised neural network training that avoids the need for regularizations.
Enhanced 3D shape analysis using information geometry.
Push-forward models struggle to fit multimodal distributions due to high Lipschitz constants.
New findings clarify the link between distributional closeness and representational similarity.
Region-based classification of PolSAR data can be effectively performed by seeking for the assignment that minimizes a distance between prototypes and segments. Silva et al (2013) used stochastic distances between complex multivariate Wishart models which, differently from other measures, are computationally tractable.…
Construction of ambiguity set in robust optimization relies on the choice of divergences between probability distributions. In distribution learning, choosing appropriate probability distributions based on observed data is critical for approximating the true distribution. To improve the performance of machine learning …
Images obtained with coherent illumination, as is the case of sonar, ultrasound-B, laser and Synthetic Aperture Radar -- SAR, are affected by speckle noise which reduces the ability to extract information from the data. Specialized techniques are required to deal with such imagery, which has been modeled by the G0 dist…
Study shows diffusion models adapt to manifold hypothesis without dimensionality issues.
EM algorithm converges exponentially fast for overspecified Gaussian mixtures.
Robust GW distance improves graph data alignment.
Causal KL improves on existing metrics for evaluating causal models.
A new variational inference method using sliced Wasserstein distance is proposed.
GEEN uses deep learning to estimate unobserved variables from observed data.
Levenshtein VAE prevents posterior collapse in text generation models.
We address the estimation problem for general finite mixture models, with a particular focus on the elliptical mixture models (EMMs). Compared to the widely adopted Kullback-Leibler divergence, we show that the Wasserstein distance provides a more desirable optimisation space. We thus provide a stable solution to the E…
In this paper we formulate in general terms an approach to prove strong consistency of the Empirical Risk Minimisation inductive principle applied to the prototype or distance based clustering. This approach was motivated by the Divisive Information-Theoretic Feature Clustering model in probabilistic space with Kullbac…
This paper shows any Kähler metric can be a Fisher information metric.
New PAC-Bayes bounds use Wasserstein distances to improve generalization.
Gaussian mixture models (GMM) are powerful parametric tools with many applications in machine learning and computer vision. Expectation maximization (EM) is the most popular algorithm for estimating the GMM parameters. However, EM guarantees only convergence to a stationary point of the log-likelihood function, which c…
Study shows the corrected Akaike criterion is inadmissible for estimating Kullback-Leibler discrepancy.
Paper relaxes triangle inequality for KL divergence between Gaussian distributions.
We present evidence that the best model for empirical volume-price distributions is not always the same and it strongly depends in (i) the region of the volume-price spectrum that one wants to model and (ii) the period in time that is being modelled. To show these two features we analyze stocks of the New York stock ma…