Practical Bounds of Kullback-Leibler Divergence Using Maximum Mean Discrepancy

04/05/2022
∙
by   Chong Xiao Wang, et al.
∙
0
∙

Estimating Kullback Leibler (KL) divergence from data samples is a strenuous task, with existing approaches either imposing restrictive assumptions on the domain knowledge of the underlying model or requiring density approximation like space partitioning. The use of kernel maximum mean discrepancy (MMD) yields an alternative non-parametric approach to compare two populations by finding the maximum mean difference generated by measurable functions in the unit ball in a reproducing kernel Hilbert space (RKHS). Predicated on the universal approximation of universal kernels, we propose two corresponding classes of functions in a RKHS that can bound the KL divergence from below and above, and derive the RKHS representations of these bounds. This allows us to develop asymptotically consistent estimates for the derived bounds. We evaluate the proposed bounds as mutual information proxies on an image dataset, and demonstrate that these bounds can stably track variations in mutual information.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment