arXiv:2607. 21421v2 Announce Type: replace Abstract: Data-driven generative models can extend partially observed simulation trajectories into ensembles of alternative future scenarios.
arXiv:2607. 21421v1 Announce Type: new Abstract: Generative models can support decision-making under uncertainty by producing ensembles of plausible future system trajectories, but statistical plausibility does not ensure structural feasibility.
arXiv:2608. 08689v1 Announce Type: new Abstract: The state evolution of a complex system arises jointly from object laws, relational propagation, domain conservation, and unmodeled error.
arXiv:2606. 27780v1 Announce Type: new Abstract: World models are often used for planning by rolling learned dynamics forward.
The paper introduces LP‑BTS, a learning‑guided planning framework for mobile charging in large, dynamic action spaces. It uses a graph proposal policy to narrow candidate stops, a value critic to evaluate leaf nodes, and edge‑budgeted PUCT to compare short simulated futures before action selection. Experiments on a 30‑scenario battery‑life benchmark show LP‑BTS achieving the highest survival and alive‑AUC, outperforming domain‑engineered baselines and heuristic policies.
arXiv:2608.22421v1 Announce Type: new Abstract: World models predict action-conditioned futures and serve as critical internal simulators for downstream planning and control. However, catastrophic pr...
arXiv:2608. 07809v1 Announce Type: new Abstract: A world model is only useful for physical AI if it changes what the agent does, and only safe if it declines to do so when it is wrong.
arXiv:2609.20973v1 Announce Type: cross Abstract: Complex problem solving (CPS) with large language models (LLMs) is often framed as a matter of stronger reasoning or longer generation. Yet early-ste...
arXiv:2607. 23134v1 Announce Type: new Abstract: Discovering rare safety-critical failures in autonomous and cyber-physical systems is a fundamental challenge in verification and validation.
The monograph introduces Elimination Geometry (EG), a typed, native‑loss, audit‑oriented framework that investigates when locally optimal objects can be realized by a shared deployment rule. EG examines how elimination and compression can erase distinctions needed for prediction, inference, control, or representation, and it separates local solvability, global realizability, and finite‑sample certifiability. The work synthesizes tools from geometry, optimization, information theory, statistics, and machine learning to address regular, coordination, singular, compositional, and resource‑limited mechanisms, and demonstrates applications in sparse model selection, distribution‑free prediction, observational treatment policies, routed expert and retrieval systems, and learned score fields.
arXiv:2609.00002v1 Announce Type: new Abstract: World models enable language-model agents to predict environment dynamics and plan before acting. In text environments, the model must learn symbolic a...
arXiv:2606. 17529v1 Announce Type: cross Abstract: Scientific machine-learning (SciML) surrogates approximate expensive simulations, but exact expected outputs for arbitrary inputs are unavailable (the oracle problem).
arXiv:2607. 01767v1 Announce Type: new Abstract: As agent planning moves from short tool chains toward persistent workflows with thousands or tens of thousands of steps, failures will occur inside large planning graphs rather than in isolated predictions.