Intermittent Control Is Not Diluted Control: A Switching Effect in Artificial Agency

• URL: http://arxiv.org/abs/2607.17432v1
• Date: Sun, 19 Jul 2026 22:51:44 GMT
• Title: Intermittent Control Is Not Diluted Control: A Switching Effect in Artificial Agency
• Abstract summary: A simple expectation is that an agent moving between these conditions should behave like a weighted average of the two fixed cases.<n>This paper shows that expectation can fail.<n>In a simulated adaptive agent with retained state history, intermittent access to anticipatory control reduces regulatory burden.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Adaptive agents do not always regulate under the same timing conditions. Sometimes stabilization can begin before a disturbance has fully entered the internal state; at other times the agent can only recover after disruption has taken hold. A simple expectation is that an agent moving between these conditions should behave like a weighted average of the two fixed cases: the more time spent in reactive recovery, the greater the regulatory burden. This paper shows that expectation can fail. In a simulated adaptive agent with retained state history, at an operating point where sustained reactive control is more costly than sustained anticipatory control, intermittent access to anticipatory control reduces the mean regulatory burden below the value predicted by a fixed-mode mixture. The effect appears under both periodic and stochastic switching schedules: losing anticipatory access does not simply dilute its benefit, and restoring it intermittently can reorganize the later regulatory burden. High-statistics runs (N = 1000 matched replicates per schedule) resolve a negative nonlinear switching penalty across every tested schedule. The effect is small but consistent: about half a percent of the mean gain, with 63-68% of replicates falling below zero. Late-window diagnostics reveal no unresolved upward accumulation of regulatory burden. The result identifies a design-relevant timing principle. In history-dependent adaptive systems, the burden of remaining organized is not set only by how much time an agent spends in each mode; the order in which disturbance and recovery enter the state can change the subsequent burden. Intermittent anticipatory control may therefore act less like a partial failure of regulation than like a mechanism for reducing the long-term burden of recovery.

Related papers

• One Gate Is Not Enough: Composing Stateful Pre-Action Controls for Agentic AI [0.0]
  We show that a remediation applied by one control can change the action, evidence, or context another control evaluates, invalidating that control's earlier judgment.<n>We formalize this coupling and give a remediate-and-regate protocol that restores per-action soundness in the current bounded, idempotent setting.<n>This is a mechanism demonstration on open payload data with a synthetic metadata layer, not a claim about production prevalence.
  arXiv  Detail & Related papers  (2026-08-18T22:24:44Z)
• Residual Dominance as a Structural Account of Last-Item Reliance in Causal Self-Attention Recommenders [47.8060666024071]
  We show that SASRec-style models exhibit highly localized last-item reliance.<n>We then find that residual addition sharply shifts the full-block representation toward same-position contributions.<n>Changing the residual strength induces a monotonic trade-off between structural mixing and last-item reliance.
  arXiv  Detail & Related papers  (2026-08-14T07:09:58Z)
• Verification of Adaptive Agentic Controllers through Finite Rule Revision [0.0]
  This paper formulates a bounded verification protocol for adaptive agentic controllers represented by finite symbolic rules.<n> diagnostic failures are mapped to predefined rule-level edits, including rule addition, rule deletion, and priority revision.<n> repaired controllers are then evaluated on held-out simulation seeds or cloned initial states.
  arXiv  Detail & Related papers  (2026-07-07T13:38:01Z)
• When Regulation Has Memory: Hysteresis and Control Burden in Artificial Agency [0.0]
  Two systems may reach similar internal states while one requires much more corrective control to get there.<n>Using a computational model of adaptive uncertainty regulation, we study whether that burden depends on history.<n>Results suggest that adaptive agents should be evaluated not only by whether they remain organized, but by how much regulation they must recruit to do so.
  arXiv  Detail & Related papers  (2026-06-29T23:19:26Z)
• Delayed Verification Destabilizes Multi-Agent LLM Belief: Instability Thresholds and Optimal Corrector Placement [0.0]
  Multi-agent large language model (LLM) systems often rely on verifier and critic agents to suppress hallucinations.<n>During this delay, false claims can propagate through the agent network.<n>We model this process as delayed consensus on a graph with grounded corrector nodes.
  arXiv  Detail & Related papers  (2026-06-25T10:52:54Z)
• Authority-Level Priors: An Under-Specified Constraint in Hierarchical Predictive Processing [0.0]
  Authority-Level Priors (ALPs) are meta-structural constraints defining a regulatory-admissible subset of identity-level hypotheses.<n>ALPs are not additional representational states nor hyperpriors over precision; they constrain which hypotheses are admissible for regulatory control.<n>A computational formalisation restricts policy optimisation to policies generated by authorised hypotheses.
  arXiv  Detail & Related papers  (2026-03-19T13:27:47Z)
• Improving Search Agent with One Line of Code [68.58667107354253]
  Tool-based Agentic Reinforcement Learning (TARL) has emerged as a promising paradigm for training search agents to interact with external tools.<n>We propose textbfSearch textbfAgent textbfPolicy textbfOptimization (textbfSAPO), which stabilizes training via a conditional token-level KL constraint.
  arXiv  Detail & Related papers  (2026-03-10T04:07:39Z)
• Diffusion Controller: Framework, Algorithms and Parameterization [54.82539154511621]
  We present a unified control-theoretic view that casts reverse diffusion sampling as state-only control within (generalized) linearly-solvable Markov Decision Processes.<n>Under this framework, control acts by reweighting the pretrained reverse-time transition kernels, balancing terminal objectives against an $f$-divergence cost.<n>Experiments on Stable Diffusion v1.4 show consistent gains in preference-alignment win rates and improved quality-efficiency trade-offs.
  arXiv  Detail & Related papers  (2026-03-07T01:49:59Z)
• WS-GRPO: Weakly-Supervised Group-Relative Policy Optimization for Rollout-Efficient Reasoning [67.45237332694025]
  Group Relative Policy Optimization is effective for training language models on complex reasoning.<n>We propose Weakly Supervised GRPO, which improves rollout efficiency by converting terminal rewards into correctness-aware guidance.
  arXiv  Detail & Related papers  (2026-02-19T02:43:35Z)
• Accelerating Multi-modal LLM Gaming Performance via Input Prediction and Mishit Correction [4.323124094061299]
  Real-time sequential control agents are often bottlenecked by inference latency.<n>We propose a framework that adapts the predict-then-verify philosophy of speculative execution to model-based control with TD-MPC2.<n>We show that our method reduces the number of planning inferences from 500 to 282, improves end-to-end step latency by 25 percent, and maintains strong control performance with only a 7.1 percent return reduction.
  arXiv  Detail & Related papers  (2025-12-19T05:34:52Z)
• Efficient Reinforcement Learning with Impaired Observability: Learning to Act with Delayed and Missing State Observations [92.25604137490168]
  This paper introduces a theoretical investigation into efficient reinforcement learning in control systems. We present algorithms and establish near-optimal regret upper and lower bounds, of the form $tildemathcalO(sqrtrm poly(H) SAK)$, for RL in the delayed and missing observation settings.
  arXiv  Detail & Related papers  (2023-06-02T02:46:39Z)
• Forecasting Particle Accelerator Interruptions Using Logistic LASSO Regression [62.997667081978825]
  Unforeseen particle accelerator interruptions, also known as interlocks, lead to abrupt operational changes despite being necessary safety measures. We propose a simple yet powerful binary classification model aiming to forecast such interruptions. The model is formulated as logistic regression penalized by at least absolute shrinkage and selection operator.
  arXiv  Detail & Related papers  (2023-03-15T23:11:30Z)

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.