Results 21 to 30 of about 500 (159)
Fast Proxy Centers for the Jeffreys Centroid: The Jeffreys–Fisher–Rao Center and the Gauss–Bregman Inductive Center [PDF]
The symmetric Kullback–Leibler centroid, also called the Jeffreys centroid, of a set of mutually absolutely continuous probability distributions on a measure space provides a notion of centrality which has proven useful in many tasks, including ...
Frank Nielsen
doaj +2 more sources
Proper scoring rules and Bregman divergence
We revisit the mathematical foundations of proper scoring rules (PSRs) and Bregman divergences and present their characteristic properties in a unified theoretical framework. In many situations it is preferable not to generate a PSR directly from its convex entropy on the unit simplex but instead by the sublinear extension of the entropy to the ...
exaly +4 more sources
Maximizing the Bregman divergence from a Bregman family [PDF]
11 pages, 5 theorems, no ...
Johannes Rauh, Frantisek Matús
openaire +4 more sources
With view on the context of convex thermomechanics, we propose tools based on the concept of Bregman divergence, a notion introduced in the 1960s and used in learning and optimization as well. This study is motivated by the need of “discrepancy measures”
Andrieux, Stéphane
doaj +1 more source
Hyperlink regression via Bregman divergence [PDF]
41 pages, 14 ...
Akifumi Okuno, Hidetoshi Shimodaira
openaire +3 more sources
Transport information Bregman divergences [PDF]
Typos are ...
openaire +3 more sources
On Voronoi Diagrams on the Information-Geometric Cauchy Manifolds
We study the Voronoi diagrams of a finite set of Cauchy distributions and their dual complexes from the viewpoint of information geometry by considering the Fisher-Rao distance, the Kullback-Leibler divergence, the chi square divergence, and a flat ...
Frank Nielsen
doaj +1 more source
An Objective Prior from a Scoring Rule
In this paper, we introduce a novel objective prior distribution levering on the connections between information, divergence and scoring rules. In particular, we do so from the starting point of convex functions representing information in density ...
Stephen G. Walker, Cristiano Villa
doaj +1 more source
The Bregman Chord Divergence [PDF]
Distances are fundamental primitives whose choice significantly impacts the performances of algorithms in machine learning and signal processing. However selecting the most appropriate distance for a given task is an endeavor. Instead of testing one by one the entries of an ever-expanding dictionary of {\em ad hoc} distances, one rather prefers to ...
Frank Nielsen, Richard Nock
openaire +2 more sources
Minimax quantum state estimation under Bregman divergence [PDF]
We investigate minimax estimators for quantum state tomography under general Bregman divergences. First, generalizing the work of Koyama et al. [Entropy 19, 618 (2017)] for relative entropy, we find that given any estimator for a quantum state, there ...
Maria Quadeer +2 more
doaj +1 more source

