Context-sensitive behavior can be modeled by enriching an internal state, by allowing a response rule to access context directly, or by preserving a shared state while introducing an auxiliary criterion or control variable. This paper isolates an information-theoretic constraint on the third architecture. Let $C$ denote context, $S$ a candidate internal or latent state, $O$ an observable response, and $M$ an auxiliary variable such that $O\perp C\mid(S,M)$. Then \[ I(C;O\mid S)\le I(C;M\mid S)\le H(M\mid S). \] Once a shared state has been specified, residual context dependence in behavior therefore lower-bounds both the context information and the conditional entropy that an auxiliary context-mediating mechanism must carry. The bound is representation-relative rather than a measure of state-space size or a universal contextuality measure. A worked recognition-memory example shows how the quantity can be computed for payoff-induced criterion shifts and compared across alternative representational allocations. Ontological contextuality and quantum probability are treated as a separate specialization rather than as prerequisites for the cognitive interpretation. More broadly, the framework provides a basis for analyzing context-memory-control trade-offs in cognitive models and artificial agents that must maintain coherent behavior across changing contexts under bounded internal representations.
This work derives why interference can lower measured capacity by reducing single-binding recall even when the load-dependent recall profile is unchanged, and characterize capacity at the model's query interface.
Manas Venkata Sai Ravulapalli, Samrath Singh Chadha· 0 citations
We study infinite-horizon average-reward constrained Markov decision processes (CMDPs) under the weakly communicating assumption. Existing high-probability guarantees for this setting either require computationally inefficient algorithms or have suboptimal dependence on the number of interactions $T$. We propose, to th...
We introduce LimiX-2, a new model in the LimiX family, developed through model and data scaling guided by our previously established scaling laws. LimiX-2 adopts the Contextual Mechanism Networks (CMNs) paradigm and is pretrained with Context-Conditional Masked Modeling (CCMM). CMNs shifts the organizing principle of i...
Xing-Xuan Zhang, Gang Ren, Hao Yuan et al.· 5 citations
A scalable model-free actor--critic algorithm is proposed, establishing finite-sample critic and near-stationarity guarantees for a linear LSTD critic and a more expressive neural TD parameterization is introduced.
Salah Chikhi, A. Chaoui, A. Ozdaglar et al.· 0 citations
SLP-ProbHard is introduced, a cross-family, representation-centered framework for probabilistic hard-constrained learning when explicit structural parameterizations are available, and how feasible coordinates and maps affect stochastic dimension, dependence, calibration, expressiveness, and computation is studied.
OAttention alone does not preserve a NULL state through ordinary host components, whereas the OTransformer path does, and a two-block ablation shows that OAttention alone does not preserve a NULL state through ordinary host components, whereas the OTransformer path does.
Known for his clear and elegant writing style, Bertsekas shaped fields from control and optimization to large-scale computation and artificial intelligence.