Answers are grounded in this paper and cite their sources.
Based on the skewed Kullback-Leibler divergence introduced in the natural language processing, we derive the upper and lower bounds on the skewed version of the Jensen-Shannon divergence and investigate properties of them. In the process, we generalize the Bretagnolle-Huber inequality that offers an upper bound on the skewed Kullback-Leibler divergence. We further present how the skewed Jensen-Shannon divergence is bounded from below in terms of accuracy mismatch.
No takes yet. Share an insight, caveat, or question.
Takuya Yamano (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: