Upper and lower bounds for the Bregman divergence

Abstract

In this paper we study upper and lower bounds on the Bregman divergence ΔFξ(y,x):=F(y)-F(x)- ξ, y-x for some convex functional F on a normed space X, with subgradient ξ∈∂F(x). We give a considerably simpler new proof of the inequalities by Xu and Roach for the special case F(x)=\| x\|p, p>1. The results can be transfered to more general functions as well.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…