Folding and Unfolding on Metagraphs
Typed metagraphs are defined as hypergraphs with types assigned to hyperedges and their targets, and the potential to have targets of hyperedges connect to whole links as well as targets. Directed typed metagraphs (DTMGs) are introduced via partitioning the targets of each edge in a typed metagraph into input, output and lateral sets; one can then look at "metapaths" in which edges' output-sets are linked to other edges' input-sets. An initial algebra approach to DTMGs is presented, including introduction of constructors for building up DTMGs and laws regarding relationships among multiple ways of using these constructors. A menagerie of useful morphism types is then defined on DTMGs (catamorphisms, anamorphisms, histomorphisms, futumorphisms, hylomorphisms, chronomorphisms, metamorphisms and metachronomorphisms), providing a general abstract framework for formulating a broad variety of metagraph operations. Deterministic and stochastic processes on typed metagraphs are represented in terms of forests of DTMGs defined over a common TMG, where the various morphisms can be straightforwardly extended to these forests. A variation of the approach to undirected typed metagraphs is presented; and it is indicated how the framework outlined can applied to realistic metagraphs involving complexities like dependent and probabilistic types, multidimensional values and dynamic processing including insertion and deletion of edges.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Patterns of Cognition: Cognitive Algorithms as Galois Connections Fulfilled by Chronomorphisms On Probabilistically Typed Metagraphs
It is argued that a broad class of AGI-relevant algorithms can be expressed in a common formal framework, via specifying Galois connections linking search and optimization processes on directed metagraphs whose edge targ…
ClusteringChetaev Instability Framework for Kinetostatic Compliance-Based Protein Unfolding
Understanding the process of protein unfolding plays a crucial role in various applications such as design of folding-based protein engines. Using the well-established kinetostatic compliance (KCM)-based method for model…
Protein FoldingFull Event Particle-Level Unfolding with Variable-Length Latent Variational Diffusion
The measurements performed by particle physics experiments must account for the imperfect response of the detectors used to observe the interactions. One approach, unfolding, statistically adjusts the experimental data f…
An unfolding method based on conditional Invertible Neural Networks (cINN) using iterative training
The unfolding of detector effects is crucial for the comparison of data to theory predictions. While traditional methods are limited to representing the data in a low number of dimensions, machine learning has enabled ne…
Comprehensive Review of Deep Unfolding Techniques for Next-Generation Wireless Communication Systems
The application of machine learning in wireless communications has been extensively explored, with deep unfolding emerging as a powerful model-based technique. Deep unfolding enhances interpretability by transforming com…