Related papers: Maximum Entropy and Sufficiency
Let V be a Euclidean Jordan algebra of rank n. The eigenvalue map from V to R^n takes any element x in V to the vector of eigenvalues of x written in the decreasing order. A spectral set in V is the inverse image of a permutation set in R^n…
We revisit the maximum-entropy inference of the state of a finite-level quantum system under linear constraints. The constraints are specified by the expected values of a set of fixed observables. We point out the existence of…
We provide a sharp rate of convergence in the central limit theorem for random vectors with an unconditional, log-concave density. The argument relies on analysis of the Neumann laplacian on convex domains and on the theory of optimal…
Two different sufficient conditions are given for the convergence of the Magnus expansion arising in the study of the linear differential equation $Y' = A(t) Y$. The first one provides a bound on the convergence domain based on the norm of…
Let L be an ample holomorphic line bundle over a compact complex Hermitian manifold X. Any fixed smooth Hermitian metric on L induces a Hilbert space structure on the space of global holomorphic sections with values in the k:th tensor power…
We study the continuity of the maximum-entropy inference map for two observables in finite dimensions. We prove that the continuity is equivalent to the strong continuity of the set-valued inverse numerical range map. This gives a…
A tight alignment between the degree vector and the leading eigenvector arises naturally in networks with neutral degree mixing and the absence of local structures. Many real-world networks, however, violate both conditions. We derive…
We introduce complex cones and associated projective gauges, generalizing a real Birkhoff cone and its Hilbert metric to complex vector spaces. We deduce a variety of spectral gap theorems in complex Banach spaces. We prove a dominated…
The resource theory of quantum coherence studies the off-diagonal elements of a density matrix in a distinguished basis, whereas the resource theory of purity studies all deviations from the maximally mixed state. We establish a direct…
Bregman divergences play a central role in the design and analysis of a range of machine learning algorithms. This paper explores the use of Bregman divergences to establish reductions between such algorithms and their analyses. We present…
We develop a max-plus spectral theory for infinite matrices. We introduce recurrence and tightness conditions, under which many results of the finite dimensional theory, concerning the representation of eigenvectors and the asymptotic…
We extend the Gibbs conditioning principle to an abstract setting combining infinitely many linear equality constraints and non-linear inequality constraints, which need not be convex. A conditional large large deviation principle (LDP) is…
Given a finite structure $M$ and property $p$, it is a natural to study the degree of satisfiability of $p$ in $M$; i.e. to ask: what is the probability that uniformly randomly chosen elements in $M$ satisfy $p$? In group theory, a…
Entropy of all systems that we understand well is proportional to their volumes except for black holes given by their horizon area. This makes the microstates of any quantum theory of gravity drastically different from the ordinary matter.…
We define a version of multiplier ideals, the Mather multiplier ideals, on a variety with arbitrary singularities, using the Mather discrepancy and the Jacobian ideal. In this context we prove a relative vanishing theorem, thus obtaining…
For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…
Relative entropy (divergence) of Bregman type recently proposed by T. D. Frank and Jan Naudts is considered and its quantum counterpart is used to calculate purity of the Werner state in nonextensive formalism. It has been observed that two…
Consider the set of all sequences of $n$ outcomes, each taking one of $m$ values, that satisfy a number of linear constraints. If $m$ is fixed while $n$ increases, most sequences that satisfy the constraints result in frequency vectors…
It is shown that there exists a nontrivial uniform algebra that is Dirichlet on its maximal ideal space and has a dense set of elements that are exponentials. This answers a 65-year-old question of John Wermer and a 17-year-old question of…
We revisit the method of mixture technique, also known as the Laplace method, to study the concentration phenomenon in generic exponential families. Combining the properties of Bregman divergence associated with log-partition function of…