English
Related papers

Related papers: A note on the approximate symmetry of Bregman dist…

200 papers

In this paper we study upper and lower bounds on the Bregman divergence $\Delta_{\mathcal{F}}^{\xi}(y,x):=\mathcal{F}(y)-\mathcal{F}(x)-\langle \xi, y-x\rangle $ for some convex functional $\mathcal{F}$ on a normed space $\mathcal{X}$, with…

Numerical Analysis · Mathematics 2019-01-23 Benjamin Sprung

The Bregman divergence (Bregman distance, Bregman measure of distance) is a certain useful substitute for a distance, obtained from a well-chosen function (the "Bregman function"). Bregman functions and divergences have been extensively…

Optimization and Control · Mathematics 2019-04-10 Daniel Reem , Simeon Reich , Alvaro De Pierro

Recently, a new distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a proper lower semicontinuous convex function, this distance…

Functional Analysis · Mathematics 2020-09-29 Regina S. Burachik , Minh N. Dao , Scott B. Lindstrom

A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in…

Functional Analysis · Mathematics 2007-12-27 Heinz H. Bauschke , Xianfu Wang , Jane Ye , Xiaoming Yuan

The aim of this paper is to provide an overview of recent development related to Bregman distances outside its native areas of optimization and statistics. We discuss approaches in inverse problems and image processing based on Bregman…

Optimization and Control · Mathematics 2015-05-21 Martin Burger

The paper introduces scaled Bregman distances of probability distributions which admit non-uniform contributions of observed events. They are introduced in a general form covering not only the distances of discrete and continuous stochastic…

Information Theory · Computer Science 2021-05-12 Wolfgang Stummer , Igor Vajda

Comparative convexity is a generalization of convexity relying on abstract notions of means. We define the Jensen divergence and the Jensen diversity from the viewpoint of comparative convexity, and show how to obtain the generalized…

Information Theory · Computer Science 2017-05-05 Frank Nielsen , Richard Nock

In this paper, we study a part of approximation theory that presents the conditions under which a \Ceby\sev set in a Banach space is convex. To do so, we use Gateaux differentiability of the distance function.

Functional Analysis · Mathematics 2011-08-03 A. Assadi , H. Haghshenas , H. Hosseini Guive

Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…

Machine Learning · Computer Science 2024-08-27 Yossi Arjevani

In this paper, we prove that the distance function of an open connected set in $\mathbb R^{n+1}$ with a $C^{2}$ boundary is superharmonic in the distribution sense if and only if the boundary is {\em weakly mean convex}. We then prove that…

Analysis of PDEs · Mathematics 2011-06-03 Roger T. Lewis , Junfang Li , Yanyan Li

For $q\in(0,1),$ let $B_q$ denote the limit $q$-Bernstein operator. In this paper, the distance between $B_q$ and $B_r$ for distinct $q$ and $r$ in the operator norm on $C[0,1]$ is estimated, and it is proved that $1\leqslant…

Functional Analysis · Mathematics 2018-01-08 Sofiya Ostrovska , Mehmet Turan

Every maximally monotone operator can be associated with a family of convex functions, called the Fitzpatrick family or family of representative functions. Surprisingly, in 2017, Burachik and Mart\'inez-Legaz showed that the well-known…

Functional Analysis · Mathematics 2023-08-29 Regina S. Burachik , Minh N. Dao , Scott B. Lindstrom

It is shown that the Carath\'eodory distance and the Lempert function are almost the same on any strongly pseudoconvex domain in $\C^n;$ in addition, if the boundary is $C^{2+\eps}$-smooth, then $\sqrt{n+1}$ times one of them almost…

Complex Variables · Mathematics 2014-12-01 Nikolai Nikolov

Let $M$ be a hyperbolic Riemann surface with the first eigenvalue $\lambda_1(M)>0$. Let $\rho$ denote the distance from a fixed point $x_0\in{M}$ and $r_x$ the injectivity radius at $x$. We show that there exists a numerical constant…

Complex Variables · Mathematics 2025-05-12 Bo-Yong Chen , Yuanpu Xiong

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

Optimization and Control · Mathematics 2021-10-25 Paolo Albano , Vincenzo Basco , Piermarco Cannarsa

We prove a Hardy inequality on convex sets, for fractional Sobolev-Slobodecki\u{\i} spaces of order $(s,p)$. The proof is based on the fact that in a convex set the distance from the boundary is a superharmonic function, in a suitable…

Analysis of PDEs · Mathematics 2018-06-12 Lorenzo Brasco , Eleonora Cinti

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

Differential Geometry · Mathematics 2020-01-06 Martin Li

Classic subdifferentials in variational analysis may fail to fully represent the Bregman proximal operator in the absence of convexity. In this paper, we fill this gap by introducing the left and right \emph{Bregman level proximal…

Optimization and Control · Mathematics 2026-04-14 Ziyuan Wang , Andreas Themelis

Given an operator convex function $f(x)$, we obtain an operator-valued lower bound for $cf(x) + (1-c)f(y) - f(cx + (1-c)y)$, $c \in [0,1]$. The lower bound is expressed in terms of the matrix Bregman divergence. A similar inequality is…

Quantum Physics · Physics 2015-06-17 Isaac H. Kim

Let C be convex, compact, with nonempty interior and h be Legendre with domain C, continuous on C. We prove that h is Bregman if and only if it is strictly convex on C and C is a polytope. This provides insights on sequential convergence of…

Optimization and Control · Mathematics 2025-03-05 Edouard Pauwels
‹ Prev 1 2 3 10 Next ›