Complexity of Self-similar Hierarchical Ensembles
A.I. Olemskoi
TL;DR
This paper investigates the complexity of self-similar hierarchical ensembles using a generalized combinatorial approach, revealing how complexity varies with hierarchy coupling, scattering, and non-extensivity parameters.
Contribution
It introduces a generalized combinatorial framework to analyze the complexity of infinite self-similar hierarchical ensembles and explores how this complexity depends on various parameters.
Findings
Complexity increases with stronger hierarchy coupling.
Complexity decreases as scattering of coupling increases.
Non-extensivity parameter also influences the complexity.
Abstract
Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the value, which decreases with growth of both scattering of this coupling and non-extensivity parameter.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.