Predictive Allostatic Organization in Recurrent and Spiking Agents Under Partial Observability

• URL: http://arxiv.org/abs/2608.11506v1
• Date: Tue, 11 Aug 2026 23:40:14 GMT
• Title: Predictive Allostatic Organization in Recurrent and Spiking Agents Under Partial Observability
• Abstract summary: We test whether recurrent and spiking agents develop internal states with corresponding computational properties.<n>We interpret this pattern as a computational analogue of predictive allostatic organization.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Adaptive behavior under partial observability depends on internal organization that carries information beyond the current observation. Drawing on Barrett and Miller's account of categorization as predictive, compressive, functionally organized, and allostatically constrained, we test whether recurrent and spiking agents develop internal states with corresponding computational properties. Agents operate in an energy-constrained foraging task requiring resource acquisition, threat avoidance, contact-dependent consumption, and regulation of an internal energy variable. In a frozen benchmark, learned agents outperform random and heuristic baselines; the trace-augmented recurrent policy is strongest overall, while spiking variants show stress-specific differences. Early internal dynamics predict later full-safe-efficient success above permutation baseline, reaching a maximum ROC-AUC of 0.802. Reduced PCA subspaces retain behaviorally relevant information. Feature-family controls show that predictive signal is distributed across trace, policy-head, internal-dynamics, observation, and allostatic variables, and low-energy state remains strongly decodable after explicit energy-related features are removed. Evaluation-time perturbations to temporal state, sensory information, operating conditions, and allostatic mechanisms alter behavior and/or internal prediction. Seed-balanced event probes show weaker but measurable information about future contact, successful consumption, and threat events, alongside strong low-energy decoding. We interpret this pattern as a computational analogue of predictive allostatic organization: distributed control regimes that are predictive, energy-sensitive, action-relevant, and partly causally involved, without claiming biological validation or discrete symbolic categories.

Related papers

• Emergent Latent-State Computation under Stochastic Volatility [3.8881341075549947]
  We study how models internally represent latent dynamics under noisy, partially observed observations.<n>Across architectures, losses, and output heads, we find evidence for a two-stage computation.<n>These results suggest that volatility models provide a useful benchmark for interpretability under noisy latent dynamics and partial observability.
  arXiv  Detail & Related papers  (2026-07-28T08:49:48Z)
• Structured Fluctuations and the Information Dynamics of Self-Maintenance in Growing Neural Cellular Automata [0.7498027847107155]
  Growing Neural Cellular Automata (GNCA) are capable of robust self-maintenance and self-repair.<n>We show that internal fluctuations serve as a functional component supporting information flow, coordination, and return toward an attracting recurrent state.
  arXiv  Detail & Related papers  (2026-07-14T06:23:20Z)
• Monitoring the Internal Monologue: Probe Trajectories Reveal Reasoning Dynamics [42.27928681606673]
  Large Reasoning Models (LRMs) introduce new opportunities for safety monitoring through their Chain of Thought (CoT) reasoning.<n>We investigate the hidden representations of LRMs to determine whether future behavior can be predicted from prompt and CoT representations.<n>We find that future model behavior is more distinguishable when examined over the full trajectory than from a single static prediction.
  arXiv  Detail & Related papers  (2026-05-18T15:29:04Z)
• Mitigating Error Amplification in Fast Adversarial Training [58.74042726356826]
  Fast Adversarial Training (FAT) has proven effective in enhancing model robustness by encouraging networks to learn perturbation-invariant representations.<n>FAT often suffers from catastrophic overfitting (CO), where the model overfits to the training attack and fails to generalize to unseen ones.<n>We propose a Distribution-aware Dynamic Guidance (DDG) strategy that dynamically adjusts both the perturbation budget and supervision signal.
  arXiv  Detail & Related papers  (2026-04-27T11:23:18Z)
• Cognitive Friction: A Decision-Theoretic Framework for Bounded Deliberation in Tool-Using Agents [0.0]
  Unconstrained tool-using agents must decide which information source to query and act on.<n>We propose the Triadic Cognitive Architecture (TCA), a decision-theoretic framework that formalizes these failure modes via cognitive friction.<n>We validate TCA in two controlled environments designed to isolate stopping quality, action selection under congestion, and temporal urgency.
  arXiv  Detail & Related papers  (2026-03-31T17:30:25Z)
• On the Structural Non-Preservation of Epistemic Behaviour under Policy Transformation [51.56484100374058]
  We formalise such information-conditioned interaction patterns as behavioural dependency.<n>This induces a probe-relative notion of $$-behavioural equivalence and a within-policy behavioural distance.<n>Results identify structural conditions under which probe-conditioned behavioural separation is not preserved under common policy transformations.
  arXiv  Detail & Related papers  (2026-02-24T22:55:21Z)
• When Evaluation Becomes a Side Channel: Regime Leakage and Structural Mitigations for Alignment Assessment [0.0]
  Safety evaluation for advanced AI systems assumes that behavior observed under evaluation predicts behavior in deployment.<n>We recast alignment evaluation as a problem of information flow under partial observability.<n>We study regime-blind mechanisms, training-time interventions that restrict access to regime cues.
  arXiv  Detail & Related papers  (2026-02-09T10:00:24Z)
• When Benign Inputs Lead to Severe Harms: Eliciting Unsafe Unintended Behaviors of Computer-Use Agents [90.05202259420138]
  Unintended computer-use agents can deviate from expected outcomes even under benign input contexts.<n>We introduce the first conceptual and methodological framework for unintended CUA behaviors.<n>We propose AutoElicit: an agentic framework that iteratively perturbs benign instructions using CUA execution feedback.
  arXiv  Detail & Related papers  (2026-02-09T03:20:11Z)
• Emergence of Internal State-Modulated Swarming in Multi-Agent Patch Foraging System [0.5753241925582826]
  Active particles are entities that sustain persistent out-of-equilibrium motion by consuming energy.<n>While performing non-cooperative foraging tasks, the emergence of such swarming behavior in foragers has been attributed to the partial observability of the environment.<n>We show the emergence of swarming in the form of aggregation among the foragers when resource patches are absent.
  arXiv  Detail & Related papers  (2025-10-14T08:50:18Z)
• Allostatic Control of Persistent States in Spiking Neural Networks for perception and computation [79.16635054977068]
  We introduce a novel model for updating perceptual beliefs about the environment by extending the concept of Allostasis to the control of internal representations.<n>In this paper, we focus on an application in numerical cognition, where a bump of activity in an attractor network is used as a spatial numerical representation.
  arXiv  Detail & Related papers  (2025-03-20T12:28:08Z)
• Neural Interaction Energy for Multi-Agent Trajectory Prediction [55.098754835213995]
  We introduce a framework called Multi-Agent Trajectory prediction via neural interaction Energy (MATE) MATE assesses the interactive motion of agents by employing neural interaction energy. To bolster temporal stability, we introduce two constraints: inter-agent interaction constraint and intra-agent motion constraint.
  arXiv  Detail & Related papers  (2024-04-25T12:47:47Z)
• Stochastically forced ensemble dynamic mode decomposition for forecasting and analysis of near-periodic systems [65.44033635330604]
  We introduce a novel load forecasting method in which observed dynamics are modeled as a forced linear system. We show that its use of intrinsic linear dynamics offers a number of desirable properties in terms of interpretability and parsimony. Results are presented for a test case using load data from an electrical grid.
  arXiv  Detail & Related papers  (2020-10-08T20:25:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.