arXiv subjects

Veronique Ziegler

Publications and source records attributed to Veronique Ziegler.

6 recordsLinked to original sources

arXiv2026

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

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.

cs.AI↗

arXiv2026

When Regulation Has Memory: Hysteresis and Control Burden in Artificial Agency

Adaptive agents are usually judged by what they do, but an agent can appear stable while the internal effort required to keep it stable is increasing. This hidden regulatory burden matters for artificial agents operating under noise, delay, or changing demands: two systems may reach similar internal states while one requires much more corrective control to get there. Here, we study whether that burden depends on history. Using a computational model of adaptive uncertainty regulation, we drive an artificial agent through a continuous change in its uncertainty target and then reverse the change without resetting the agent. This creates a simple test for carryover: does the controller respond only to the current target, or does the path by which the agent reached that target still matter? The simulations show a clear history-dependent effect. The adaptive gain required to regulate the agent forms a reproducible hysteresis loop, meaning that the same target can require different levels of control depending on whether the agent is moving toward or returning from a more demanding regime. The timing of regulation also matters. When stabilization is available before disturbance exposure, the agent generally requires less adaptive gain than when it can only recover after disturbance has already acted. The state-level coherence measure also shows path dependence, but the timing effect is much clearer in regulatory gain. The main difference is therefore not that anticipatory regulation produces a completely different state. Rather, it reaches comparable regulated behavior with lower modeled control demand. These 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.

cs.AI↗

arXiv2026

IRAM-Omega-Q: A Computational Framework for Uncertainty Regulation in Adaptive Agents

Adaptive agents operating under uncertainty must do more than optimize task outputs: they must maintain a workable internal state under noise, perturbation, and changing conditions. This paper introduces IRAM-Omega-Q, a computational framework for modeling uncertainty regulation in adaptive agents under stochastic disturbance. The framework combines a quantum-like state representation with closed-loop adaptive control over an internal entropy signal. The quantum-like formalism is used instrumentally: the evolving state is a normalized complex amplitude vector, coherent evolution is propagated exactly as psi(t + Delta t) = exp(-i H Delta t) psi(t), and a derived density matrix supports entropy and coherence-gap analysis. Two causal control orderings are compared. In regulation-first (RF) ordering, adaptive regulation is available before current-cycle disturbance and attenuates incoming exposure; in disturbance-first (DF) ordering, current-cycle disturbance is received before a new regulatory response can be computed, and stabilization acts reactively. Publication-mode, matched-seed simulations show broadly comparable coherence-gap trajectories but lower sustained adaptive gain under RF. Susceptibility maps based on post-burn-in temporal fluctuations further show that DF shifts the critical initial-gain ridge toward larger values across multiple disturbance intervals. These results identify ordering as an architectural determinant of regulatory demand and threshold location within an otherwise shared regime structure.

cs.AI↗

arXiv2022

CLAS12 Track Reconstruction with Artificial Intelligence

In this article we describe the implementation of Artificial Intelligence models in track reconstruction software for the CLAS12 detector at Jefferson Lab. The Artificial Intelligence based approach resulted in improved track reconstruction efficiency in high luminosity experimental conditions. The track reconstruction efficiency increased by $10-12\%$ for single particle, and statistics in multi-particle physics reactions increased by $15\%-35\%$ depending on the number of particles in the reaction. The implementation of artificial intelligence in the workflow also resulted in a speedup of the tracking by $35\%$.

physics.data-an↗

arXiv2022

Machine Learning in Nuclear Physics

Advances in machine learning methods provide tools that have broad applicability in scientific research. These techniques are being applied across the diversity of nuclear physics research topics, leading to advances that will facilitate scientific discoveries and societal applications. This Review gives a snapshot of nuclear physics research which has been transformed by machine learning techniques.

nucl-th↗

arXiv1994

Using Gauge Coupling Unification and Proton Decay to Test Minimal Supersymmetric SU(5)

We derive a one-loop expression, including all thresholds, for the mass of the proton decay mediating color triplets, $M_{D^c}$, in minimal supersymmetric SU(5). The result for $M_{D^c}$ does not depend on other heavy thresholds or extra representations with SU(5) invariant masses which might be added to the minimal model. We numerically correct our result to two-loop accuracy. Choosing inputs to maximize $M_{D^c}$ and $τ_P$, within experimental limits on the inputs and a $1~TeV$ naturalness bound, we derive a strict bound $α_3>0.117$. We discuss how this bound will change as experimental limits improve. Measurements of $α_3$ from deep inelastic scattering and the charmonium spectrum are below the bound $α_3>0.117$ by more than $3σ$. We briefly review several ideas of how to resolve the discrepancy between these low values of $α_3$ and the determinations of $α_3$ from LEP event shapes.

hep-ph↗