In rational decision-making processes, the information interaction among individual robots is a critical factor influencing system stability. We establish a game-theoretic model based on mutual information to address division of labor decision-making and stability issues arising from differential information interaction among swarm robots. Firstly, a mutual information model is employed to measure the information interaction among robots and analyze its influence on the behavior of individual robots. Secondly, employing the Cournot model and the Stackelberg model, we model the diverse decision-making behaviors of swarm robots influenced by discrepancies in mutual information. The intricate decision dynamics exhibited by the system under the disparity mutual information values during the game process, along with the stability of Nash equilibrium points, are analyzed. Finally, dynamic complexity simulations of the game models are simulated under the disparity mutual information values: (1) When ν1 of the game model varies within a certain range, the Nash equilibrium point loses stability and enters a chaotic state. (2) As I(X;Y) increases, the decision-making pattern of robots transitions gradually from the Cournot game to the Stackelberg game. Concurrently, the sensitivity of swarm robotics systems to changes in decision parameter decreases, reducing the likelihood of the system entering a chaotic state.

Originally developed as a theory of consciousness, integrated information theory provides a mathematical framework to quantify the causal irreducibility of systems and subsets of units in the system. Specifically, mechanism integrated information quantifies how much of the causal powers of a subset of units in a state, also referred to as a mechanism, cannot be accounted for by its parts. If the causal powers of the mechanism can be fully explained by its parts, it is reducible and its integrated information is zero. Here, we study the upper bound of this measure and how it is achieved. We study mechanisms in isolation, groups of mechanisms, and groups of causal relations among mechanisms. We put forward new theoretical results that show mechanisms that share parts with each other cannot all achieve their maximum. We also introduce techniques to design systems that can maximize the integrated information of a subset of their mechanisms or relations. Our results can potentially be used to exploit the symmetries and constraints to reduce the computations significantly and to compare different connectivity profiles in terms of their maximal achievable integrated information.

Scale-free brain activity, linked with learning, the integration of different time scales, and the formation of mental models, is correlated with a metastable cognitive basis. The spectral slope, a key aspect of scale-free dynamics, was proposed as a potential indicator to distinguish between different sleep stages. Studies suggest that brain networks maintain a consistent scale-free structure across wakefulness, anesthesia, and recovery. Although differences in anesthetic sensitivity between the sexes are recognized, these variations are not evident in clinical electroencephalographic recordings of the cortex. Recently, changes in the slope of the power law exponent of neural activity were found to correlate with changes in Rényi entropy, an extended concept of Shannon\'s information entropy. These findings establish quantifiers as a promising tool for the study of scale-free dynamics in the brain. Our study presents a novel visual representation called the Rényi entropy-complexity causality space, which encapsulates complexity, permutation entropy, and the Rényi parameter q. The main goal of this study is to define this space for classical dynamical systems within theoretical bounds. In addition, the study aims to investigate how well different time series mimicking scale-free activity can be discriminated. Finally, this tool is used to detect dynamic features in intracranial electroencephalography (iEEG) signals. To achieve these goals, the study implementse the Bandt and Pompe method for ordinal patterns. In this process, each signal is associated with a probability distribution, and the causal measures of Rényi entropy and complexity are computed based on the parameter q. This method is a valuable tool for analyzing simulated time series. It effectively distinguishes elements of correlated noise and provides a straightforward means of examining differences in behaviors, characteristics, and classifications. For the iEEG experimental data, the REM state showed a greater number of significant sex-based differences, while the supramarginal gyrus region showed the most variation across different modes and analyzes. Exploring scale-free brain activity with this framework could provide valuable insights into cognition and neurological disorders. The results may have implications for understanding differences in brain function between the sexes and their possible relevance to neurological disorders.

暂无摘要。

Accounts of human language comprehension propose different mathematical relationships between the contextual probability of a word and how difficult it is to process, including linear, logarithmic, and super-logarithmic ones. However, the empirical evidence favoring any of these over the others is mixed, appearing to vary depending on the index of processing difficulty used and the approach taken to calculate contextual probability. To help disentangle these results, we focus on the mathematical relationship between corpus-derived contextual probability and the N400, a neural index of processing difficulty. Specifically, we use 37 contemporary transformer language models to calculate the contextual probability of stimuli from 6 experimental studies of the N400, and test whether N400 amplitude is best predicted by a linear, logarithmic, super-logarithmic, or sub-logarithmic transformation of the probabilities calculated using these language models, as well as combinations of these transformed metrics. We replicate the finding that on some datasets, a combination of linearly and logarithmically-transformed probability can predict N400 amplitude better than either metric alone. In addition, we find that overall, the best single predictor of N400 amplitude is sub-logarithmically-transformed probability, which for almost all language models and datasets explains all the variance in N400 amplitude otherwise explained by the linear and logarithmic transformations. This is a novel finding that is not predicted by any current theoretical accounts, and thus one that we argue is likely to play an important role in increasing our understanding of how the statistical regularities of language impact language comprehension.

BACKGROUND: The electron localization is a concept that allows scientists to better understand the physical and chemical properties of electronic systems. It is associated with the propensity of electron pairs with opposite spins to accumulate as well as with their response to external perturbations. This paper contains a detailed description of the design and implementation of the program KLD, which was primarily developed in our research group to elucidate electron localization in molecular systems by evaluating the information content of electron-pair density functions. KLD employs two information-based functions as a real space measure of the Fermi and Coulomb holes for same-spin electrons and shows a better resolution as compared to other methods (i.e., ELF). Information about the acceleration of the code is also included in the present work, being noticeable the reduction of wall-time calculation and the error calculation between versions.
METHODS: KLD was designed to be easy to use, extend, and maintain; thus, many principles of modern software development, extensive testing, and package management were adopted. The latest version of the KLD program was created utilizing the Compute Unified Device Architecture (CUDA) version, which allows it to use the computational capacity of NVIDIA Graphics Processing Units (GPUs) for processing purposes. The electron-pair conditional density was calculated from the canonical molecular orbitals obtained at the HF/6-31G(2df,p) level, or alternatively the natural orbitals in the case of explicit correlated wavefunctions computed at the MP2/6-31G(2df,p)//HF/6-31G(2df,p) level.

Indexes for estimating the overall reliability of a test in the framework of knowledge space theory (KST) are proposed and analyzed. First, the possibility of applying in KST the existing classical test theory (CTT) methods, based on the ratio between the true score variance and the total variance of the measure, has been explored. However, these methods are not suitable because in KST error and true score are not independent. Therefore, two new indexes based on the concepts of entropy and conditional entropy are developed. One index is used to estimate the reliability of the response pattern given the knowledge state, while the second one refers to the reliability of the estimated knowledge state of a person. Some theoretical considerations as well as simulations and an empirical example on real data are provided within a study of the behavior of these indexes under a certain number of different conditions.

We study stochastic linear contextual bandits (CB) where the agent observes a noisy version of the true context through a noise channel with unknown channel parameters. Our objective is to design an action policy that can \"approximate\" that of a Bayesian oracle that has access to the reward model and the noise channel parameter. We introduce a modified Thompson sampling algorithm and analyze its Bayesian cumulative regret with respect to the oracle action policy via information-theoretic tools. For Gaussian bandits with Gaussian context noise, our information-theoretic analysis shows that under certain conditions on the prior variance, the Bayesian cumulative regret scales as O˜(mT), where m is the dimension of the feature vector and T is the time horizon. We also consider the problem setting where the agent observes the true context with some delay after receiving the reward, and show that delayed true contexts lead to lower regret. Finally, we empirically demonstrate the performance of the proposed algorithms against baselines.

The remarkable signal-detection capabilities of the auditory and vestibular systems have been studied for decades. Much of the conceptual framework that arose from this research has suggested that these sensory systems rest on the verge of instability, near a Hopf bifurcation, in order to explain the detection specifications. However, this paradigm contains several unresolved issues. Critical systems are not robust to stochastic fluctuations or imprecise tuning of the system parameters. Further, a system poised at criticality exhibits a phenomenon known in dynamical systems theory as critical slowing down, where the response time diverges as the system approaches the critical point. An alternative description of these sensory systems is based on the notion of chaotic dynamics, where the instabilities inherent to the dynamics produce high temporal acuity and sensitivity to weak signals, even in the presence of noise. This alternative description resolves the issues that arise in the criticality picture. We review the conceptual framework and experimental evidence that supports the use of chaos for signal detection by these systems, and propose future validation experiments.

暂无摘要。