18,979 research outputs found
Organismic Supercategories and Qualitative Dynamics of Systems
The representation of biological systems by means of organismic supercategories, developed in previous papers, is further discussed. The different approaches to relational biology, developed by Rashevsky, Rosen and by Baianu and Marinescu, are compared with Qualitative Dynamics of Systems which was initiated by Henri Poincaré (1881). On the basis of this comparison some concrete results concerning dynamics of genetic system, development, fertilization, regeneration, analogies, and oncogenesis are derived
Recommended from our members
Learning perceptual schemas to avoid the utility problem
This paper describes principles for representing and organising planning knowledge in a machine learning architecture. One of the difficulties with learning about tasks requiring planning is the utility problem: as more knowledge is acquired by the learner, the utilisation of that knowledge takes on a complexity which overwhelms the mechanisms of the original task. This problem does not, however, occur with human learners: on the contrary, it is usually the case that, the more knowledgeable the learner, the greater the efficiency and accuracy in locating a solution. The reason for this lies in the types of knowledge acquired by the human learner and its organisation. We describe the basic representations which underlie the superior abilities of human experts, and describe algorithms for using equivalent representations in a machine learning architecture
Quantum Knitting
We analyze the connections between the mathematical theory of knots and
quantum physics by addressing a number of algorithmic questions related to both
knots and braid groups.
Knots can be distinguished by means of `knot invariants', among which the
Jones polynomial plays a prominent role, since it can be associated with
observables in topological quantum field theory.
Although the problem of computing the Jones polynomial is intractable in the
framework of classical complexity theory, it has been recently recognized that
a quantum computer is capable of approximating it in an efficient way. The
quantum algorithms discussed here represent a breakthrough for quantum
computation, since approximating the Jones polynomial is actually a `universal
problem', namely the hardest problem that a quantum computer can efficiently
handle.Comment: 29 pages, 5 figures; to appear in Laser Journa
Visualization of AE's Training on Credit Card Transactions with Persistent Homology
Auto-encoders are among the most popular neural network architecture for
dimension reduction. They are composed of two parts: the encoder which maps the
model distribution to a latent manifold and the decoder which maps the latent
manifold to a reconstructed distribution. However, auto-encoders are known to
provoke chaotically scattered data distribution in the latent manifold
resulting in an incomplete reconstructed distribution. Current distance
measures fail to detect this problem because they are not able to acknowledge
the shape of the data manifolds, i.e. their topological features, and the scale
at which the manifolds should be analyzed. We propose Persistent Homology for
Wasserstein Auto-Encoders, called PHom-WAE, a new methodology to assess and
measure the data distribution of a generative model. PHom-WAE minimizes the
Wasserstein distance between the true distribution and the reconstructed
distribution and uses persistent homology, the study of the topological
features of a space at different spatial resolutions, to compare the nature of
the latent manifold and the reconstructed distribution. Our experiments
underline the potential of persistent homology for Wasserstein Auto-Encoders in
comparison to Variational Auto-Encoders, another type of generative model. The
experiments are conducted on a real-world data set particularly challenging for
traditional distance measures and auto-encoders. PHom-WAE is the first
methodology to propose a topological distance measure, the bottleneck distance,
for Wasserstein Auto-Encoders used to compare decoded samples of high quality
in the context of credit card transactions.Comment: arXiv admin note: substantial text overlap with arXiv:1905.0989
- …