Maximum Entropy and Sufficiency
arXiv:1607.02259 · doi:10.3390/e19050206
Abstract
The notion of Bregman divergence and sufficiency will be defined on general convex state spaces. It is demonstrated that only spectral sets can have a Bregman divergence that satisfies a sufficiency condition. Positive elements with trace 1 in a Jordan algebra are examples of spectral sets, and the most important example is the set of density matrices with complex entries. It is conjectured that information theoretic considerations lead directly to the notion of Jordan algebra under some regularity conditions.
References in corpus (20)
- The information bottleneck method
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
- Monotonicity of quantum relative entropy revisited
- Higher-order interference and single-system postulates characterizing quantum theory
- Constructor Theory of Information
- Monotonicity of the Quantum Relative Entropy Under Positive Maps
- Sufficiency in quantum statistical inference
- Relative Entropy Bounds on Quantum, Private and Repeater Capacities
- Thermodynamics and the structure of quantum theory
- Ruling out higher-order interference from purity principles
- Proper local scoring rules on discrete sample spaces
- Preservation of a quantum Renyi relative entropy implies existence of a recovery map
- Information Measures: the Curious Case of the Binary Alphabet
- On the joint convexity of the Bregman divergence of matrices
- Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families
- Characterisation of matrix entropies
- Sufficiency on the Stock Market
- Proper Scoring Rules and Bregman Divergences
- Quantum Information on Spectral Sets
- Proper Scoring and Sufficiency