Related papers: Upper and lower bounds for the Bregman divergence

In this paper we prove exponential inequalities (also called Bernstein's inequality) for fractional martingales. As an immediate corollary, we will discuss weak law of large numbers for fractional martingales under divergence assumption on…

We study a general version of the Cheeger inequality by considering the shape functional $\mathcal{F}_{p,q}(\Omega)=\lambda_p^{1/p}(\Omega)/\lambda_q(\Omega)^{1/q}$. The infimum and the supremum of $\mathcal{F}_{p,q}$ are studied in the…

In this article we determine the coefficient bounds for functions in certain subclasses of analytic functions defined by subordination which are related to the well-known classes of starlike and convex functions. The main results deal with…

We consider Tikhonov-type variational regularization of ill-posed linear operator equations in Banach spaces with general convex penalty functionals. Upper bounds for certain error measures expressing the distance between exact and…

In this paper, we point out a very flexible scheme within which a strict minimax inequality occurs. We then show the fruitfulness of this approach presenting a series of various consequences. Here is one of them: Let $Y$ be a…

Fractional derivatives are a well-studied generalization of integer order derivatives. Naturally, for optimization, it is of interest to understand the convergence properties of gradient descent using fractional derivatives. Convergence…

Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…

A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of $n \Delta$ on the proximity of optimal solutions of an Integer Linear Programming problem and its standard linear relaxation. In this bound, $n$ is the…

The Bregman distance is a central tool in convex optimization, particularly in first-order gradient descent and proximal-based algorithms. Such methods enable optimization of functions without Lipschitz continuous gradients by leveraging…

More precise estimates for the Bergman metric on strongly pseudoconvex domains are given, based on the use of the squeezing function.

In this paper, we establish some upper bounds for numerical radius inequalities including of $2\times 2$ operator matrices and their off-diagonal parts. Among other inequalities, it is shown that if $T=\left[\begin{array}{cc} 0&X, Y&0…

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

The Coifman-Fefferman inequality implies quite easily that a Calderon-Zygmund operator $T$ acts boundedly in a Banach lattice $X$ on $\mathbb R^n$ if the Hardy-Littlewood maximal operator $M$ is bounded in both $X$ and $X'$. We discuss this…

We characterize the functions for which the corresponding Bregman divergence is jointly convex on matrices. As an application of this characterization, we derive a sharp inequality for the quantum Tsallis entropy of a tripartite state,…

We show that the lower bound for the optimal directional discrepancy with respect to the class of rectangles in $\mathbb{R}^2$ rotated in a restricted interval of directions $[-\theta, \theta]$ with $\theta < \frac{\pi}{4}$ is of the order…

Under the Riemann hypothesis, we use the distribution of zeros of the zeta function to get a lower bound for the maximum of some derivative of Hardy's function.

We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.

Given a convex set $C$ in a real vector space $E$ and two points $x,y\in C$, we investivate which are the possible values for the variation $f(y)-f(x)$, where $f:C\longrightarrow [m,M]$ is a bounded convex function. We then rewrite the…

For a pseudoconvex tube domain, we prove estimates that relate the sublevel sets of its diagonal Bergman kernel to the floating bodies of its convex base. This allows us to associate a new affine invariant to any convex body.