Preprint
Article

On the Kullback-Leibler Divergence Formalism (Kldf) of the Stable Mg1 Queue Manifold, Its Information Geometric Structure and Its Matrix Exponential

Altmetrics

Downloads

94

Views

26

Comments

0

This version is not peer-reviewed

Submitted:

29 January 2024

Posted:

31 January 2024

You are already at the latest version

Alerts
Abstract
The paper explores the Kullback-Leibler divergence formalism (KLDF) applied to the stable MG1 queue manifold. It explores the analytic forms of state probabilities and their maximization based on entropy functionals, subject to normalization and mean value constraints. The credibility of KLDF is justified through consistency axioms, and the application of Rényi's and Tsallis's formalisms on a stable M/G/1 queue is examined, resulting in novel state probabilities and insights into information theory of Queue Learning.
Keywords: 
Subject: Computer Science and Mathematics  -   Probability and Statistics

1. Introduction

1.1. Early Dawn of Minimum Relative Entropy(MRE)

In the context of probabilistic inverse approaches[1], it has become conventional to treat both measurable data and unknown parameters for the model being uncertain. This method provides deeper understanding of the uncertainty associated with the measured data and model parameters. [2,3,4,5,6,7,8,9,10]. KLD [11,12,13,14,15,16] is a method used to compare two probability distributions. In Probability and Statistics, when we need to simplify complex distributions or approximate observed data, KL Divergence helps us quantify the amount of information lost in the process of choosing an approximation. KLD  measures the difference between the two distributions and assists us with comprehending the trade-off between accuracy and simplicity in statistical modelling.
Shannonian entropic measure[9,17] ,namely  H p  reads as Preprints 97637 i001
With KL divergence we can calculate exactly how much information is lost when we approximate one distribution with another.

1.2. Information geometry(IG)

Many domains, including statistical inference, system control, and neural networks, have made extensive use of information geometry. In other words, IG seeks to apply differential geometry techniques to statistics.
A manifold [1819,20,21] is a topological finite-dimensional Cartesian space, R n , where an infinite-dimensional manifold exists. In Figure 1, model parameter inference from data is depicted as a decision-making problem. Information geometry offers a differential-geometric manifold structure M that may be used to create decision rules.
The matrix exponential is a concept that holds significance in the study of Lie groups[22], which are mathematical structures used to analyze continuous symmetries. In the context of the given text, there is a research paperthat explores the geometry of M/D/1 queues, a type of queuing system, by introducing a geometric structure based on the characteristics of queue length routes. This innovative approach aims to provide a new perspective on analysing and understanding these queues. In the context of the study, a geometric approach is used in analogy to Information Theory because it allows for the examination of figure invariance and equivariancewithout relying on specific coordinates. This means that geometric methods provide a coordinate-free manner to analyze and understand the properties of figures, which is beneficial in certain applications. Ricci curvature measures how the Riemannian metric deviates from the standard Euclidean metric, while scalar curvature quantifies the difference in volume between a geometric ball and a Euclidean ball of the same radius, as illustrated by Figure 2(c,f., [23]).
This revolutionary paper contributes to:
i)The provision of both FIM and IFIM for KLDF manifold.
ii)First-time calculation of   α   -connection[26]. iii) KLD and JD are calculated for the underlying queue iv) The compressibility (non-solenoidality) of KLDF manifold [27]. v)First time unification between queueing and matrix theories.
vi) The Rényi divergence (RD), D R γ ( p | q  and the  S, AB-divergence, D s , A B γ , η ( p | q  for KLDF  are devised. Notably,  computed divergence measure in this paper set the foundation towards the information theory of Queue Learning(QL)
vi)Numerical Experiments on The Rényi divergence (RD) , D R γ ( p | q  and the  S, AB-divergence, D s , A B γ , η ( p | q  of the KLDF manifold to illustrate how  both analytic and numerical experiments agree.
vii) A giant step towards the unification of KLDF of stable M/G/1 QM and its Information geometric structure is devised. viii) Introducing novel well-defined statistical queueing functionals, SQFs and investigate their algebraic structures.
This paper provides a roadmap of its contents, starting with early definitions in section 2 and an overview of consistency axioms in section 3. In the remaining sections, it introduces the KL formalism of the stable M/G/1 queue and devises service time distribution and cumulative functions. The paper also obtains the threshold theorem of KLDF, introduces the Fisher's information matrix and metric, explores the 𝛼-connection of the queue manifold, and reveals the compressibility and developability of the manifold. Additionally, it discusses the Scalar Curvature, Einstein Tensor, and stress-energy tensor in relation to information theory, queuing theory, and General Relativity. The paper concludes with the introduction of Rényi divergence and S, AB-divergence, numerical experiments, unification of KLDF and its information geometric structure, and the introduction of statistical queueing functionals.

2. Main Definitions in Information Geometry

Preprints 97637 i002
The authors have presented  a novel (dis)similarity measure, namely D s , A B γ , η ( p | q  (c.f., (2.10). Moreover, it  has been illustrated that D s , A B γ , η ( p | q  is potentially robust.

2.7. Well Defined Functions and Bijective Functions

Preprints 97637 i003
Figure 4. Depiction of how conical sections in the manifold differ in volume from corresponding conical locations in Euclidean space (c.f., [47]).
Figure 4. Depiction of how conical sections in the manifold differ in volume from corresponding conical locations in Euclidean space (c.f., [47]).
Preprints 97637 g004
Preprints 97637 i004
Figure 5. The three kinds of developable surfaces: a, left) tangential; b, centre) conical; c, right) cylindrical. Curves in bold are directrix or base curves; straight lines in bold are directors or generating lines (curves) (c.f., [49]).
Figure 5. The three kinds of developable surfaces: a, left) tangential; b, centre) conical; c, right) cylindrical. Curves in bold are directrix or base curves; straight lines in bold are directors or generating lines (curves) (c.f., [49]).
Preprints 97637 g005
According to Kouvatsos [50], the maximum entropy state probability of the generalized geometric solution of a stable M/G/1 queue, subject to normalisation, mean queue length (MQL), L and server utilisation, ρ (<1) is given by
Figure 6. A Stable M/G/1 queue.
Figure 6. A Stable M/G/1 queue.
Preprints 97637 g006
Preprints 97637 i005

2.11. Scalar Curvature(Ricci Scalar), R and Einestein Tensor,

Preprints 97637 i006

3.1. NME Formalisms and EME Consistency Axioms

evaluated the credibility of Tsallis' NME formalism in terms of the four consistency axioms for large systems. Tsallis' formalism, although satisfying the consistency axioms of uniqueness, invariance, and subset independence, defied the axiom of system independence, as it should, due to the existence of 'long-range' interactions.
The credibility of Rényi's NME formalism as a method of inductive reasoning is also investigated in this context in terms of the four EME consistency axioms in Appendix A. Because of the presence of long-range interactions, the joint NME state probability distribution of two independent non-extensive systems Q and V challenges the assumption of system independence (cf., [6]). As a result, these NME formalisms are obviously adequate for quantitative analyses of non-extensive dynamic systems with long queue tails and asymptotic power law behaviour.
The devised analytic proof on the credibility of RxE9;nyi’s NME formalism follows a similar methodology to the one employed for Tsallis’s NME formalism by Kouvatsos and Assi and it can be seen in Appendix A.

3.2. A Stable M/G/1 Queue with Long-Range Interactions

Throughout this paper we shall use QM as an acronym for queueing manifold, IG for Information Geometry  and QT for queueing theory.

3.3. Background:Shannon’s EME State Probability of a Stable M/G/1 Queue

Preprints 97637 i007

3.4. KLDF

Preprints 97637 i008
Preprints 97637 i009

3.5. Exact KL NME State Probabilities with Distinct GEKL-type Service Time Distributions

Preprints 97637 i010
Preprints 97637 i011

4. THE THRESHOLD THEOREMS OF KL FORMALISM, F s , K l ( t ) and C s , K L 2 FOR THE UNDERLYING MANIFOLD

Preprints 97637 i012
If f ' x > 0  ( < 0 ) for all x ( c , d )  ,then f is increasing(decreasing) on c , d .                                                         (61)                                                              

4.1. The Threshold Theorem of KL Formalism of The Stable MG1 Queueing System

Preprints 97637 i013

4.2. The Threshold Theorem of F s , K l ( t ) of The Stable MG1 Queueing System

Preprints 97637 i014
which by the preliminary theorem (4.1), the proof follows.
Engaging the same procedure, the remaining proof is immediate.
It is observed that Theorem (4.3), part (ii) presents a novel temporal threshold for F s , K L t . This temporal threshold is significantly dependent on μ and τ K L , which is, τ s = 2 1 + C s 2 impcated , the initial boundary steady state probaility of the comparable distribution q(0).
Also, it is clearly obvious that this novel temploral thrshold is influenced by the newly devised C s , K L 2 , τ K L = 2 1 + C s , K L 2
In the following section, it is obtained that C s , K L 2  of (60)  is forever decreasing in τ K L .

4.2. The Threshold Theorem of C s , K L 2 of The Stable MG1 Queueing System

Preprints 97637 i015

5. FIM and IFIM for KLDF manifold

According to Kouv [53], the maximum entropy state probability of the generalized geometric solution of a stable M/G/1 queue, subject to normalisation, mean queue length (MQL), L and server utilisation, ρ (<1) is given by:
Preprints 97637 i016
Preprints 97637 i017
This proves (iii).

6. The α-connection of the KLDF manifold

Preprints 97637 i018

7. The Compressibility ( Non-Solonoidability ) of KL Formalism of the Stable M/G/1 QM

Preprints 97637 i019
Preprints 97637 i020

8. The Developability of the Stable M/G/1 QM, the Positivity of Its Ricci Curvature Tensor and The Threshold Theorem of Ricci Curvature Tensor

Preprints 97637 i021
Preprints 97637 i022
Figure 7.
Figure 7.
Preprints 97637 g007
ii)Forever  increasing in the curvature parameter α, α > 0
α > 1 , ρ p = 0.5
Figure 8.
Figure 8.
Preprints 97637 g008
(iii)Forever  decreasing in the curvature parameter α, α < 0
α < 1 , ρ p = 0.5
Figure 9.
Figure 9.
Preprints 97637 g009

9. eA of the underlying manifold

Preprints 97637 i023
Preprints 97637 i024

10. Scalar Curvature(Ricci Scalar), R and Einestein Tensor, and the stress-energy tensor, ϖ of the KLF manifold

This section reports a new discovery of the missing link between information theory, queuing theory and General Relativity, namely the Scalar Curvature(Ricci Scalar), R  and Einestein Tensor,  and the stress-energy tensor, ϖ  of the underlying Kull-Leibler formalism, KLF for the investigated manifold.
Preprints 97637 i025
Preprints 97637 i026

11. The Rényi divergence (RD), D R γ ( p | q and the S, AB-divergence, D s , A B γ , η ( p | q of the KLF manifold

Preprints 97637 i027
Preprints 97637 i028

12. Numerical Experiments on The Rényi divergence (RD), D R γ ( p | q and the S, AB-divergence, D s , A B γ , η ( p | q  of the KLF of stable M/G/ 1 QM

For non-extensive information theoretic parameter, ITP = γ , figure 10 records the physical phenomenon of increasability of RD by the increase of server utilization and progressively RD approaches infinity as server utilization approaches unity, which drifts the underlying M/G/1 into instability phase. It is slightly observable that at the lower values of server utilization, RD decreases. This is quite clear by observing figure 11. This clearly shows the queueing impact represented by server utilization   on RD.
It is observed by figure 12, that for extensive ITP, the dual information theoretic and queueing theoretic significant impact on RD is clear as RD decreases immensely by the increase of server utilization until it approaches  as server utilization approaches unity(instability phase). Combining all the numerical findings, RD is significantly influenced by both ρ   a n d   γ .
The increasability of  D s , A B 0.6,0.4 ( p | q  is shown by figure 13 as in below. As  ρ  progresses to increase beyond 0.25, D s , A B 0.6,0.4 ( p | q  attains complex values.

13. Unification of Queueing Systems and KLF of stable M/G/ 1 QM

Preprints 97637 i029
The following theorem is a groundbreaking functional approach which unifies queueing theory with IG.
Preprints 97637 i030
Let ρ = 0.1 ,   α 1 0.1 ,   1 = ( 0.683772234,1 ) . So, we have
Figure 14 supports the analytic findings as it shows the significant impact of the curvature parameter on the performance of the family of inverse of the functionals QIGU, queueing-information geometric unifiers.
Let ρ = 0.1 α 1 0.1 ,   1 = ( 0.683772234,1 ) . So, we have
Figure 15 shows the immense increase of φ α 1 ( 0.1 )   as α  increases, until it approaches infinity for sufficiently large α , whereas in figure 16, α 1 0.1 ,   1 , it is observed that φ α 1 ( 0.1 )  is negative and increasing . This is seen from figure 16.
Let ρ = 0.1 α 1 0.1 ,   1 = ( 0.683772234,1 ) . So, we have
More to the extreme, for negative values of α , φ α 1 0.1 increases by the increase of α, until it approaches  for sufficiently large α. this is recorded by figure 17

14. Statistical Queueing functionals (SQFs)of KLF of stable M/G/ 1 QM

There are several SQFs representations. In what follows, we introduce some novel well-defined SQFs and investigate their algebraic structures.

14.1. The first representation

Preprints 97637 i031
Preprints 97637 i032

14.2. The second representation

Preprints 97637 i033
viii)Let f 2 ρ = 1 2 1 + ρ ζ 1 ρ = z , ρ ( 0 , 1 ) .This implies ρ = 2 z 1 2 z 1 + ζ .Consequently, f 2 , ζ 1 ρ = 2 ρ 1 2 ρ 1 + ζ  (c.f., (141))

14.3. The third representation

Preprints 97637 i034

14.4. The fourth representation

Preprints 97637 i035
Preprints 97637 i036

14.5. The fifth representation

Preprints 97637 i037
Preprints 97637 i038

15. Closing remarks and next phase of research

FIM, and α -connection for KLDF manifold is presented. Geodesic equations, Kullback divergence, and J-divergence are also developed for this KLDF manifold. According to the findings, the  compressibility for the KLDF manifold is proven. Additionally, the underlying manifold  possesses a non-zero RCT. Furthermore, the exponential of the FIM is demonstrated to be a differential equation solution, and the work develops information geometric ties to provide queueing-theoretic unification with other mathematical disciplines.

Appendix A: KL Formalism vs. EME Consistency Axioms

1. Uniqueness

Preprints 97637 i039
It is implied that  h K L , N q ( N ) = 1 , ln( h K L , N q ( N ) ) = 0 . This implies by (A.6), γ > 1 ,    that  γ l n γ = 0  (Contradiction)
q ( N ) >   h K L , N
It is implied that  h K L , N q ( N ) < 1 , ln( h K L , N q ( N ) ) < 0 .  Hence, KL divergence is negative , which contradicts that fact that KL divergence is non-negative(c.f.[57]).
Therefore., “there cannot be two distinct probability distributions f k L , N , h K L , N ϵ Ω having the same KL divergence measure in Ω .Thus, KL formalism satisfies the axiom of uniqueness (c.f., [6]).

2. Invariance

The invariance axiom states that “The same solution should be obtained if the same inference problem is solved twice in two different coordinate systems” (c.f., [58]).Following the analytic methodology proposed in and adopting the notation of Subsection 1, let Ξ be a coordinate transformation from state { S n , n = 1,2 , , N }  to state { M n , n = 1,2 , , N } , where Mbe a transformed set of N possible discrete states, namely M = M n , n = 1,2 , , N with   Γ ( p K l , N M n = Ξ 1 ( p K L , N S n , where J is the Jacobian   J = ( M n ) S n . Moreover, let Γ Ω be the closed convex set of all probability distributions Γ  defined on M such that Ξ p K l , N M n   > 0 for all M n ϵ M , n = 1, 2, ...,Nand   n = 1 N Ξ p K L , N M n = 1 . It can be clearly seen that, transforming variables from S n ∈ S into R n ∈ R, the extended  KL divergence (c.f., (2.1)) is transformation invariant namely
H K L * p K L , N = H K L * ( Ξ p K L , , N ) (A.7)
Thus, the EME formalism satisfies the axiom of invariance since the minimum in   Ξ Ω corresponds to the minimum in Ω ” (c.f., [57]).

3. System Independence

Preprints 97637 i040

4. Subset Independence(SI)

SI in a physical interpretation reads as “It does not matter whether one treats an independent subset of system states in terms of a separate conditional density or in terms of the full system density” (c.f., [59]).
In the given context, the notation and concepts related to an aggregate state of a system, denoted as x, and its associated probability distribution f K l x . The probability distribution represents the likelihood of the random variable X taking the value x. The text also mentions that the aggregate states ξ i , where   i ranges from 1 to L, can be expressed using this notation.
Preprints 97637 i041

References

  1. Mageed, I. A. (2023). The Entropian Threshold Theorems for the Steady State Probabilities of the Stable M/G/1 Queue with Heavy Tails with Applications of Probability Density Functions to 6G Networks. electronic Journal of Computer Science and Information Technology, 9(1), 24-30.
  2. Mageed, I. A. (2023, July). Rényi’s Maximum Entropy Formalism of Heavy-Tailed Queues with Hurst Exponent Heuristic Mean Queue Length Combined With Potential Applications of Hurst Exponent to Engineering. In 39th Annual UK Performance Engineering Workshop (p. 21).
  3. I.A. Mageed, and D.D. Kouvatsos, “Extended Properties of the Class of Rényi Generalized Entropies in the Discrete Time Domain”, 11-13 July 2011, IEEE International Conference on Computer Networks and Information Technology, Abbottabad, Pakistan, pp. 1-7. Available online: https://ieeexplore.ieee.org/document/6020894. [CrossRef]
  4. D.D. Kouvatsos, and I.A. Mageed (a), “Non-Extensive Maximum Entropy Formalisms and Inductive Inferences of Stable M/G/1 Queue with Heavy Tails”, in “Advanced Trends in Queueing Theory”, March 2021, Vol. 2, Vladimir Anisimov and Nikolaos Limnios (eds.), Books in ‘Mathematics and Statistics’, Sciences by ISTE & J. Wiley, London, UK.
  5. Mageed and Q. Zhang, "An Information Theoretic Unified Global Theory For a Stable M/G/1 Queue With Potential Maximum Entropy Applications to Energy Works," 2022 Global Energy Conference (GEC), Batman, Turkey, 2022, pp. 300-305. [CrossRef]
  6. Mageed, I. A. (2023, July). The Threshold Theorems of Generalized Z-entropy (GZE) fractal dimension (FD) Combined with Influential Applications of FD to Biotechnology Engineering. In 39th Annual UK Performance Engineering Workshop (p. 26).
  7. Kullback, S., 1958. Information Theory And Statistics, John Wiley, New York. USA.
  8. Mageed, I. A. (2023, July). Where the mighty trio meet: Information Theory (IT), Pathway Model Theory (PMT) and Queueing Theory (QT). In 39th Annual UK Performance Engineering Workshop (p. 8).
  9. Mageed, I. A., Zhang, Q., & Modu, B. (2023). The Linearity Theorem of Rényian and Tsallisian Maximum Entropy Solutions of The Heavy-Tailed Stable M/G/1 Queueing System entailed with Potential Queueing-Theoretic Applications to Cloud Computing and IoT. electronic Journal of Computer Science and Information Technology, 9(1), 15-23.
  10. Bhat, A. H., Siddiqui, N. A., Mageed, I. A., Alkhazaleh, S., Das, V. R., & Baig, M. A. K. (2023). Generalization of Renyi’s Entropy and its Application in Source Coding. Appl. Math, 17(5), 941-948.
  11. ageed, "The Consistency Axioms of The Stable M/G/1 Queue’s Z(a,b) Non-Extensive Maximum Entropy Formalism with M/G/1 Theory Applications to 6G Networks and Multimedia Applications," 2023 International Conference on Computer and Applications (ICCA), Cairo, Egypt, 2023, pp. 1-6,. [CrossRef]
  12. I.A.Mageed and Q. Zhang (a), “An Introductory Survey of Entropy Applications to Information Theory, Queueing Theory, Engineering, Computer Science and Statistical Mechanics”, Proceedings of 27th IEEE International Conference on Automation and Computing(ICAC), University of the West of England, Bristol, 1-3 September 2022.
  13. Mageed, I. A., & Zhang, Q. (2023). Threshold Theorems for the Tsallisian and Rényian (TR) Cumulative Distribution Functions (CDFs) of the Heavy-Tailed Stable M/G/1 Queue with Tsallisian and Rényian Entropic Applications to Satellite Images (SIs). electronic Journal of Computer Science and Information Technology, 9(1), 41-47.
  14. I.A. Mageed and Q. Zhang(b), “Inductive Inferences of Z-Entropy Formalism (ZEF) Stable M/G/1 Queue with Heavy Tails”, Proceedings of the 27th IEEE International Conference on Automation and Computing (ICAC), University of the West of England, Bristol, 1-3 September 2022.
  15. D.D. Kouvatsos, et I.A.Mageed(b), “Formalismes de maximum d’entropie non extensive et inférence inductive d’une file d’attente M/G/1 stable à queues Lourdes”, “Théorie des files d’attente 2”, Mars 2021, Théorie et Practique, Sous la direction de Vladimir Anisimov et Nikolaos Limnios, Mathématique, Sciences by ISTE & J. Wiley, Londres, Royaume-Uni.
  16. Count Baysie, May 2017. Available online: https://www.countbayesie.com/blog/2017/5/9/kullback-leibler-divergence-explained.
  17. E. Shannon, A mathematical theory of communication, Bell system technical journal 27 (3) (1948) 379{423 (1948).
  18. I.A. Mageed, and D.D. Kouvatsos, “The Impact of Information Geometry on the Analysis of the Stable M/G/1 Queue Manifold”, Major extension of paper [3], 4-6 February 2021, In Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-485-5, pages 153-160. [CrossRef]
  19. Mageed IA, Yuyang Zhou, Y, Liu, Y, and Zhang Q, “ Towards a Revolutionary Info-Geometric Control Theory with Potential Applications of Fokker Planck Kolmogorov(FPK) Equation to System Control, Modelling and Simulation”,In2023 28th International Conference on Automation and Computing (ICAC) 2023, 30th Aug- Sep 1. IEEE.
  20. Mageed IA, Yuyang Zhou, Y, Liu, Y, and Zhang Q, “Za,b -of the Stable Five-Dimensional M/G/1 Queue Manifold Formalism’s Info- Geometric Structure with Potential Info-Geometric Applications to Human Computer Collaborations and Digital Twins”,In2023 28th International Conference on Automation and Computing (ICAC) 2023, 30th Aug- Sep 1. IEEE.
  21. A Mageed, I. Info-Geometric Analysis of Human-Trust Based Feedback Control (HTBFC) Five-Dimensional Manifold with HTBFC Applications to Robotics. Preprints 2024, 2024012040. [CrossRef]
  22. B.C. Hall, The Matrix Exponential. In: Lie Groups, Lie Algebras, and Representations. Graduate Texts in Mathematics, vol 222. Springer, Cham, 2015.
  23. K.Nakagawa, The geometry of M/D/1 queues and Large Deviation, International Transactions of Operational Research, Volume 9, Issue 2, 2002.
  24. R.Kondor, S.Trivedi, On the Generalization of Equivariance and Convolution in Neural Networks to the action of Compact Groups, Proceedings of the 35th International Conference on Machine Learning, Stockholm, Sweden, PMLR 80, 2018.
  25. A Mageed, D.I. Info- Geometric Analysis of the Stable G/G/1 Queue Manifold Dynamics With G/G/1 Queue Applications to E-health. Preprints 2024, 2024011813. [CrossRef]
  26. Mageed, and D.D. Kouvatsos, “Information Geometric Structure of Stable M/G/1 Queue Manifold and its Matrix Exponential”, Proceedings of the 35th UK Performance Engineering Workshop, 16 December 2019,School of Computing, University of Leeds, Edited by Karim Djemame, p.123-135. Available online: https://sites.google.com/view/ukpew2019/home.
  27. MIT Open Course Ware,2010. Online available at:https://ocw.mit.edu/courses/mathematics/18-02sc-multivariable-calculus-fall-2010/4.-triple-integrals-and-surface-integrals-in-3-space/part-b-flux-and-the-divergence-theorem/session-84-divergence-theorem/MIT18_02SC_MNotes_v10.1.
  28. A Mageed, D.I. Information Geometric Analysis of the Dynamics of M/M/∞ Transient Queue Manifold. Preprints 2024, 2024011994. [CrossRef]
  29. Mageed, I. A., & Zhang, K. Q. (2022). Information Geometry? Exercises de Styles. electronic Journal of Computer Science and Information Technology, 8(1), 9-14.
  30. Regli, JB., Silva, R, 2018, Alpha-Beta Divergence for Variational Inference - arXiv preprint arXiv:1805.01045, - arxiv.org. . arxiv:1805.01045, - arxiv.org. Available online at [1805.01045] Alpha-Beta Divergence For Variational Inference (arxiv.
  31. Turner, Richard E and Sahani, Maneesh, 2011, Two problems with variational expectation maximisation for time series models. Bayesian Time series models, pp. 115–138.
  32. A Mageed, I. Info-Geometric Analysis of the Dynamics of Parthasarathian Transient Solution of M/M/1 Queue Manifold with Info-Geometric Applications to Machine Learning. Preprints 2024, 2024012008. [CrossRef]
  33. Minka, T., 2005, Divergence measures and message passing. Technical report, Technical report, Microsoft Research.
  34. Hern´andez-Lobato, Jos´e Miguel, Li, Yingzhen, Rowland, Mark, Hern´andez-Lobato, Daniel, Bui, Thang, D., and Turner, Richard E, 2016, Black-box αdivergence minimization.
  35. Mageed, I. A., & Zhang, Q. (2023). Formalism of the Rényian Maximum Entropy (RMF) of the Stable M/G/1 queue with Geometric Mean (GeoM) and Shifted Geometric Mean (SGeoM) Constraints with Potential GeoM Applications to Wireless Sensor Networks (WSNs). electronic Journal of Computer Science and Information Technology, 9(1), 31-40.
  36. Ghosh, Abhik, Harris, Ian R, Maji, Avijit, Basu, Ayanendranath, Pardo, Leandro, et al., 2017, A generalized divergence for statistical inference. Bernoulli, 23 (4A):2746–2783.
  37. Basu, Ayanendranath, Harris, Ian R, Hjort, Nils L, and Jones, MC., 1998, Robust and efficient estimation by minimising a density power divergence. Biometrika, 85(3):549–558.
  38. Ghosh, Abhik and Basu, Ayanendranath, 2016, Robust bayes estimation using the density power divergence. Annals of the Institute of Statistical Mathematics, 68 (2):413–437.
  39. Cichocki, Andrzej, Cruces, Sergio, and Amari,S., 2011, Generalized alpha-beta divergences and their application to robust nonnegative matrix factorization. Entropy, 13(1):134–170.
  40. Cilingir, K., Manzelli, R., Kulis,B., 2020, Deep Divergence Learning. Online available at; arXiv:2005.02612v1.
  41. Weisstein, E. W., 2021, Well-Defined, From MathWorld- A A Wolfram Web Resource.:. Available online: https://mathworld.wolfram.com/Well-Defined.html.
  42. Sankaranarayanan, S., 2014, lecture 18, One-to-One and Onto functions, an online source. Available online: https://home.cs.colorado.edu/~srirams/courses/csci2824-spr14/functionTypes-18.html.
  43. Loveridge, L.C., 7 September 2016, Physical and Geometric interpretations of the Riemannian Tensor, Ricci Tensor and Scalar Curvature, [Online]. Available online: https://arxiv.org/pdf/gr-qc/0401098.pdf.
  44. A Mageed, D.I. A Theory of Everything: When Information Geometry Meets the Generalized Brownian Motion and the Einsteinian Relativity. Preprints 2024, 2024011827. [CrossRef]
  45. Ollivier,Y. A visual interpretation to Riemannian Curvatures and Some Discrete Generalizations. 2010 [Online] www.yann-ollivier.org/rech/publs/visualcurvature.
  46. Thomas, R., Kissing the curve – manifolds in many dimensions. 2015. online at:https://plus.maths.org/content/kissing-curve-manifolds-many-dimensions.
  47. G.Gunawardena, Matrix Algebra for Beginners, part III, Department of Systems Biology, Harvard Medical school, MA02115, USA.
  48. L.Snezana, Developable Surfaces: Their History and Application, Nexus Network JournalVol. 13, No. 3, 2011.
  49. Mageed, I. A., & Bhat, A. H. (2022). Generalized Z-Entropy (Gze) and Fractal Dimensions. Appl. Math, 16(5), 829-834.
  50. I. A. Mageed, "Fractal Dimension(Df) Theory of Ismail’s Second Entropy(Hiq) with Potential Fractal Applications to ChatGPT, Distributed Ledger Technologies(DLTs) and Image Processing(IP)," 2023 International Conference on Computer and Applications (ICCA), Cairo, Egypt, 2023, pp. 1-6. [CrossRef]
  51. Mageed, I. A. (2023, July). Rényi’s Maximum Entropy Formalism of Heavy-Tailed Queues with Hurst Exponent Heuristic Mean Queue Length Combined With Potential Applications of Hurst Exponent to Engineering. In 39th Annual UK Performance Engineering Workshop (p. 21).
  52. I. A. Mageed, Q. Zhang, D. D. Kouvatsos and N. Shah, "M/G/1 queue with Balking Shannonian Maximum Entropy Closed Form Expression with Some Potential Queueing Applications to Energy," 2022 Global Energy Conference (GEC), Batman, Turkey, 2022, pp. 105-110,. [CrossRef]
  53. Mageed, I. A., & Zhang, Q. (2023). Formalism of the Rényian Maximum Entropy (RMF) of the Stable M/G/1 queue with Geometric Mean (GeoM) and Shifted Geometric Mean (SGeoM) Constraints with Potential GeoM Applications to Wireless Sensor Networks (WSNs). electronic Journal of Computer Science and Information Technology, 9(1), 31-40.
  54. Mageed, I. A. (2023). The Entropian Threshold Theorems for the Steady State Probabilities of the Stable M/G/1 Queue with Heavy Tails with Applications of Probability Density Functions to 6G Networks. electronic Journal of Computer Science and Information Technology, 9(1), 24-30.
  55. Garett, P., Calculus Refresher, 1978-2008. Available online: http://wwwusers. math.umn.edu/~garrett/calculus/first_year/notes.pdf.
  56. Shibuya, N., ,Demystifying KL Divergence, 2018. Available online: https://medium.com/activatingrobotic- minds/demystifying-kl-divergence-7ebe4317ee68.
  57. Mageed, I. A. Cosistency Axioms of Choice for Ismail’s Entropy Formalism (IEF) Combined with Information-Theoretic (IT) Applications to advance 6G Networks. European Journal of Technique (EJT), 2023, 13(2), 207-213.
  58. Statistics, T. (2007). http://www.cscs.umich.edu/ Statistical mechanics for non-extensive systems and longrange interactions. notebooks. Available online: http://www.cscs.umich.edu.
Figure 1. Parametrization of a statistical manifold (c.f., [19]).
Figure 1. Parametrization of a statistical manifold (c.f., [19]).
Preprints 97637 g001
Figure 2. Geometric illustration of curved surfaces’ geodesics.
Figure 2. Geometric illustration of curved surfaces’ geodesics.
Preprints 97637 g002
Figure 3. (c.f., [41]).
Figure 3. (c.f., [41]).
Preprints 97637 g003
Figure 10.
Figure 10.
Preprints 97637 g010
Figure 11.
Figure 11.
Preprints 97637 g011
Figure 12.
Figure 12.
Preprints 97637 g012
Figure 13.
Figure 13.
Preprints 97637 g013
Figure 14.
Figure 14.
Preprints 97637 g014
Figure 15.
Figure 15.
Preprints 97637 g015
Figure 16.
Figure 16.
Preprints 97637 g016
Figure 17.
Figure 17.
Preprints 97637 g017
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated