Do Enterprise Systems Need Learned World Models? The Importance of Context to Infer Dynamics

• URL: http://arxiv.org/abs/2605.12178v1
• Date: Tue, 12 May 2026 14:22:10 GMT
• Title: Do Enterprise Systems Need Learned World Models? The Importance of Context to Infer Dynamics
• Abstract summary: We show that offline-trained world models can perform well in-distribution but degrade as dynamics change, whereas discovery-based agents are more robust under shift.<n>Our findings suggest that, in enterprise environments, agents should not rely solely on fixed internalized dynamics, but should incorporate mechanisms for discovering relevant transition logic at runtime.
• Score: 16.09809323840653
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: World models enable agents to anticipate the effects of their actions by internalizing environment dynamics. In enterprise systems, however, these dynamics are often defined by tenant-specific business logic that varies across deployments and evolves over time, making models trained on historical transitions brittle under deployment shift. We ask a question the world-models literature has not addressed: when the rules can be read at inference time, does an agent still need to learn them? We argue, and demonstrate empirically, that in settings where transition dynamics are configurable and readable, runtime discovery complements offline training by grounding predictions in the active system instance. We propose enterprise discovery agents, which recover relevant transition dynamics at runtime by reading the system's configuration rather than relying solely on internalized representations. We introduce CascadeBench, a reasoning-focused benchmark for enterprise cascade prediction that adopts the evaluation methodology of World of Workflows on diverse synthetic environments, and use it together with deployment-shift evaluation to show that offline-trained world models can perform well in-distribution but degrade as dynamics change, whereas discovery-based agents are more robust under shift by grounding their predictions in the current instance. Our findings suggest that, in configurable enterprise environments, agents should not rely solely on fixed internalized dynamics, but should incorporate mechanisms for discovering relevant transition logic at runtime.

Related papers

• Quo Vadis, World Modeling? [116.2429173084643]
  Continually improving agents require dynamic interaction feedback beyond static supervision, yet direct real-environment interaction is costly, slow, unsafe, and hard to parallelize.<n>World modeling offers a natural intermediate proxy that allows agents to query lower-cost, more controllable feedback before committing to real actions.<n>This work recasts world modeling into an agent-centric paradigm, establishing a roadmap for building world proxies that empower agents to plan better, learn faster, and evolve continually.
  arXiv  Detail & Related papers  (2026-08-03T17:59:58Z)
• ScrambleToolBench: Agents Search Exhaustively Even When Their Own Map Points to the Next Step [74.83535434786145]
  We introduce ScrambleToolBench, an interactive terminal benchmark designed to isolate behavioral reasoning.<n>The benchmark requires agents to uncover hidden tool behaviors entirely through trial-and-error interaction.<n>Our evaluation of state-of-the-art language models reveals that successful initial discovery does not translate into robust adaptation.
  arXiv  Detail & Related papers  (2026-08-03T15:07:46Z)
• AgentStream: How Well Do Self-Evolving LLM Agents Perform Under Streaming Tasks? [65.05151983193441]
  Large language model (LLM) agents can self-evolve by continually improving from their own accumulated experience.<n>We introduce AgentStream, a unified framework that evaluates self-evolving agents spanning diverse evolution components.<n>Our results show that self-evolution reliability varies across streaming scenarios, the benefit of self-evolution is gated by model capability and non-monotonic in model strength.
  arXiv  Detail & Related papers  (2026-07-31T17:50:08Z)
• Can Agents Generalize to the Open World? Unveiling the Fragility of Static Training in Tool Use [14.813603277906623]
  We formalize OpenAgent, a problem setting characterized by distributional shifts across query, action, observation, and domain dimensions.<n>Our analysis yields a series of key insights, demonstrating that agents trained via both Supervised Fine-Tuning(SFT) and Reinforcement Learning suffer from varying degrees of performance degradation.<n>We propose Perturbation-Augmented Fine-Tuning, a disturbance-based intervention strategy for SFT that lays the foundation for enhancing agent robustness and utility in realistic environments.
  arXiv  Detail & Related papers  (2026-07-01T15:40:25Z)
• In-Context Learning Under Regime Change [23.94313447462402]
  Non-stationary sequences arise naturally in control, forecasting, and decision-making.<n>We formalize this as an in-context change-point detection problem and formally establish the existence of transformer models that solve this problem.<n>We show that encoding and incorporating changepoint knowledge indeed improves the real-world performance of a pretrained foundation models on infectious disease forecasting and on financial volatility forecasting around Federal Open Market Committee (FOMC) announcements without retraining.
  arXiv  Detail & Related papers  (2026-04-18T13:23:50Z)
• A Mechanistic Analysis of Transformers for Dynamical Systems [4.590170084532207]
  We study the representational capabilities and limitations of single-layer Transformers when applied to dynamical data.<n>For linear systems, we show that the convexity constraint imposed by softmax attention fundamentally restricts the class of dynamics that can be represented.<n>For nonlinear systems under partial observability, attention instead acts as an adaptive delay-embedding mechanism.
  arXiv  Detail & Related papers  (2025-12-24T11:21:07Z)
• Grounded Test-Time Adaptation for LLM Agents [75.62784644919803]
  Large language model (LLM)-based agents struggle to generalize to novel and complex environments.<n>We propose two strategies for adapting LLM agents by leveraging environment-specific information available during deployment.
  arXiv  Detail & Related papers  (2025-11-06T22:24:35Z)
• Neural Network Reprogrammability: A Unified Theme on Model Reprogramming, Prompt Tuning, and Prompt Instruction [57.19302613163439]
  We introduce neural network reprogrammability as a unifying framework for model adaptation.<n>We present a taxonomy that categorizes such information manipulation approaches across four key dimensions.<n>We also analyze remaining technical challenges and ethical considerations.
  arXiv  Detail & Related papers  (2025-06-05T05:42:27Z)
• Situationally-Aware Dynamics Learning [57.698553219660376]
  We propose a novel framework for online learning of hidden state representations.<n>Our approach explicitly models the influence of unobserved parameters on both transition dynamics and reward structures.<n>Experiments in both simulation and real world reveal significant improvements in data efficiency, policy performance, and the emergence of safer, adaptive navigation strategies.
  arXiv  Detail & Related papers  (2025-05-26T06:40:11Z)
• Transformers Use Causal World Models in Maze-Solving Tasks [49.67445252528868]
  We identify World Models in transformers trained on maze-solving tasks.<n>We find that it is easier to activate features than to suppress them.<n> positional encoding schemes appear to influence how World Models are structured within the model's residual stream.
  arXiv  Detail & Related papers  (2024-12-16T15:21:04Z)
• Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings [23.038187032666304]
  This paper introduces a new approach for continual planning and model learning in non-stationary environments. The proposed framework models gaps in the agent's current state of knowledge and uses them to conduct focused, investigative explorations. Empirical evaluations on several non-stationary benchmark domains show that this approach significantly outperforms planning and RL baselines in terms of sample complexity.
  arXiv  Detail & Related papers  (2024-02-13T00:50:06Z)
• Discovering group dynamics in coordinated time series via hierarchical recurrent switching-state models [5.250223406627639]
  We seek a computationally efficient model for a collection of time series arising from multiple interacting entities (a.k.a. "agents")<n>Recent models of temporal patterns across individuals fail to incorporate explicit system-level collective behavior that can influence the trajectories of individual entities.<n>We employ a latent system-level discrete state Markov chain that provides top-down influence on latent entity-level chains which in turn govern the emission of each observed time series.
  arXiv  Detail & Related papers  (2024-01-26T16:06:01Z)

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.