English
Related papers

Related papers: Sharp Inequalities for $f$-divergences

200 papers

The Chernoff information between two probability measures is a statistical divergence measuring their deviation defined as their maximally skewed Bhattacharyya distance. Although the Chernoff information was originally introduced for…

Information Theory · Computer Science 2022-10-04 Frank Nielsen

The likelihood function is a fundamental component in Bayesian statistics. However, evaluating the likelihood of an observation is computationally intractable in many applications. In this paper, we propose a non-parametric approximation of…

Machine Learning · Computer Science 2019-10-24 Viet Anh Nguyen , Soroosh Shafieezadeh-Abadeh , Man-Chung Yue , Daniel Kuhn , Wolfram Wiesemann

Variational representations of $f$-divergences are central to many machine learning algorithms, with Lipschitz constrained variants recently gaining attention. Inspired by this, we define the Moreau-Yosida approximation of $f$-divergences…

Machine Learning · Computer Science 2023-01-04 Dávid Terjék

Fairness-aware learning is a novel framework for classification tasks. Like regular empirical risk minimization (ERM), it aims to learn a classifier with a low error rate, and at the same time, for the predictions of the classifier to be…

Machine Learning · Statistics 2015-06-26 Kazuto Fukuchi , Jun Sakuma

Kullback-Leibler (KL) divergence is one of the most important divergence measures between probability distributions. In this paper, we prove several properties of KL divergence between multivariate Gaussian distributions. First, for any two…

Information Theory · Computer Science 2023-01-24 Yufeng Zhang , Wanwei Liu , Zhenbang Chen , Ji Wang , Kenli Li

Nonnegative matrix factorization (NMF) is a standard linear dimensionality reduction technique for nonnegative data sets. In order to measure the discrepancy between the input data and the low-rank approximation, the Kullback-Leibler (KL)…

Optimization and Control · Mathematics 2021-05-12 Le Thi Khanh Hien , Nicolas Gillis

In this paper, we will use a suitable tranform to investigate the sharp constants and optimizers for the following Caffarelli-Kohn-Nirenberg inequalities for a wide range of parameters $(r,p,q,s,\mu,\sigma)$ and $0\leq a\leq1$:…

Analysis of PDEs · Mathematics 2015-10-06 Nguyen Lam , Guozhen Lu

Fairness has become a crucial aspect in the development of trustworthy machine learning algorithms. Current fairness metrics to measure the violation of demographic parity have the following drawbacks: (i) the average difference of model…

Machine Learning · Computer Science 2024-06-06 Jinqiu Jin , Haoxuan Li , Fuli Feng

$\alpha$-posteriors and their variational approximations distort standard posterior inference by downweighting the likelihood and introducing variational approximation errors. We show that such distortions, if tuned appropriately, reduce…

Machine Learning · Statistics 2021-04-20 Marco Avella Medina , José Luis Montiel Olea , Cynthia Rush , Amilcar Velez

Consider a geometric range space $(X,\c{A})$ where each data point $x \in X$ has two or more values (say $r(x)$ and $b(x)$). Also consider a function $\Phi(A)$ defined on any subset $A \in (X,\c{A})$ on the sum of values in that range e.g.,…

Computational Geometry · Computer Science 2018-10-01 Michael Matheny , Jeff M. Phillips

We study the relation between the total variation (TV) and Hellinger distances between two Gaussian location mixtures. Our first result establishes a general upper bound: for any two mixing distributions supported on a compact set, the…

Statistics Theory · Mathematics 2026-05-27 Joonhyuk Jung , Chao Gao

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…

Information Theory · Computer Science 2020-10-22 Amedeo Roberto Esposito , Michael Gastpar , Ibrahim Issa

The inverse tangent function can be bounded by different inequalities, for example by Shafer's inequality. In this publication, we propose a new sharp double inequality, consisting of a lower and an upper bound, for the inverse tangent…

Information Theory · Computer Science 2013-07-19 Gholamreza Alirezaei

The (global) Lipschitz smoothness condition is crucial in establishing the convergence theory for most optimization methods. Unfortunately, most machine learning and signal processing problems are not Lipschitz smooth. This motivates us to…

Optimization and Control · Mathematics 2019-04-23 Qiuwei Li , Zhihui Zhu , Gongguo Tang , Michael B. Wakin

Importance sampling approximates expectations with respect to a target measure by using samples from a proposal measure. The performance of the method over large classes of test functions depends heavily on the closeness between both…

Computation · Statistics 2016-09-01 Daniel Sanz-Alonso

The fractional Feynman-Kac equations describe the distribution of functionals of non-Brownian motion, or anomalous diffusion, including two types called the forward and backward fractional Feynman-Kac equations, where the fractional…

Numerical Analysis · Mathematics 2016-07-26 Jiahui Hu , Jungang Wang , Zhanbin Yuan , Zongze Yang , Yufeng Nie

Empirical phi-divergence test-statistics have demostrated to be a useful technique for the simple null hypothesis to improve the finite sample behaviour of the classical likelihood ratio test-statistic, as well asfor model misspecification…

Methodology · Statistics 2016-01-15 Narayanaswamy Balakrishnan , Nirian Martin , Leandro Pardo

In this paper we study direct and inverse approximation inequalities in $L^{p}(\mathbb{R}^{d})$, $1<p<\infty$, with the Dunkl weight. We obtain these estimates in their sharp form substantially improving previous results. We also establish…

Classical Analysis and ODEs · Mathematics 2020-03-31 D. V. Gorbachev , V. I. Ivanov , S. Yu. Tikhonov

The Kullback-Leibler divergence or relative entropy is an information-theoretic measure between statistical models that play an important role in measuring a distance between random variables. In the study of complex systems, random fields…

Information Theory · Computer Science 2022-03-25 Alexandre L. M. Levada

Kullback--Leibler (KL) divergence is a fundamental measure of the dissimilarity between two probability distributions, but it can become unstable in high-dimensional settings due to its sensitivity to mismatches in distributional support.…

Information Theory · Computer Science 2025-02-03 Yifeng Peng , Dantong Li , Xinyi Li , Zhiding Liang , Yongshan Ding , Ying Wang
‹ Prev 1 8 9 10 Next ›