Searcharxiv⌕ Search

arXiv subjects

Yukio-Pegio Gunji

Publications and source records attributed to Yukio-Pegio Gunji.

13 recordsLinked to original sources

Surprise Reduction and Nullification in Bayesian and Inverse Bayesian Inference under Ambiguous Prediction-Error Attribution

In non-stationary environments, prediction errors may signal environmental change or transient outliers, and adaptive systems must track such changes without overreacting to outliers. We distinguish surprise reduction, which updates beliefs to fit observations, from surprise nullification, which weakens constraints imposed by the predictive structure, and formalize both within Bayesian and inverse Bayesian (BIB) inference. Belief and likelihood updates are derived from variational objectives sharing a nullification strength, determined endogenously by minimizing surprise under the candidate post-update predictive distribution. In the Gaussian case, nullification expands belief and likelihood variances by a common factor relative to standard Bayesian updating, leaving the ratio unchanged. BIB thus defers attribution of the prediction error, committing to neither latent-state change nor observation-process uncertainty. The nullification strength is carried over as a candidate and is maintained or released according to the predictive surprise of the next observation. In a mean estimation task with outliers and changepoints, no scanned parameter setting of a Sage-Husa-type adaptive Kalman filter, fixed-strength BIB variant, or belief-forgetting-only variant outperforms BIB in both changepoint tracking and post-outlier stability. An oracle-informed reduced Bayesian model tracks changepoints better but is less stable after outliers. Although BIB maintains no explicit hypotheses about changepoints or outliers, it generates event-dependent dynamics. The learning rate increases after changepoints, whereas after outliers, nullification is released, and this increase is suppressed. Deferring attribution and letting subsequent observations differentiate the responses may constitute a principle of adaptive inference in non-stationary environments.

stat.ME↗

Internal-state criticality in Bayesian-inverse-Bayesian inference

We propose Bayesian-inverse-Bayesian (BIB) inference in repeated games as a minimal generative model linking Bayesian inference, statistical mechanics, and heavy-tailed statistics. As a concrete instantiation we simulate repeated $N$-hand cyclic-dominance rock-paper-scissors, a discrete setting in which Nash-targeting algorithms collapse to uniform random play, so that any non-trivial dynamics must originate internally. Across a multi-axis sweep of design, window, and opponent conditions, the BIB dynamics remain in the same internal critical state, the argmax-persistence distribution staying a heavy-tailed power law with exponent $α\approx 1.43$ at the canonical window. Along the window and alphabet axes the exponent is not constant but drifts toward the universal $3/2$ as the finite-sample residual $(N-1)/(2m)$ vanishes. Bayes-only inference, which lacks the inverse step, shows no analogous universality and no power law. Because the argmax and laminar observables are first-passage reads of one driftless log-posterior walk, what is robust across conditions is the critical, zero-drift state itself, evidenced by the cross-design data collapse rather than by any particular exponent value. The state is also invariant across the hypothesis count $N_h$, with the cutoff time and posterior spread obeying finite-size scaling. Adding an inverse-Bayesian relaxation step (hypothesis renewal) to ordinary Bayesian inference is by itself enough to render the dynamics critical, with no external parameter adjustment. Rather than self-organizing toward an absorbing state, BIB reaches criticality by continually reconstructing the hypothesis-space boundary, a mechanism complementary to self-organized criticality that makes the criticality robust across a natural parameter range.

cond-mat.stat-mech↗

Contextuality as a Left Adjoint: A Categorical Generation of Orthomodular Structure

Contextuality is widely regarded as a hallmark of quantum information, yet its structural origin is often obscured by probabilistic or operational formulations. In this work, we show that non-distributive orthomodular structure need not be postulated, but arises canonically as a left adjoint from classical Boolean contexts. We introduce a gluing functor that takes pairs of Boolean algebras and identifies only their minimal and maximal elements via a categorical pushout. The resulting lattice is orthomodular but generically non-distributive. We prove that this construction is left adjoint to a forgetful functor selecting Boolean subalgebras, thereby providing a free but constrained generation of quantum-logical structure from classical contexts. Furthermore, we demonstrate that the failure of this pushout to remain Boolean is equivalent to the absence of global sections in the sheaf-theoretic framework of Abramsky and Brandenburger. This establishes a precise correspondence between contextuality as a sheaf obstruction and non-distributivity as a colimit failure. Our results offer a categorical and lattice-theoretic reconstruction of contextuality that precedes probabilistic notions and clarifies the structural necessity of quantum logic in information-theoretic settings.

quant-ph↗

Adaptive Inference through Bayesian and Inverse Bayesian Inference with Symmetry-Bias in Nonstationary Environments

This study proposes the novel Bayesian and inverse Bayesian (BIB) inference framework that incorporates symmetry bias into the Bayesian updating process to perform both conventional and inverse Bayesian updates concurrently. Conventional Bayesian inference is constrained by a fundamental trade-off between adaptability to abrupt environmental changes and accuracy during stable periods. The BIB framework addresses this limitation by dynamically modulating the learning rate via inverse Bayesian updates, thereby enhancing adaptive flexibility. The BIB model was evaluated in a sequential estimation task involving observations drawn from a Gaussian distribution with a stochastically time-varying mean, where it exhibited spontaneous bursts in the learning rate during environmental transitions, transiently entering high-sensitivity states that facilitated rapid adaptation. This burst-relaxation dynamic serves as a mechanism for balancing adaptability and accuracy. Furthermore, avalanche analysis, detrended fluctuation analysis, and power spectral analysis revealed that the BIB system likely operates near a critical state-a property not observed in standard Bayesian inference. This suggests that the BIB model uniquely achieves a coexistence of computational efficiency and critical dynamics, resolving the adaptability-accuracy trade-off while maintaining scale-free behavior. These findings offer a new computational perspective on scale-free dynamics in natural systems and provide valuable insights for the design of adaptive inference systems in nonstationary environments.

stat.ME↗

Quantum-like Coherence Derived from the Interaction between Chemical Reaction and Its Environment

By uncovering the contrast between Artificial Intelligence and Natural-born Intelligence as a computational process, we define closed computing and open computing, and implement open computing within chemical reactions. This involves forming a mixture and invalidation of the computational process and the execution environment, which are logically distinct, and coalescing both to create a system that adjusts fluctuations. We model chemical reactions by considering the computation as the chemical reaction and the execution environment as the degree of aggregation of molecules that interact with the reactive environment. This results in a chemical reaction that progresses while repeatedly clustering and de-clustering, where concentration no longer holds significant meaning. Open computing is segmented into Token computing, which focuses on the individual behavior of chemical molecules, and Type computing, which focuses on normative behavior. Ultimately, both are constructed as an interplay between the two. In this system, Token computing demonstrates self-organizing critical phenomena, while Type computing exhibits quantum logic. Through their interplay, the recruitment of fluctuations is realized, giving rise to interactions between quantum logical subspaces corresponding to quantum coherence across different Hilbert spaces. As a result, spike waves are formed, enabling signal transmission. This occurrence may be termed quantum-like coherence, implying the source of enzymes responsible for controlling spike waves and biochemical rhythms.

cs.AI↗

A Simple Walk Model for Reproducing Power Laws in Human mobility

Identifying statistical patterns characterizing human trajectories is crucial for public health, traffic engineering, city planning, and epidemic modeling. Recent developments in global positioning systems and mobile phone networks have enabled the collection of substantial information on human movement. Analyses of these data have revealed various power laws in the temporal and spatial statistical patterns of human mobility. For example, jump size and waiting time distributions follow power laws. Zipf's law was also established for the frequency of visits to each location and rank. Relationship $S(t)\sim t^μ$ exists between time t and the number of sites visited up to that time t. Recently, a universal law of visitation for human mobility was established. Specifically, the number of people per unit area $ρ(r,f)$, who reside at distance r from a particular location and visit that location f times in a given period, is inversely proportional to the square of rf, i.e., $ρ(r,f) \propto (rf)^{-2}$ holds. The exploration and preferential return (EPR) model and its improved versions have been proposed to reproduce the above scaling laws. However, some rules that follow the power law are preinstalled in the EPR model. We propose a simple walking model to generate movements toward and away from a target via a single mechanism by relaxing the concept of approaching a target. Our model can reproduce the abovementioned power laws and some of the rules used in the EPR model are generated. These results provide a new perspective on why or how the scaling laws observed in human mobility behavior arise.

physics.soc-ph↗

Walk model that continuously generates Brownian walks to Lévy walks depending on destination attractiveness

The Lévy walk, a type of random walk characterized by linear step lengths that follow a power-law distribution, is observed in the migratory behaviors of various organisms, ranging from bacteria to humans. Notably, Lévy walks with power exponents close to two, also known as Cauchy walks, are frequently observed, though their underlying causes remain elusive. This study proposes a walk model in which agents move toward a destination in multi-dimensional space and their movement strategy is parameterized by the extent to which they pursue the shortest path to the destination. This parameter is taken to represent the attractiveness of the destination to the agents. Our findings reveal that if the destination is very attractive, agents intensively search the area around it using Brownian walks, whereas if the destination is unattractive, they explore a distant region away from the point using Lévy walks with power exponents less than two. In the case where agents are unable to determine whether the destination is attractive or unattractive, Cauchy walks emerge. The Cauchy walker searches the region with a probability inversely proportional to the distance from the destination. This suggests that it preferentially searches the area close to the destination, while concurrently having the potential to extend the search area much further. Our model, which can change the search method and search area depending on the attractiveness of the destination, has the potential to be utilized for exploring the parameter space of optimization problems.

cs.MA↗

Extending the Bayesian Framework from Information to Action

In this review, we examine an extended Bayesian inference method and its relation to biological information processing. We discuss the idea of combining two modes of Bayesian inference. The first is the standard Bayesian inference, which contracts probability space. The second is its inverse, which extends and enriches the probability space of latent and observable variables. Their combination has been observed that, greatly, facilitates discovery. Moreover, this dual search during the updating process elucidates a crucial difference between biological and artificial information processing. The latter is restricted due to nonlinearities, while the former utilizes it. This duality is ubiquitous in biological information process dynamics (`flee-or-fight', `explore-or-exploit' etc.) as is the role of fractality and chaos in its underlying nonequilibrium, nonlinear dynamics. We also propose a new experimental set up that stems from testing these ideas.

stat.OT↗

Probabilistic Logic Gate in Asynchronous Game of Life with Critical Property

Metaheuristic and self-organizing criticality (SOC) could contribute to robust computation under perturbed environments. Implementing a logic gate in a computing system in a critical state is one of the intriguing ways to study the role of metaheuristics and SOCs. Here, we study the behavior of cellular automaton, game of life (GL), in asynchronous updating and implement probabilistic logic gates by using asynchronous GL. We find that asynchronous GL shows a phase transition, that the density of the state of 1 decays with the power law at the critical point, and that systems at the critical point have the most computability in asynchronous GL. We implement AND and OR gates in asynchronous GL with criticality, which shows good performance. Since tuning perturbations play an essential role in operating logic gates, our study reveals the interference between manipulation and perturbation in probabilistic logic gates.

cs.AI↗

Quantum Cognition based on an Ambiguous Representation Derived from a Rough Set Approximation

Over the last years, in a series papers by Arrechi and others, a model for the cognitive processes involved in decision making has been proposed and investigated. The key element of this model is the expression of apprehension and judgement, basic cognitive process of decision making, as an inverse Bayes inference classifying the information content of neuron spike trains. For successive plural stimuli, it has been shown that this inference, equipped with basic non-algorithmic jumps, is affected by quantum-like characteristics. We show here that such a decision making process is related consistently with ambiguous representation by an observer within a universe of discourse. In our work ambiguous representation of an object or a stimuli is defined by a pair of maps from objects of a set to their representations, where these two maps are interrelated in a particular structure. The a priori and a posteriori hypotheses in Bayes inference are replaced by the upper and lower approximation, correspondingly, for the initial data sets each derived with respect to a map. We show further that due to the particular structural relation between the two maps, the logical structure of such combined approximations can only be expressed as an orthomodular lattice and therefore can be represented by a quantum rather than a Boolean logic. To our knowledge, this is the first investigation aiming to reveal the concrete logic structure of inverse Bayes inference in cognitive processes.

q-bio.NC↗

Self-Organized Criticality in Asynchronously Tuned Elementary Cellular Automata

Self-organized criticality (SOC) reveals a mechanism by which a system is autonomously evolved to be in a critical state without needing parameter tuning. Whereas various biological systems are found to be in critical states and the significance of SOC is being re-estimated, a simple model in a general platform has not been established. Here, we present SOC in asynchronously tuned elementary cellular automata (ECA), which was based on asynchronously updating and tuning the consistency between local dual modes of transitions. This duality was defined by adjunction, which can be ignored during synchronous updates. Duality coupled with asynchronous updating can demonstrate that SOC coincides with the criticality in a phase transition of asynchronous ECA with respect to density decay.

nlin.CG↗

On Creativity of Slime Mould

Slime mould Physarum polycephalum is large single cell with intriguingly smart behaviour. The slime mould shows outstanding abilities to adapt its protoplasmic network to varying environmental conditions. The slime mould can solve tasks of computational geometry, image processing, logics and arithmetics when data are represented by configurations of attractants and repellents. We attempt to map behavioural patterns of slime onto the cognitive control versus schizotypy spectrum phase space and thus interpret slime mould's activity in terms of creativity.

cs.ET↗

Robust Soldier Crab Ball Gate

Soldier crabs Mictyris guinotae exhibit pronounced swarming behaviour. The swarms of the crabs tolerant of perturbations. In computer models and laboratory experiments we demonstrate that swarms of soldier crabs can implement logical gates when placed in a geometrically constrained environment.

cs.ET↗