F-Divergences and Cost Function Locality in Generative Modelling with Quantum Circuits. [PDF]
Generative modelling is an important unsupervised task in machine learning. In this work, we study a hybrid quantum-classical approach to this task, based on the use of a quantum circuit born machine. In particular, we consider training a quantum circuit
Leadbeater C +3 more
europepmc +2 more sources
Inequalities for Jensen-Sharma-Mittal and Jeffreys-Sharma-Mittal Type f-Divergences. [PDF]
In this paper, we introduce new divergences called Jensen–Sharma–Mittal and Jeffreys–Sharma–Mittal in relation to convex functions. Some theorems, which give the lower and upper bounds for two new introduced divergences, are provided.
Kluza PA.
europepmc +2 more sources
Zipf-Mandelbrot law, f-divergences and the Jensen-type interpolating inequalities. [PDF]
Motivated by the method of interpolating inequalities that makes use of the improved Jensen-type inequalities, in this paper we integrate this approach with the well known Zipf–Mandelbrot law applied to various types of f-divergences and distances, such ...
Lovričević N +2 more
europepmc +2 more sources
Uniform Treatment of Integral Majorization Inequalities with Applications to Hermite-Hadamard-Fejér-Type Inequalities and f-Divergences. [PDF]
In this paper, we present a general framework that provides a comprehensive and uniform treatment of integral majorization inequalities for convex functions and finite signed measures.
Horváth L.
europepmc +2 more sources
Viewpoint Selection for 3D-Games with f-Divergences. [PDF]
In this paper, we present a novel approach for the optimal camera selection in video games. The new approach explores the use of information theoretic metrics f-divergences, to measure the correlation between the objects as viewed in camera frustum and ...
Martin MY, Sbert M, Chover M.
europepmc +2 more sources
Optimum Achievable Rates in Two Random Number Generation Problems with f-Divergences Using Smooth Rényi Entropy. [PDF]
Two typical fixed-length random number generation problems in information theory are considered for general sources. One is the source resolvability problem and the other is the intrinsic randomness problem.
Nomura R, Yagi H.
europepmc +2 more sources
A New Information-Theoretical Distance Measure for Evaluating Community Detection Algorithms [PDF]
Community detection is a research area from network science dealing with the investigation of complex networks such as social or biological networks, aiming to identify subgroups (communities) of entities (nodes) that are more closely related to each ...
Mariam Haroutunian +2 more
doaj +3 more sources
We consider a sub-class of the f-divergences satisfying a stronger convexity property, which we refer to as strongly convex, or κ-convex divergences. We derive new and old relationships, based on convexity arguments, between popular f-divergences.
James Melbourne
doaj +1 more source
On the Converse Jensen-Type Inequality for Generalized f-Divergences and Zipf–Mandelbrot Law
Motivated by some recent investigations about the sharpness of the Jensen inequality, this paper deals with the sharpness of the converse of the Jensen inequality.
Mirna Rodić
doaj +1 more source
A new refinement of Jensen’s inequality with applications in information theory
In this paper, we present a new refinement of Jensen’s inequality with applications in information theory. The refinement of Jensen’s inequality is obtained based on the general functional in the work of Popescu et al.
Xiao Lei, Lu Guoxiang
doaj +1 more source

