The Energy Homeostasis Principle: A Naturalistic Approach to Explain the Emergence of Behavior

It is still elusive to explain the emergence of behavior and understanding based on its neural mechanisms. One renowned proposal is the Free Energy Principle (FEP), which uses an information-theoretic framework derived from thermodynamic considerations to describe how behavior and understanding emerge. FEP starts from a whole-organism approach, based on mental states and phenomena, mapping them into the neuronal substrate. An alternative approach, the Energy Homeostasis Principle (EHP), initiates a similar explanatory effort but starts from single-neuron phenomena and builds up to whole-organism behavior and understanding. In this work, we further develop the EHP as a distinct but complementary vision to FEP and try to explain how behavior and understanding would emerge from the local requirements of the neurons. Based on EHP and a strict naturalist approach that sees living beings as physical and deterministic systems, we explain scenarios where learning would emerge without the need for volition or goals. Given these starting points, we state several considerations of how we see the nervous system, particularly the role of the function, purpose, and conception of goal-oriented behavior. We problematize these conceptions, giving an alternative teleology-free framework in which behavior and, ultimately, understanding would still emerge. We reinterpret neural processing by explaining basic learning scenarios up to simple anticipatory behavior. Finally, we end the article with an evolutionary perspective of how this non-goal-oriented behavior appeared. We acknowledge that our proposal, in its current form, is still far from explaining the emergence of understanding. Nonetheless, we set the ground for an alternative neuron-based framework to ultimately explain understanding.

Survival probability of random walks leaping over traps

We consider one-dimensional discrete-time random walks (RWs) in the presence of finite size traps of length ℓ over which the RWs can jump. We study the survival probability of such RWs when the traps are periodically distributed and separated by a distance L. We obtain exact results for the mean first-passage time and the survival probability in the special case of a double-sided exponential jump distribution. While such RWs typically survive longer than if they could not leap over traps, their survival probability still decreases exponentially with the number of steps. The decay rate of the survival probability depends in a non-trivial way on the trap length ℓ and exhibits an interesting regime when ℓ → 0 as it tends to the ratio ℓ/L, which is reminiscent of strongly chaotic deterministic systems. We generalize our model to continuous-time RWs, where we introduce a power-law distributed waiting time before each jump. In this case, we find that the survival probability decays algebraically with an exponent that is independent of the trap length. Finally, we derive the diffusive limit of our model and show that, depending on the chosen scaling, we obtain either diffusion with uniform absorption, or diffusion with periodically distributed point absorbers.

Application of Mini-Batch Metaheuristic Algorithms in Problems of Optimization of Deterministic Systems with Incomplete Information about the State Vector

In this paper, we consider the application of the zero-order mini-batch optimization method in the problem of finding optimal control of a pencil of trajectories of nonlinear deterministic systems in the case of incomplete information about the state vector. The pencil of trajectories originates from a given set of initial states. To solve the problem, the structure of a feedback system is proposed, which contains models of the plant, measuring system, nonlinear state observer and control law of the fixed structure with unknown coefficients. The objective function proposed considers the quality of pencil of trajectories control, which is estimated by the average value of the Bolz functional over the given set of initial states. Unknown control laws of a plant and an observer are found in the form of expansions in terms of orthonormal systems of basis functions, which are specified on the set of possible states of a dynamical system. The original pencil of trajectories control problem is reduced to a global optimization problem, which is solved using the well-proven zero-order method, which uses a modified mini-batch approach in a random search procedure with adaptation. An algorithm for solving the problem is proposed. The satellite stabilization problem with incomplete information is solved.

Universally valid reduction of multiscale stochastic biochemical systems using simple non-elementary propensities

Biochemical systems consist of numerous elementary reactions governed by the law of mass action. However, experimentally characterizing all the elementary reactions is nearly impossible. Thus, over a century, their deterministic models that typically contain rapid reversible bindings have been simplified with non-elementary reaction functions (e.g., Michaelis-Menten and Morrison equations). Although the non-elementary reaction functions are derived by applying the quasi-steady-state approximation (QSSA) to deterministic systems, they have also been widely used to derive propensities for stochastic simulations due to computational efficiency and simplicity. However, the validity condition for this heuristic approach has not been identified even for the reversible binding between molecules, such as protein-DNA, enzyme-substrate, and receptor-ligand, which is the basis for living cells. Here, we find that the non-elementary propensities based on the deterministic total QSSA can accurately capture the stochastic dynamics of the reversible binding in general. However, serious errors occur when reactant molecules with similar levels tightly bind, unlike deterministic systems. In that case, the non-elementary propensities distort the stochastic dynamics of a bistable switch in the cell cycle and an oscillator in the circadian clock. Accordingly, we derive alternative non-elementary propensities with the stochastic low-state QSSA, developed in this study. This provides a universally valid framework for simplifying multiscale stochastic biochemical systems with rapid reversible bindings, critical for efficient stochastic simulations of cell signaling and gene regulation. To facilitate the framework, we provide a user-friendly open-source computational package, ASSISTER, that automatically performs the present framework.

Verification of composed web service using Synthesized Nondeterministic Turing Model (SNTMM) with Multiple Tapes and Stacks

To verify the composed Web services, a general view of what traits of a service need to be identified is still lacking. The existing verification model did not address any mechanism for getting alternative services if we failed to reach the desired service and partially concentrated on the reachability problem for a deterministic and non-deterministic system in sequential. This paper proposes a Synthesised Non-deterministic Turing Machine Model (SNTMM) by combining the Multistacked Non-deterministic Turing Machine (MSNTM) model and Multitaped Non-deterministic Turing Machine (MTNTM) model to verify the composed Web services for both deterministic and non-deterministic systems in parallel. The deceased transition and departed service marking algorithm have been proposed to address each participated service’s reachability in composing service for all possible input in parallel. This article shows an example to demonstrate the meticulousness of the model. The experimental results show that the performance of the proposed model is measured efficiently

Energy Homeostasis Principle: A Naturalistic Approach to Explain the Emergence of Behavior

Explaining the emergence of behavior and understanding on the basis of neuronal mechanisms is still elusive. One renowned proposal is the Free Energy Principle (FEP), which uses an information-theoretic framework derived from thermodynamic considerations to describe how behavior and understanding would emerge. FEP starts from a whole organism approach, based on mental states and phenomena, mapping them into the neuronal substrate. An alternative approach, the Energy Homeostasis Principle (EHP), initiates a similar explanatory effort, but starting from single neuron phenomena and building up to the whole organism’s behavior and understanding. In this work, we develop the EHP as an alternative but complementary vision to FEP and try to explain how behavior and understanding would emerge from the local requirements of the neurons. Based on EHP and a strict naturalist approach that sees living beings as physical and deterministic systems, we explain scenarios where learning would emerge without the need for volition or goals. Given these starting points, we state several considerations of how we see the nervous system, particularly the role of function, purpose, and the conception of goal-oriented behaviors. We problematize these conceptions, giving an alternative teleology-free framework in which behavior and, ultimately, understanding would still emerge. We reinterpret neural processing explaining basic learning situations up to simple anticipatory behavior. Finally, we end the work with an evolutionary perspective of how this non-goal-oriented behavior appears. We acknowledge that in the current form of our proposal, we are still far from explaining the emergence of understanding. Still, we set the ground for an alternative neuron-based framework to ultimately explain understanding.

Comparison of Causality Network Estimation in the Sensor and Source Space: Simulation and Application on EEG

The usage of methods for the estimation of the true underlying connectivity among the observed variables of a system is increasing, especially in the domain of neuroscience. Granger causality and similar concepts are employed for the estimation of the brain network from electroencephalogram (EEG) data. Also source localization techniques, such as the standardized low resolution electromagnetic tomography (sLORETA), are widely used for obtaining more reliable data in the source space. In this work, connectivity structures are estimated in the sensor and in the source space making use of the sLORETA transformation for simulated and for EEG data with episodes of spontaneous epileptiform discharges (ED). From the comparative simulation study on high-dimensional coupled stochastic and deterministic systems originating in the sensor space, we conclude that the structure of the estimated causality networks differs in the sensor space and in the source space. Moreover, different network types, such as random, small-world and scale-free, can be better discriminated on the basis of the data in the original sensor space than on the transformed data in the source space. Similarly, in EEG epochs containing epileptiform discharges, the discriminative ability of network topological indices was significantly better in the sensor compared to the source level. In conclusion, causality networks constructed at the sensor and source level, for both simulated and empirical data, exhibit significant structural differences. These observations indicate that further studies are warranted in order to clarify the exact relationship between data registered in the sensor and source space.

A General Metric for the Similarity of Both Stochastic and Deterministic System Dynamics

Many problems in the study of dynamical systems—including identification of effective order, detection of nonlinearity or chaos, and change detection—can be reframed in terms of assessing the similarity between dynamical systems or between a given dynamical system and a reference. We introduce a general metric of dynamical similarity that is well posed for both stochastic and deterministic systems and is informative of the aforementioned dynamical features even when only partial information about the system is available. We describe methods for estimating this metric in a range of scenarios that differ in respect to contol over the systems under study, the deterministic or stochastic nature of the underlying dynamics, and whether or not a fully informative set of variables is available. Through numerical simulation, we demonstrate the sensitivity of the proposed metric to a range of dynamical properties, its utility in mapping the dynamical properties of parameter space for a given model, and its power for detecting structural changes through time series data.

The Role of Random Structures in Tissue Formation: From a Viewpoint of Morphogenesis in Stochastic Systems

In this article, we investigate a type of biological tissue formation system with a random structure of reaction or/and diffusion, analyzing the connection with the results obtained in [Rajapakse & Smale, 2017a] for the corresponding deterministic systems and showing the major difference from these results. Interestingly, we find a dynamical phenomenon leading to morphogenesis or emergence in such a system. Also we find their transitions in this system, while only one type of dynamical behavior occurs for the deterministic systems that satisfy typical conditions. Using the stability theory of stochastic systems, we quantitatively elucidate how such a phenomenon is emergent in complex networks with random structures. We believe that our analytical results could be beneficial to understand the underlying mechanisms of complexity-induced functions in tissue formation within real environments.

Rational Verification for Probabilistic Systems

Rational verification is the problem of determining which temporal logic properties will hold in a multi-agent system, under the assumption that agents in the system act rationally, by choosing strategies that collectively form a game-theoretic equilibrium. Previous work in this area has largely focussed on deterministic systems. In this paper, we develop the theory and algorithms for rational verification in probabilistic systems. We focus on concurrent stochastic games (CSGs), which can be used to model uncertainty and randomness in complex multi-agent environments. We study the rational verification problem for both non-cooperative games and cooperative games in the qualitative probabilistic setting. In the former case, we consider LTL properties satisfied by the Nash equilibria of the game and in the latter case LTL properties satisfied by the core. In both cases, we show that the problem is 2EXPTIME-complete, thus not harder than the much simpler verification problem of model checking LTL properties of systems modelled as Markov decision processes (MDPs).