Submitted:
29 November 2025
Posted:
02 December 2025
Read the latest preprint version here
Abstract
Keywords:
1. Introduction
2. Axioms
2.1. Structural Axioms (A1–A5)
2.2. Operational Meta-Axioms (A6–A8)
2.3. Structural–Operational Alignment
3. Theoretical Integration
4. Methodology
4.1. Structural Validation
4.2. Operational Validation
4.3. Cross-Axiom Coupling Analysis
4.4. Theoretical Alignment and External Consistency
4.5. Summary
5. Empirical and Computational Evaluation
5.1. Stability Analysis Under Reciprocal Interaction
- Convergence behavior: whether belief updating settles into a stable attractor when R ≥ τ.
- Perturbation sensitivity: whether small environmental shocks lead to bounded deviations when reciprocity is maintained.
- Regime collapse: whether R < τ systematically results in decoupling, unilateral divergence, or representational collapse.
5.2. Constraint-Satisfaction Performance
- Trajectory feasibility: the proportion of generated transitions satisfying Δx ∈ G.
- Boundary violation rate: the frequency with which agents attempt transitions outside the admissible manifold.
- Search space reduction: the extent to which enforcing G reduces the exploration domain to a compact and computationally tractable region.
5.3. Temporal Coherence and Long-Horizon Behavior
- Path regularity: cumulative measures of the smoothness of state transitions across timesteps.
- Catastrophic divergence rate: the frequency of trajectories that exit the valid representational space.
- Long-horizon variance: the dispersion of trajectory endpoints after a fixed horizon length.
5.4. Comparative Model Behavior
- Structural isomorphism: whether constrained agents exhibit behaviors qualitatively similar to those generated by models that explicitly enforce prediction-error minimization or related principles.
- Endogenous divergence: whether behavioral differences arise from the axiomatic structure of OCOF rather than from parameter tuning or ad hoc modifications.
- Robustness: whether OCOF-constrained agents maintain coherence across a wider range of noise levels and environmental irregularities than baseline models.
5.5. Evaluation Limitations
5.6. Summary
6. Formal Optimization Structure
6.1. State Representation and Structural Map
- Boundary Admissibility: Information crossing ∂Ω must preserve the distinction between internal and external states.
- Precision Boundedness: The weighting parameter β must remain finite (0 < β < ∞) under stochastic fluctuations to avoid singular updates.
- Semantic Injectivity: A minimal semantic separation ΔS > δ must be maintained to ensure distinct inputs generate distinct semantic updates.
- Policy Consistency: The policy function π(Xₜ) must produce well-defined transitions for adjacent states.
- Coherent Integration: The resulting representation must satisfy Xₜ ∈ Σ_global, ensuring global non-contradiction.
6.2. Operational Constraints
- Reciprocity Constraint (A6): Stable bidirectional exchange requires R ≥ τ.
- Geometric Constraint (A7): State transitions must satisfy Δx ∈ G, where G = { v | C(v) = 0 } defines a closed and bounded feasible manifold.
- Temporal Coherence Constraint (A8): Long-horizon consistency requires ‖Xₜ₊₁ − F(Xₜ)‖ ≤ ε for some allowable deviation ε.
6.3. Unified Objective: Minimal Divergence Under Constraint
- Eₜ represents prediction error or expected free energy.
- Ψ(R) is a penalty for insufficient reciprocity (active when R < τ).
- I(Δx ∉ G) is a characteristic indicator for manifold violations.
- ‖Xₜ₊₁ − F(Xₜ)‖ measures temporal deviation.
- λ₁, λ₂, λ₃ are weighting parameters ensuring each constraint influences the global objective.
6.4. Well-Posedness Conditions
- The feasible set D is non-empty and compact.
- The structural mapping Φ is continuous and locally Lipschitz.
- The evolution function F defines a stable dynamical rule.
- Reciprocity R varies smoothly with respect to interaction strength.
- The manifold G is a closed subset of ℝⁿ defined by regular constraints C(v) = 0.
6.5. Structural–Operational Interdependence
- Structural variables (∂Ω, β, ΔS, π) define the representational substrate.\
- Operational constraints (R, G, ε) restrict the permissible transitions within that substrate.
- Coherence arises only when structural updates remain within the admissible operational region .
7. Discussion and Implications
7.1. Conceptual Implications: The Structure–Operation Distinction
7.2. Relation to Predictive Processing and Control
- Axiomatic Minimalism:
- 2.
- Bidirectional Reciprocity:
- 3.
- Semantic Injectivity:
7.3. Implications for Synthetic Agents
- Reciprocity ($R$): A mechanism for regulating update rates in distributed or multi-agent systems.
- Constraint Geometry ($G$): A manifold-based filter for robotic state estimation, restricting inference to physically realizable subspaces.
- Temporal Coherence ($\epsilon$): A safeguard for long-horizon planning, preventing abrupt or adversarially induced deviations.
7.4. Implications for Cognitive Science
7.5. Limitations
- a particular learning rule,
- a representational format, or
- a biological substrate.
7.6. Future Directions
- Adaptive Constraints:
- Computational Instantiation:
- Cross-Domain Generalization:
8. Conclusions
Appendix A. Notation Summary
Appendix B. Structural Axioms (A1–A5)
Appendix C. Operational Axioms (A6–A8)
Appendix D. Unified Objective Function
References
- Amari, S. I. (2016). Information Geometry and Its Applications. Springer.
- Barlow, H. B. (1961). Possible principles underlying the transformation of sensory messages. In W. A. Rosenblith (Ed.), Sensory Communication (pp. 217–234). MIT Press.
- Battaglia, P. W., Hamrick, J. B., Bapst, V., Sanchez-Gonzalez, A., Zambaldi, V., Malinowski, M., ... & Pascanu, R. (2018). Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261.
- Bechhoefer, J. (2021). Control Theory for Physicists. Cambridge University Press.
- Bennett, C. H. (2003). Notes on Landauer’s principle, reversible computation, and Maxwell’s Demon. Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics, 34(3), 501–510. [CrossRef]
- Buckley, C. L., Kim, C. S., McGregor, S., & Seth, A. K. (2017). The free energy principle for action and perception: A mathematical review. Journal of Mathematical Psychology, 81, 55–79. [CrossRef]
- Clark, A. (2013). Whatever next? Predictive brains, situated agents, and the future of cognitive science. Behavioral and Brain Sciences, 36(3), 181–204. [CrossRef]
- Friston, K. (2010). The free-energy principle: A unified brain theory? Nature Reviews Neuroscience, 11(2), 127–138. [CrossRef]
- Friston, K., & Parr, T. (2018). Active inference and learning. Neuroscience & Biobehavioral Reviews, 68, 862–879. [CrossRef]
- Gibson, J. J. (1979). The Ecological Approach to Visual Perception. Houghton Mifflin.
- Hohwy, J. (2013). The Predictive Mind. Oxford University Press.
- Jaynes, E. T. (1957). Information theory and statistical mechanics. Physical Review, 106(4), 620–630. [CrossRef]
- Klyubin, A. S., Polani, D., & Nehaniv, C. L. (2005). Empowerment: A universal agent-centric measure of control. 2005 IEEE Congress on Evolutionary Computation, 1, 128–135.
- Koestler, A. (1967). The Ghost in the Machine. Hutchinson.
- Lake, B. M., Ullman, T. D., Tenenbaum, J. B., & Gershman, S. J. (2017). Building machines that learn and think like people. Behavioral and Brain Sciences, 40, e253. [CrossRef]
- Landauer, R. (1961). Irreversibility and heat generation in the computing process. IBM Journal of Research and Development, 5(3), 183–191. [CrossRef]
- LeCun, Y., Bengio, Y., & Hinton, G. (2015). Deep learning. Nature, 521(7553), 436–444. [CrossRef]
- Pezzulo, G., Rigoli, F., & Friston, K. (2018). Hierarchical active inference: A theory of motivated control. Trends in Cognitive Sciences, 22(4), 294–306. [CrossRef]
- Russell, S. (2019). Human Compatible: Artificial Intelligence and the Problem of Control. Viking.
- Seth, A. K. (2014). A predictive processing theory of sensorimotor contingencies: Explaining the puzzle of perceptual presence. Cognitive Neuroscience, 5(2), 97–118. [CrossRef]
- Shannon, C. E. (1948). A mathematical theory of communication. The Bell System Technical Journal, 27(3), 379–423. [CrossRef]
- Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., ... & Hassabis, D. (2017). Mastering the game of Go without human knowledge. Nature, 550(7676), 354–359. [CrossRef]
- Tishby, N., Pereira, F. C., & Bialek, W. (2000). The information bottleneck method. arXiv preprint physics/0004057.
- Wiskott, L., & Sejnowski, T. J. (2002). Slow feature analysis: Unsupervised learning of invariances. Neural Computation, 14(4), 715–770. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).