# Simulation

Simulation is dynamic modeling used to represent and evaluate a system under specified conditions.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## ScaleWire: An End-to-End Scale-Up Ethernet Simulation Framework for LLM Systems

DevFeed: [ScaleWire: An End-to-End Scale-Up Ethernet Simulation Framework for LLM Systems](<https://devfeed.tech/articles/scalewire-an-end-to-end-scale-up-ethernet-simulation-framework-for-llm-systems-146150.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26086>)

Author: Kai Ma, Quanfeng Lv, Bowei Dai, Jingguo Ge, Kefan Ruan, Ruoqi Li

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Ethernet](<https://devfeed.tech/topics/ethernet.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [AI Infrastructure](<https://devfeed.tech/topics/ai-infrastructure.md>)

Tags: [accelerators](<https://devfeed.tech/tags/accelerators.md>), [balance](<https://devfeed.tech/tags/balance.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [budget](<https://devfeed.tech/tags/budget.md>), [communication](<https://devfeed.tech/tags/communication.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [completion](<https://devfeed.tech/tags/completion.md>), [constraint](<https://devfeed.tech/tags/constraint.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [deepseek](<https://devfeed.tech/tags/deepseek.md>), [deepseek-r1](<https://devfeed.tech/tags/deepseek-r1.md>), [design](<https://devfeed.tech/tags/design.md>), [difference](<https://devfeed.tech/tags/difference.md>), [ethernet](<https://devfeed.tech/tags/ethernet.md>), [framework](<https://devfeed.tech/tags/framework.md>), [llm](<https://devfeed.tech/tags/llm.md>), [scale-up](<https://devfeed.tech/tags/scale-up.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [systems](<https://devfeed.tech/tags/systems.md>)

### AI overview

ScaleWire combines packet-level simulation of Ethernet network-interface mechanisms across transport, network, and link layers with analytical estimates to explore on-chip resource sizing for LLM systems. The authors report validation against hardware measurements and nine analytical checks, and evaluate six NI designs across four communication workloads. For DeepSeek-R1 dispatch, design choices produce a 4.5x difference in per-XPU storage budget; the exploration engine uses 6-19% as many simulations as exhaustive search in grid comparisons. With vLLM prefill traces and GH200-measured kernel times, it also guides resource provisioning under an inference completion-time constraint. The abstract positions the framework as a way to balance communication performance against resource cost.

### Source excerpt

arXiv:2611.26086v1 Announce Type: new Abstract: LLM training and inference rely on scale-up networks for high-bandwidth, low-latency memory-semantic communication among accelerators (XPUs). Ethernet is emerging as an open interconnect for scale-up systems. In Ethernet systems, network-interface (NI) mechanisms across transport, network, and link layers interact, jointly shaping communication performance and on-chip resource requirements. We present ScaleWire, an end-to-end scale-up Ethernet simulation framework for LLM systems. It couples packet-level simulation of cross-layer NI mechanisms with a resource exploration engine that combines analytical estimates and simulation to size on-chip resources. We validate ScaleWire against hardware measurements and nine analytical checks, and evaluate six NI designs across four LLM communication workloads. For DeepSeek-R1 dispatch, NI design choices lead to a 4.5$\times$ difference in per-XPU on-chip storage budget. In grid-comparison experiments, the exploration engine uses 6-19% of the simulations required by exhaustive search. Using vLLM prefill traces with kernel times measured on GH200 GPUs, ScaleWire further guides resource provisioning under a completion-time constraint for inference execution. ScaleWire thus helps designers select NI mechanisms and provision on-chip resources to balance communication performance and resource cost.

## Causal Overtaking in Fair Transaction Ordering

DevFeed: [Causal Overtaking in Fair Transaction Ordering](<https://devfeed.tech/articles/causal-overtaking-in-fair-transaction-ordering-146054.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26100>)

Author: Haozhe Feng, Di Wu, Jian Liu

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [ordering](<https://devfeed.tech/topics/ordering.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [causality](<https://devfeed.tech/topics/causality.md>), [Latency](<https://devfeed.tech/topics/latency.md>)

Tags: [attack](<https://devfeed.tech/tags/attack.md>), [aws](<https://devfeed.tech/tags/aws.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [latency](<https://devfeed.tech/tags/latency.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [mitigation](<https://devfeed.tech/tags/mitigation.md>), [model](<https://devfeed.tech/tags/model.md>), [network](<https://devfeed.tech/tags/network.md>), [ordering](<https://devfeed.tech/tags/ordering.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [transaction](<https://devfeed.tech/tags/transaction.md>)

### AI overview

The paper identifies causal overtaking in fair transaction ordering: corrupted replicas can submit identical signed copies of a responsive transaction through multiple client entries, letting their first arrivals collectively provide ordering support that no single path achieves. The authors formalize receipt-order protocols including Themis, characterize when the attack is feasible, and report that delayed gossip does not prevent it. Under their network model, opposite required transaction orders can yield identical receipt evidence, so receipt-only mechanisms cannot always preserve earlier-submission priority while preventing responsive overtaking. They propose a mitigation and evaluate the attack and mitigation on Themis using simulations driven by AWS and WonderProxy latency measurements; the abstract does not describe the mitigation's design.

### Source excerpt

arXiv:2611.26100v1 Announce Type: new Abstract: Fair transaction ordering protocols aim to mitigate front-running using replica-local arrival orders, but prior work often assumes a single submission origin for each responsive transaction. We identify causal overtaking, in which corrupted replicas observe a target and submit identical signed copies of a responsive transaction through multiple client entries. The copies' first arrivals at different replicas can collectively provide ordering support that no individual path achieves, allowing the response to execute before its target. We formalize a class of receipt-order protocols, including Themis, characterize the timing and network conditions under which the attack is feasible, and show that delayed gossip does not rule it out. We further prove that, under our network model, histories requiring opposite transaction orders can produce identical receipt evidence. Thus, receipt-only mechanisms cannot always preserve earlier-submission priority while preventing responsive overtaking. We propose a mitigation and analyze its assumptions and limitations. Finally, we evaluate the attack and mitigation on Themis through simulations driven by AWS and WonderProxy latency measurements.

## Variance-Adaptive Upper Confidence Bounds for Multi-Armed Bandits with Kaplan--Meier Survival Estimation

DevFeed: [Variance-Adaptive Upper Confidence Bounds for Multi-Armed Bandits with Kaplan--Meier Survival Estimation](<https://devfeed.tech/articles/variance-adaptive-upper-confidence-bounds-for-multi-armed-bandits-with-kaplan-meier-survival-estimation-144997.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24988>)

Author: Yangfan Cui, Andrew Papanicolaou

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [bandits](<https://devfeed.tech/tags/bandits.md>), [cancer](<https://devfeed.tech/tags/cancer.md>), [confidence-bounds](<https://devfeed.tech/tags/confidence-bounds.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [exploration](<https://devfeed.tech/tags/exploration.md>), [greenwood](<https://devfeed.tech/tags/greenwood.md>), [kaplan](<https://devfeed.tech/tags/kaplan.md>), [math-pr](<https://devfeed.tech/tags/math-pr.md>), [multi-armed-bandit](<https://devfeed.tech/tags/multi-armed-bandit.md>), [policy](<https://devfeed.tech/tags/policy.md>), [probability](<https://devfeed.tech/tags/probability.md>), [realtime](<https://devfeed.tech/tags/realtime.md>), [sequential-decision](<https://devfeed.tech/tags/sequential-decision.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [survival](<https://devfeed.tech/tags/survival.md>), [variance](<https://devfeed.tech/tags/variance.md>)

### AI overview

KM-UCB adapts upper confidence bounds to bandit decisions where rewards are survival probabilities at a fixed horizon and outcomes are right-censored event times. It uses a fixed-cohort empirical Bernstein bound parameterized by Greenwood's variance, addressing variation that Hoeffding-type bounds ignore. For real-time allocation, it retains the Greenwood index and reviews the recommended arm using a survival bound from completed records. Under catch-up reporting, the policy has logarithmic expected regret with an arm-specific variance term in the exploration bound. The abstract reports evaluation of the original policy in a delayed simulation and retrospective replay of breast cancer trial data, and a separate paired simulation for a correction.

### Source excerpt

arXiv:2611.24988v1 Announce Type: cross Abstract: We study the stochastic multi-armed bandit problem in which the reward associated with each arm is the survival probability at a pre-specified time horizon, and the observed outcome is a right-censored time-to-event variable. Standard bandit algorithms face delayed and partial observations in this setting. Prior adaptations for the Kaplan--Meier (KM) estimator rely on Hoeffding-type bounds that ignore the inherent heteroscedasticity of continuous survival processes. To bridge this gap, we propose KM-UCB, a variance-adaptive policy that unites continuous-time survival analysis with discrete sequential decision-making. By leveraging martingale theory and continuous influence functions, we derive a fixed-cohort empirical Bernstein bound parameterized by Greenwood's variance formula. For realtime allocation, we retain the Greenwood index and use a survival bound from completed records to review the recommended arm. Under catch-up reporting, the policy has logarithmic expected regret with an arm-specific variance term in the exploration bound. We evaluate the original policy in a dual-layer delayed simulation and a retrospective replay of breast cancer trial data, and evaluate the correction in a separate paired simulation.

## Business World Model

DevFeed: [Business World Model](<https://devfeed.tech/articles/business-world-model-145348.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2606.10044>)

Author: Cecil Pang, Hiroki Sayama

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [World models](<https://devfeed.tech/topics/world-models.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [acting](<https://devfeed.tech/tags/acting.md>), [actions](<https://devfeed.tech/tags/actions.md>), [agents](<https://devfeed.tech/tags/agents.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [autonomous](<https://devfeed.tech/tags/autonomous.md>), [autonomous-driving](<https://devfeed.tech/tags/autonomous-driving.md>), [behavior](<https://devfeed.tech/tags/behavior.md>), [business](<https://devfeed.tech/tags/business.md>), [case](<https://devfeed.tech/tags/case.md>), [case-study](<https://devfeed.tech/tags/case-study.md>), [churn](<https://devfeed.tech/tags/churn.md>), [competition](<https://devfeed.tech/tags/competition.md>), [computer-vision](<https://devfeed.tech/tags/computer-vision.md>), [constraint](<https://devfeed.tech/tags/constraint.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [model](<https://devfeed.tech/tags/model.md>), [world](<https://devfeed.tech/tags/world.md>), [world-model](<https://devfeed.tech/tags/world-model.md>)

### AI overview

The paper proposes a Business World Model for planning in business settings where outcomes depend on context such as customer behavior, pricing, competition, and regulation. It links states, dynamics, and feasible actions to business entities and their relationships so agents can simulate action sequences and assess trade-offs under uncertainty and constraints. In the reference design, LLM agents interpret natural-language goals and explain results; a deterministic, metadata-driven engine combining machine-learning models, business rules, and action spaces performs calculations. A digital-subscription churn case study reports recommendations that meet a churn-reduction target while respecting a revenue constraint. The supplied text is an abstract and does not provide implementation details or case-study measurements.

### Source excerpt

arXiv:2606.10044v4 Announce Type: replace Abstract: World model has emerged as a powerful paradigm in artificial intelligence, enabling agents to represent their environments, predict future states, and evaluate possible actions before acting. However, existing world models have largely been developed for visual or physical domains such as computer vision, robotics, gaming, and autonomous driving, which are governed by relatively stable dynamics. These formulations are not directly applicable to business practice, where the relevant environment is semantic, organizational, and market driven. Outcomes depend on context-sensitive factors such as customer behavior, pricing, competition, and regulation. This paper introduces the concept and architecture of a Business World Model, a world model specialized for business and organizational environments. We propose a business-semantics-centric formulation in which states, dynamics, and feasible actions are linked to business entities, their attributes, and their relationships. Within this framework, intelligent agents can simulate alternative action sequences, estimate their effects on future business outcomes, and evaluate trade-offs under uncertainty and business constraints. We present a reference design and open-source implementation in which LLM agents interpret natural-language business goals and explain results, while a deterministic, metadata-driven simulation engine integrating machine learning models, business rules, and action spaces performs all calculations. A churn case study of a digital subscription business demonstrates that the system recommends options meeting the churn-reduction target within the revenue constraint. This work establishes a conceptual foundation for autonomous business systems capable of moving from instruction-based execution toward goal-driven planning, optimization, and execution.

## Elysium: Simulation-Free Unbalanced Schr\\"odinger Bridges

DevFeed: [Elysium: Simulation-Free Unbalanced Schr\\"odinger Bridges](<https://devfeed.tech/articles/elysium-simulation-free-unbalanced-schr-odinger-bridges-142827.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24763>)

Author: Zihan Wang, Jianzhe Li, Zhenyi Zhang, Peijie Zhou

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [bridge](<https://devfeed.tech/tags/bridge.md>), [bridges](<https://devfeed.tech/tags/bridges.md>), [cells](<https://devfeed.tech/tags/cells.md>), [cellular](<https://devfeed.tech/tags/cellular.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [coupling](<https://devfeed.tech/tags/coupling.md>), [courses](<https://devfeed.tech/tags/courses.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [distributions](<https://devfeed.tech/tags/distributions.md>), [entries](<https://devfeed.tech/tags/entries.md>), [event](<https://devfeed.tech/tags/event.md>), [events](<https://devfeed.tech/tags/events.md>), [existing](<https://devfeed.tech/tags/existing.md>), [exits](<https://devfeed.tech/tags/exits.md>), [growth](<https://devfeed.tech/tags/growth.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [model](<https://devfeed.tech/tags/model.md>), [nature](<https://devfeed.tech/tags/nature.md>), [q-bio-qm](<https://devfeed.tech/tags/q-bio-qm.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

Elysium reconstructs stochastic cell-state changes and population expansion or contraction from snapshots without simulating trajectories during training. It jointly learns state transitions and mass change using a killed Brownian reference and its time reversal, building regression objectives from an optimal endpoint coupling and conditional bridge distributions; the expected objectives recover the optimal unbalanced Schrödinger bridge. On simulated benchmarks with known killed-diffusion ground truth, it reportedly outperforms deterministic and bridge-based solvers in reconstructing transitions, population size, and event distributions. On single-cell time courses, it interpolates unobserved state distributions and captures biphasic drug-response dynamics.

### Source excerpt

arXiv:2611.24763v1 Announce Type: cross Abstract: Reconstructing cellular dynamics from snapshots is challenging because the destructive nature of single-cell measurements makes tracking the same cells over time impossible. Cellular dynamics are inherently stochastic and involve changes in population size through proliferation and apoptosis. Growth-based methods represent population change as a rate on the density, which does not assign exits and entries to individual cells. Unbalanced Schr\"odinger bridges model individual events, but neural solvers for killed diffusion bridges simulate trajectories during training. We introduce Elysium, a simulation-free solver that jointly learns state transition and mass change. Using a killed Brownian reference and its time reversal, Elysium constructs direct regression objectives from an optimal endpoint coupling and conditional bridge distributions, without simulating trajectories during training. We show that the minimizers of the expected training objectives recover the optimal unbalanced Schr\"odinger bridge. Empirically, Elysium reconstructs state transitions, population size, and event distributions on simulated benchmarks with known killed-diffusion ground truth, outperforming existing deterministic and bridge-based solvers. On single-cell time courses, it interpolates cell state distributions at unobserved time points, tracks population expansion and contraction, and captures biphasic drug-response dynamics.

## Efficient simulation of variational quantum circuits: representation, accuracy and CPU/GPU allocation

DevFeed: [Efficient simulation of variational quantum circuits: representation, accuracy and CPU/GPU allocation](<https://devfeed.tech/articles/efficient-simulation-of-variational-quantum-circuits-representation-accuracy-and-cpu-gpu-allocation-142982.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24444>)

Author: Vojt\\v{e}ch Nov\\'ak, Radovan Re\\v{c}ka, Ond\\v{r}ej Knebl, Ivan Zelinka

Published: 2026-11-19T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [accelerate](<https://devfeed.tech/tags/accelerate.md>), [acceleration](<https://devfeed.tech/tags/acceleration.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [benefits](<https://devfeed.tech/tags/benefits.md>), [can](<https://devfeed.tech/tags/can.md>), [change](<https://devfeed.tech/tags/change.md>), [circuit](<https://devfeed.tech/tags/circuit.md>), [circuit-simulation](<https://devfeed.tech/tags/circuit-simulation.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [compare](<https://devfeed.tech/tags/compare.md>), [complete](<https://devfeed.tech/tags/complete.md>), [complex](<https://devfeed.tech/tags/complex.md>), [compression](<https://devfeed.tech/tags/compression.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-circuits](<https://devfeed.tech/tags/quantum-circuits.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

The study compares statevector simulation, direct Pauli evolution, and matrix product states for molecular and spin variational Hamiltonian ansätze and hardware-efficient circuits across CPU/GPU systems. In the tested implementations, direct Pauli evolution benefits complex molecular circuits, while GPUs accelerate wider spin and hardware-efficient circuits. Matrix product states can reduce cost when entanglement is limited enough for accurate compression. Corrected CPU FP32 met the tested tolerance but cost more than FP64. Allocation choices depend on workload size, startup costs, worker memory, and profiling: matched NumPy Pauli updates sped up two-layer full LiH by 3.45x, and a GPU was about 30x faster than 18-thread Aer for a 28-qubit, four-layer TFIM, both in FP64. The proposed procedure jointly selects representation, precision, and worker allocation by comparing complete energy-evaluation costs under accuracy, memory, and core constraints.

### Source excerpt

arXiv:2611.24444v1 Announce Type: cross Abstract: Classical circuit simulation supports quantum software development and verification and provides a baseline for assessing quantum advantage. We compare gate-based statevector simulation, direct Pauli evolution and matrix product states for molecular and spin Variational Hamiltonian Ansatze and hardware-efficient ansatze on CPU/GPU systems, varying width, depth, precision and resource allocation. In the tested implementations, direct Pauli evolution benefits complex molecular VHA, whereas GPUs accelerate wider spin and hardware efficient circuits. Matrix product state is useful when limited entanglement permits accurate compression; corrected CPU FP32 can meet the tested tolerance while costing more than FP64. Workload size, startup, worker memory and task-specific profiling can change the preferred allocation. Matched NumPy Pauli updates accelerate two-layer full LiH by 3.45-fold; the GPU gives approximately 30-fold acceleration over 18-thread Aer for 28-qubit, four-layer TFIM, both in FP64. We provide a procedure for choosing representation, precision and worker allocation jointly, comparing the cost of complete energy evaluations under accuracy, memory and core constraints.

## Local AI Agents in Power Electronics Simulation: Deployment, Measurements and Costs

DevFeed: [Local AI Agents in Power Electronics Simulation: Deployment, Measurements and Costs](<https://devfeed.tech/articles/local-ai-agents-in-power-electronics-simulation-deployment-measurements-and-costs-142843.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24880>)

Author: Yuzhuo Li, Pasan Gunawardena, Yunwei Li

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Local AI](<https://devfeed.tech/topics/local-ai.md>), [Agentic AI](<https://devfeed.tech/topics/what-is-agentic-ai.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [electronics](<https://devfeed.tech/tags/electronics.md>), [local](<https://devfeed.tech/tags/local.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [power](<https://devfeed.tech/tags/power.md>), [power-electronics](<https://devfeed.tech/tags/power-electronics.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

The paper presents a framework for evaluating locally served AI agents that build, run, measure, and revise power electronics simulations, from converter to system level. Local deployment can suit organizations whose sensitive designs or licensed simulators must stay on premises, but each run uses local power and energy and incurs token and time costs. The framework measures these costs under comparable conditions and characterizes the local agents' capability limits and cost per solved task. The supplied abstract gives no numerical findings.

### Source excerpt

arXiv:2611.24880v1 Announce Type: new Abstract: Agentic artificial intelligence (AI) is emerging in power electronics, where it drives the simulation loop that engineers used to close largely by hand. In this loop, a converter design, or a study of the network it connects to, is built, run, measured and revised until it satisfies its specification. Such an agent can be served from a cloud API or from an inference device on the premises. For organizations whose designs, customer data or export-controlled material cannot leave the site, and whose simulators are licensed there, local deployment is the natural choice. In such a deployment, the agent becomes an electrical load on the organization's own equipment, i.e., every run consumes power and energy on a local device, generates tokens and takes time. However, existing work focuses mainly on what the agent can achieve with cloud-hosted models. What a local deployment costs in power, energy, tokens and time on real simulation tasks, and what its choices trade against one another, has received little quantitative investigation under comparable conditions. To address this gap, a systematic evaluation framework is presented in this paper. It applies locally served models to agentic power electronics tasks, from the converter level to the system level, and measures their power, energy, token and time costs. Based on these measurements, the capability boundary of a local agent on such tasks and the cost per solved task are characterized. The results are expected to provide practical insight for the use of agentic AI in power electronics and the power systems it serves.

## LAaDT-DSS: decision support for non-experts on rooftop PV, incentive and grid simulations under Turkish tariff rules

DevFeed: [LAaDT-DSS: decision support for non-experts on rooftop PV, incentive and grid simulations under Turkish tariff rules](<https://devfeed.tech/articles/laadt-dss-decision-support-for-non-experts-on-rooftop-pv-incentive-and-grid-simulations-under-turkish-tariff-rules-142835.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24810>)

Author: Baran Kaynak

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ce](<https://devfeed.tech/tags/cs-ce.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [decision](<https://devfeed.tech/tags/decision.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [grid](<https://devfeed.tech/tags/grid.md>), [pv](<https://devfeed.tech/tags/pv.md>), [rules](<https://devfeed.tech/tags/rules.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [software](<https://devfeed.tech/tags/software.md>)

### AI overview

LAaDT-DSS supports household investment, incentive-cost, and feeder-limit decisions under Turkish tariff rules through one simulation core. Users can select a house on a 3D map or ask in plain language; a language model calls simulation tools rather than computing results itself. Its 125 parameter entries are marked as sourced or estimated. In case studies, PV yield was within ±3.6% of two independent tools at equal losses. Across 2,048 draws of estimated inputs, the PV-only answer held in all but one draw, while adding a battery changed the answer in 31-41%. Four scripted chat scenarios ran end to end; no user study was conducted.

### Source excerpt

arXiv:2611.24810v1 Announce Type: cross Abstract: Rooftop photovoltaics raise three questions: should a household invest, which incentive costs the state least, and does the feeder stay within limits? Those who ask are rarely modellers. We present LAaDT-DSS, decision-support software that answers all three under Turkish tariff rules from one simulation core. Non-experts reach it by clicking a house on a 3D map or by asking in plain words; a language model is asked to call the simulation tools, not to compute. Each entry of its 125-entry parameter registry is marked as sourced or estimated. Case studies test the system. Its PV yield lies within $\pm$3.6% of two independent tools at equal losses. Across 2,048 draws of its estimated inputs, the answer for PV alone held in all but one; with a battery, it changed in 31-41% of the draws. Four scripted chat scenarios ran end to end; no user study was run.

## Deep Reinforcement Learning for Heat Pump and Underfloor Heating Control: An End-to-End Case Study

DevFeed: [Deep Reinforcement Learning for Heat Pump and Underfloor Heating Control: An End-to-End Case Study](<https://devfeed.tech/articles/deep-reinforcement-learning-for-heat-pump-and-underfloor-heating-control-an-end-to-end-case-study-140112.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23063>)

Author: Antonio Manjavacas, David Su\\'arez-Caro, Alejandro Campoy-Nieves, Guillermo Rey, Gonzalo Satr\\'ustegui, Miguel Molina-Solana

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Advanced AI workflows](<https://devfeed.tech/topics/advanced-ai-workflows.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [case-study](<https://devfeed.tech/tags/case-study.md>), [control](<https://devfeed.tech/tags/control.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [deep-reinforcement-learning](<https://devfeed.tech/tags/deep-reinforcement-learning.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [digital-twin](<https://devfeed.tech/tags/digital-twin.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [energy-consumption](<https://devfeed.tech/tags/energy-consumption.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [heat-pump](<https://devfeed.tech/tags/heat-pump.md>), [robustness](<https://devfeed.tech/tags/robustness.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [strategies](<https://devfeed.tech/tags/strategies.md>)

### AI overview

The case study reports that a deep reinforcement learning controller for an integrated heat pump and underfloor heating system maintained indoor temperatures within prescribed comfort limits in an occupied residential building. Researchers first compared algorithms and control strategies in simulation, then trained agents using a digital twin of the building. They deployed the best-performing agent without additional online fine-tuning; it adjusted heat pump supply temperature and underfloor heating valve positions. The abstract presents this as evidence that deployment is feasible, while noting practical challenges in transferring policies from digital environments to real heating systems.

### Source excerpt

arXiv:2611.23063v1 Announce Type: new Abstract: Efficient control of underfloor heating (UFH) systems coupled with heat pumps (HPs) is challenging due to the high thermal inertia of buildings and the slow dynamic response of UFH systems. Deep Reinforcement Learning (DRL) offers a data-driven control approach capable of simultaneously optimizing energy consumption and thermal comfort. However, the application of DRL-based controllers in occupied buildings under real operating conditions remains limited. This work presents and end-to-end case study (development, evaluation, and real-world deployment) of a DRL-based controller for an integrated UFH-HP system. First, a simulation-based pilot study was conducted to assess different DRL algorithms, control strategies, and configurations. Subsequently, a digital twin of a real residential building was developed and used to train DRL agents under simulated operating conditions. The best-performing agent was then deployed in the physical building without additional online fine-tuning. The results show that the controller successfully maintained indoor temperatures within the prescribed comfort limits while dynamically adjusting the HP supply temperature and UFH valve positions. These findings demonstrate the feasibility of deploying DRL controllers in occupied buildings and highlight their robustness and the practical challenges associated with transferring control policies from digital environments to real heating systems.

## From Perception to Simulation: Unveiling and Empowering Mental Spatial Dynamics in MLLMs

DevFeed: [From Perception to Simulation: Unveiling and Empowering Mental Spatial Dynamics in MLLMs](<https://devfeed.tech/articles/from-perception-to-simulation-unveiling-and-empowering-mental-spatial-dynamics-in-mllms-140047.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22541>)

Author: Jiachun Li, Zhuoran Jin, Kang Liu, Jun Zhao

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [LLM evaluation / benchmarking](<https://devfeed.tech/topics/llm-evaluation-benchmarking.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [framework](<https://devfeed.tech/tags/framework.md>), [improvement](<https://devfeed.tech/tags/improvement.md>), [intelligence](<https://devfeed.tech/tags/intelligence.md>), [large-language-models](<https://devfeed.tech/tags/large-language-models.md>), [learning](<https://devfeed.tech/tags/learning.md>), [multimodal](<https://devfeed.tech/tags/multimodal.md>), [performance](<https://devfeed.tech/tags/performance.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [robust](<https://devfeed.tech/tags/robust.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [spatial](<https://devfeed.tech/tags/spatial.md>), [spatial-reasoning](<https://devfeed.tech/tags/spatial-reasoning.md>)

### AI overview

MentalGrid evaluates whether multimodal language models can simulate changing spatial states without intermediate visual feedback. The authors report that existing models struggle with perceptual demands in simpler scenarios and multi-step reasoning as tasks become more complex. They train SpatialWalker with a three-stage curriculum using 16,000 specialized samples; it improves 33.8% on average over its base model, exceeds Gemini-3-Flash on spatial simulation, and retains a 4.9% average gain on out-of-domain benchmarks. These are results reported in the supplied abstract.

### Source excerpt

arXiv:2611.22541v1 Announce Type: cross Abstract: Spatial reasoning is a fundamental component of world understanding for Multimodal Large Language Models (MLLMs). While existing research has advanced the perception of spatial relations in static scenes, the domain of dynamic spatial simulation remains relatively unexplored. To bridge this gap, we introduce MentalGrid, a benchmark focused on spatial reasoning tasks that require models to simulate evolving spatial states without intermediate visual feedback. Extensive evaluation on our benchmark reveals a significant deficiency in the spatial simulation capabilities of existing models. Specifically, we find that performance is constrained by perceptual limitations in simple simulation scenarios and hindered by inadequate multi-step reasoning as complexity increases. To address these challenges, we propose a three-stage curriculum learning framework utilizing 16k specialized spatial reasoning samples. This approach yields SpatialWalker, which achieves a 33.8% average improvement over its base model, surpassing proprietary models like Gemini-3-Flash in spatial simulation. Furthermore, SpatialWalker demonstrates robust generalization, maintaining a 4.9% average gain on out-of-domain benchmarks, demonstrating the pivotal role of spatial simulation as a fundamental building block for broader spatial intelligence.

## An AI-Based OSSE Framework to Evaluate Learned Physical Consistency: A Multi-Model Study Using FourCastNet, Aurora, Prithvi WxC, and GraphCast

DevFeed: [An AI-Based OSSE Framework to Evaluate Learned Physical Consistency: A Multi-Model Study Using FourCastNet, Aurora, Prithvi WxC, and GraphCast](<https://devfeed.tech/articles/an-ai-based-osse-framework-to-evaluate-learned-physical-consistency-a-multi-model-study-using-fourcastnet-aurora-prithvi-wxc-and-graphcast-141721.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22024>)

Author: Yash Diggikar, Milton Halem, Aishwarya Raman

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Climate / Weather / Ocean Modeling](<https://devfeed.tech/topics/climate-weather-ocean-modeling.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [after](<https://devfeed.tech/tags/after.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-models](<https://devfeed.tech/tags/ai-models.md>), [all](<https://devfeed.tech/tags/all.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [can](<https://devfeed.tech/tags/can.md>), [capture](<https://devfeed.tech/tags/capture.md>), [central](<https://devfeed.tech/tags/central.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [consistency](<https://devfeed.tech/tags/consistency.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [example](<https://devfeed.tech/tags/example.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [framework](<https://devfeed.tech/tags/framework.md>), [model](<https://devfeed.tech/tags/model.md>), [study](<https://devfeed.tech/tags/study.md>), [using](<https://devfeed.tech/tags/using.md>)

### AI overview

The framework tests whether four AI weather models reproduce atmospheric responses to inserted observations in OSSE-style forecasts. FourCastNet V2, GraphCast, Aurora, and Prithvi WxC were run autoregressively for 60 days with a 30-day spin-up; ERA5 temperature or wind fields were then inserted, and responses were assessed over a 30-day assimilation cycle. Models respond differently to the same insertions: Aurora and Prithvi WxC show the strongest impacts, while GraphCast is weakest. Three of the four capture the temperature-to-geopotential-height response, and the two foundation models retain a positive tropical 500-hPa zonal-wind response to temperature insertion. Results can also vary among insertion experiments within an architecture. In GraphCast's full 37-level setup, temperature insertion triggers runaway feedback near the upper levels; the abstract reports this can be corrected by excluding levels at or below 100 hPa.

### Source excerpt

arXiv:2611.22024v1 Announce Type: new Abstract: Observing System Simulation Experiments (OSSEs) are a central methodology for evaluating future atmospheric observing systems. We present the first AI-based OSSE framework to test whether different AI weather models can reproduce comparable physical impact from new observations that traditional physics based models generate. We evaluate four distinct architectural AI models on the Charney conjecture that incomplete historical observations can infer the present state of the atmospheric. We considner- FourCastNet V2, GraphCast, Aurora and Prithvi WxC and integrate each autoregressively over a 60-day forecast horizon. After a 30-day spin-up, we insert ERA5 temperature fields to infer winds and related atmospheric fields. Similar OSSE experiments are conducted for wind insertion. We measure the performance of each model's response to observational information on a 30-day data assimilation cycle forecast with and without data insertion. Distinct architectural AI weather models respond differently to the same OSSE observations. Foundation models (i.e. Prithvi WxC and Aurora), produce the strongest impact. For example, while GraphCast is the weakest, all three of the four models capture the temperature-to-geopotential height response. The two foundational models retain a positive, non-trivial, tropical zonal wind at 500 hPa response to temperature insertion. Various data insertion experiments can vary significantly even within a given architecture. We identify an architecture-specific numerical instability in GraphCast's full 37-level configuration that produces a runaway feedback concentrated at the uppermost levels with ERA5 temperature insertion correctable by excluding levels at or below 100 hPa.

## Magflow: Differentiable Simulation of Industrial-Grade 6D Magnetic Levitation

DevFeed: [Magflow: Differentiable Simulation of Industrial-Grade 6D Magnetic Levitation](<https://devfeed.tech/articles/magflow-differentiable-simulation-of-industrial-grade-6d-magnetic-levitation-141836.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.23050>)

Author: Philipp Hartmann, Jannick Strangh\\"oner, Klaus Neumann

Published: 2026-11-18T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Robotics Simulation](<https://devfeed.tech/topics/robotics-simulation.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Physical AI](<https://devfeed.tech/topics/physical-ai.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Robotics](<https://devfeed.tech/topics/robotics.md>), [GPU](<https://devfeed.tech/topics/gpu.md>)

Tags: [co-design](<https://devfeed.tech/tags/co-design.md>), [control](<https://devfeed.tech/tags/control.md>), [controller](<https://devfeed.tech/tags/controller.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ro](<https://devfeed.tech/tags/cs-ro.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [industrial](<https://devfeed.tech/tags/industrial.md>), [learning](<https://devfeed.tech/tags/learning.md>), [magnetic](<https://devfeed.tech/tags/magnetic.md>), [neural](<https://devfeed.tech/tags/neural.md>), [physics](<https://devfeed.tech/tags/physics.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [simulator](<https://devfeed.tech/tags/simulator.md>), [topology](<https://devfeed.tech/tags/topology.md>), [zero-shot](<https://devfeed.tech/tags/zero-shot.md>)

### AI overview

Magflow uses a fully differentiable, GPU-parallel simulator to model 6D magnetic levitation directly, avoiding hand-crafted electromagnetic force approximations used in industrial systems. Those approximations help make kilohertz control tractable but constrain the operating workspace and supported mover topologies. The authors report training an industrial-grade neural controller purely in simulation that transfers zero-shot to real hardware, meets 4 kHz hard real-time constraints, exhibits new behaviors, and levitates a mover topology lacking a hand-crafted solution. These results suggest hardware-software co-design is not physically necessary for this control task.

### Source excerpt

arXiv:2611.23050v1 Announce Type: cross Abstract: Magnetic levitation with six-degrees-of-freedom enables frictionless transport and micrometer-scale positioning in principle, but low-level control is inherently challenging due to its complex and unstable dynamics. Industrial systems typically rely on deep hardware-software co-design, where mover and stator geometries are jointly designed to enable a compact, hand-crafted approximation of the electromagnetic force computation, thereby keeping control computationally tractable at kilohertz rates. However, this approach imposes overly conservative constraints on the operating workspace and the range of supported mover topologies. Instead of reducing the underlying physics to a hand-crafted approximation, we compute the physics directly. We introduce Magflow, a fully differentiable, GPU-parallel simulator for 6D magnetic levitation. It is used to train the first neural controller for an industrial-grade 6D magnetic levitation system that is learned purely from simulated physics. We show that the learned neural controller transfers zero-shot from simulation to real hardware while satisfying hard real-time constraints at 4 kHz. The learned controller achieves qualitatively new behaviors and even levitates a mover topology for which no hand-crafted solution exists. These results demonstrate that co-design is not a physical necessity for 6D magnetic levitation control. More broadly, control learning from simulated physics can find solutions beyond the reach of control engineering in demanding industrial domains. Source code and demonstration videos are publicly available at https://sites.google.com/view/magflow.

## DGF-Asym: Adaptive Peer Weighting for Collective Estimation under Noisy and Faulty Sensing

DevFeed: [DGF-Asym: Adaptive Peer Weighting for Collective Estimation under Noisy and Faulty Sensing](<https://devfeed.tech/articles/dgf-asym-adaptive-peer-weighting-for-collective-estimation-under-noisy-and-faulty-sensing-140044.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22532>)

Author: Mohammad Nomaan Husain, Tanja Katharina Kaiser

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [robot sense of touch](<https://devfeed.tech/topics/robot-sense-of-touch.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [asynchronous](<https://devfeed.tech/tags/asynchronous.md>), [collective](<https://devfeed.tech/tags/collective.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ro](<https://devfeed.tech/tags/cs-ro.md>), [decentralized](<https://devfeed.tech/tags/decentralized.md>), [decision](<https://devfeed.tech/tags/decision.md>), [influence](<https://devfeed.tech/tags/influence.md>), [information](<https://devfeed.tech/tags/information.md>), [model](<https://devfeed.tech/tags/model.md>), [navigation](<https://devfeed.tech/tags/navigation.md>), [noise](<https://devfeed.tech/tags/noise.md>), [peer](<https://devfeed.tech/tags/peer.md>), [performance](<https://devfeed.tech/tags/performance.md>), [personal](<https://devfeed.tech/tags/personal.md>), [ratio](<https://devfeed.tech/tags/ratio.md>), [retrospective](<https://devfeed.tech/tags/retrospective.md>), [robots](<https://devfeed.tech/tags/robots.md>), [sensing](<https://devfeed.tech/tags/sensing.md>), [sensor](<https://devfeed.tech/tags/sensor.md>), [size](<https://devfeed.tech/tags/size.md>)

### AI overview

DGF-Asym extends the DeGroot-Friedkin model with asymmetric peer weights based on retrospective predictive performance, allowing robots to balance personal observations and peer information without prior sensor-noise statistics or explicit fault models. It supports asynchronous communication. In simulated collective navigation with noisy observations and time-varying sensor faults, it produced more stable estimates and more reliably sustained the decision criterion than three baselines, but took longer to reach decisions. Performance also depended on fault ratio, group size, and influence-threshold selection.

### Source excerpt

arXiv:2611.22532v1 Announce Type: cross Abstract: Collective estimation under unreliable sensing requires robots to adaptively balance personal observations and social information from peers. We propose DGF-Asym, a decentralized collective estimation method extending the DeGroot-Friedkin model with asymmetric peer weighting based on retrospective predictive performance. The method supports consensus formation without prior sensor-noise statistics or explicit fault models while keeping inter-robot communication asynchronous. We evaluate DGF-Asym in simulated collective navigation under noisy observations and time-varying sensor faults. Compared with three baselines, it produces more stable estimates and more reliably sustains the decision criterion, at the cost of longer decision times. However, overall performance depends on fault ratio, group size, and influence-threshold selection. Our results demonstrate the potential of adaptive peer weighting for stable model-free collective estimation under unreliable sensing.

## NS-Gym: A Comprehensive and Open-Source Simulation Framework for Non-Stationary Markov Decision Processes

DevFeed: [NS-Gym: A Comprehensive and Open-Source Simulation Framework for Non-Stationary Markov Decision Processes](<https://devfeed.tech/articles/ns-gym-a-comprehensive-and-open-source-simulation-framework-for-non-stationary-markov-decision-processes-139739.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2501.09646>)

Author: Nathaniel S. Keplinger, Baiting Luo, Yunuo Zhang, Kyle Hollins Wray, Aron Laszka, Abhishek Dubey, Ayan Mukhopadhyay

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [agent](<https://devfeed.tech/tags/agent.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [also](<https://devfeed.tech/tags/also.md>), [applications](<https://devfeed.tech/tags/applications.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [can](<https://devfeed.tech/tags/can.md>), [challenges](<https://devfeed.tech/tags/challenges.md>), [code](<https://devfeed.tech/tags/code.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [decision](<https://devfeed.tech/tags/decision.md>), [decision-making](<https://devfeed.tech/tags/decision-making.md>), [framework](<https://devfeed.tech/tags/framework.md>), [gym](<https://devfeed.tech/tags/gym.md>), [markov](<https://devfeed.tech/tags/markov.md>), [open](<https://devfeed.tech/tags/open.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [processes](<https://devfeed.tech/tags/processes.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [source](<https://devfeed.tech/tags/source.md>)

### AI overview

NS-Gym provides a Gymnasium-integrated simulation toolkit for studying non-stationary Markov decision processes, where environmental dynamics change over time. It separates changes in environmental parameters from the agent's decision-making module, supporting modular adaptation. The authors describe standardized interfaces and benchmark problems intended to make algorithm evaluation under changing conditions more consistent and reproducible, and report benchmarking several prior NS-MDP approaches with the toolkit. The supplied text does not detail benchmark results or implementation specifics.

### Source excerpt

arXiv:2501.09646v2 Announce Type: replace Abstract: Many real-world applications require decision-making where the environmental dynamics evolve over time. These non-stationary environments pose significant challenges to traditional decision-making models, which typically assume stationary dynamics. Non-stationary Markov decision processes (NS-MDPs) offer a framework to model and solve decision problems under such changing conditions. However, there are no standardized simulation frameworks for NS-MDPs, as opposed to widely popular frameworks for stationary problems. We present NS-Gym, the first simulation toolkit designed explicitly for NS-MDPs, integrated within the popular Gymnasium framework. In NS-Gym, we segregate the evolution of the environmental parameters that characterize non-stationarity from the agent's decision-making module, allowing for modular and flexible adaptations to dynamic environments. We review prior work in this domain and present a toolkit encapsulating key problem characteristics and types in NS-MDPs. This toolkit is the first effort to develop a set of standardized interfaces and benchmark problems to enable consistent and reproducible evaluation of algorithms under non-stationary conditions. We also benchmark several algorithmic approaches from prior work on NS-MDPs using NS-Gym. We envision that NS-Gym will enable researchers to study decision-making under non-stationarity by providing standardized interfaces, simulation frameworks, and benchmark problems. Project documentation, webpage, and code can be found at https://nsgym.io and https://github.com/scope-lab-vu/ns_gym

## Solver to System: LLM Reasoning Across Representations and Execution in Scientific Simulation

DevFeed: [Solver to System: LLM Reasoning Across Representations and Execution in Scientific Simulation](<https://devfeed.tech/articles/solver-to-system-llm-reasoning-across-representations-and-execution-in-scientific-simulation-141711.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21964>)

Author: Eliza Berman, Rohan Subramanian, Shreya Jha, Lohit Jagarapu, Romain Lopez, Rajesh Ranganath

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [llm-reasoning](<https://devfeed.tech/topics/llm-reasoning.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Finite Element Method (FEM)](<https://devfeed.tech/topics/finite-element-method.md>)

Tags: [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [execution](<https://devfeed.tech/tags/execution.md>), [llm](<https://devfeed.tech/tags/llm.md>), [partial-differential-equations](<https://devfeed.tech/tags/partial-differential-equations.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [scientific-simulation](<https://devfeed.tech/tags/scientific-simulation.md>)

### AI overview

Solver2System evaluates whether eight open-weight LLMs can reconcile PDE solvers with equations, natural-language descriptions, and numerical trajectories, and detect physically invalid code. When representations conflict, models favor some over others; lexical changes to code can also shift how they interpret unchanged representations. Executing code improves physical-validity judgments, but weaker agents may reach the right judgment without identifying the defect that caused it. The findings show that a correct verdict does not necessarily mean the model consistently reconciled evidence or diagnosed the underlying cause.

### Source excerpt

arXiv:2611.21964v1 Announce Type: new Abstract: Simulators based on partial differential equations (PDEs) are widely used to model physical systems, but generating and interpreting PDE solver code with large language models (LLMs) remains challenging. Scientific simulation code is a useful testbed for LLM scientific reasoning because (1) one system can be represented by code, equations, natural language, and numerical trajectories and (2) code can execute successfully while implementing invalid physics. We introduce Solver2System, a dataset of PDE solvers with multiple representations, controlled corruptions, and lexical perturbations, to evaluate whether LLMs can recover the underlying physical system through (1) cross-representation consistency and (2) static and agentic detection of physical invalidity. Across eight open-weight models, LLMs systematically favor some representations when evidence conflicts, and lexical perturbations to code alter interpretation of other unchanged representations. Execution improves physical-validity judgments, but weaker agents can judge correctly without identifying the causal defect. Thus, LLMs may reach correct judgments despite inconsistent representation reconciliation or causal misdiagnosis.

## IA-MoE: An Intensity-Aware Mixture of Experts for DNN Inference

DevFeed: [IA-MoE: An Intensity-Aware Mixture of Experts for DNN Inference](<https://devfeed.tech/articles/ia-moe-an-intensity-aware-mixture-of-experts-for-dnn-inference-136984.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19669>)

Author: Meiyan Zeng, Sasu Tarkoma, Xiaoli Liu

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Mixture of Experts (MoE)](<https://devfeed.tech/topics/mixture-of-experts-moe.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [resource orchestration](<https://devfeed.tech/topics/resource-orchestration.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [applications](<https://devfeed.tech/tags/applications.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [bottlenecks](<https://devfeed.tech/tags/bottlenecks.md>), [challenges](<https://devfeed.tech/tags/challenges.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [cloud-based](<https://devfeed.tech/tags/cloud-based.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [computing](<https://devfeed.tech/tags/computing.md>), [critical](<https://devfeed.tech/tags/critical.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [data](<https://devfeed.tech/tags/data.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [deep](<https://devfeed.tech/tags/deep.md>), [dnn](<https://devfeed.tech/tags/dnn.md>), [experts](<https://devfeed.tech/tags/experts.md>), [inference](<https://devfeed.tech/tags/inference.md>), [mixture-of-experts](<https://devfeed.tech/tags/mixture-of-experts.md>), [moe](<https://devfeed.tech/tags/moe.md>)

### AI overview

IA-MoE dynamically partitions DNN layers across resources in an edge-cloud environment to jointly optimize end-to-end latency and energy use under changing inference requests and multi-resource constraints. It frames each request's assignment of layer tasks to virtual machines as a bilateral matching problem. In enhanced CloudSimSDN simulations using AlexNet, VGG16, and ResNet50 with two public inference datasets, it outperformed baseline methods on weighted normalized latency and energy metrics. The reported evidence is simulation-based; the abstract provides no numerical results.

### Source excerpt

arXiv:2611.19669v1 Announce Type: new Abstract: With the ever-increasing parameter scale and structural complexity of deep neural network (DNN) models, traditional cloud-based inference encounters bottlenecks in performance, privacy protection, and energy efficiency. While edge computing and edge intelligence facilitate the migration of inference tasks to edge servers closer to the data source, existing end-edge-cloud collaborative inference still encounters critical challenges, such as sensitivity to heterogeneous resources, complexity in multi-objective optimization, and adaptability to dynamic workloads. To achieve the joint optimization of end-to-end latency and energy consumption under dynamic inference requests with multi-resource constraints, we propose IA-MoE, an intensity-aware Mixture of Experts (MoE) framework. By modeling the model partitioning problem as a bilateral matching problem between layer tasks and virtual machine resources for each inference request, IA-MoE dynamically partitions DNN models in an edge-cloud hybrid computing environment. We evaluate IA-MoE using three representative DNNs (i.e., AlexNet, VGG16, ResNet50) on two public inference datasets in an enhanced CloudSimSDN simulation environment. Experimental results demonstrate that IA-MoE outperforms baseline methods regarding weighted normalized metrics for end-to-end latency and energy consumption. To our knowledge, this is the first study to introduce the MoE paradigm for DNN partitioning and collaborative inference in hybrid computing environments, providing a practical solution for efficient inference in artificial intelligence applications.

## Does a completed simulation run mean a usable urban wind result for AI agents?

DevFeed: [Does a completed simulation run mean a usable urban wind result for AI agents?](<https://devfeed.tech/articles/does-a-completed-simulation-run-mean-a-usable-urban-wind-result-for-ai-agents-137441.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19385>)

Author: Zhongke Qu, Yunwei Zhang, Junwei Su, Yabin Zhang, Chengwei Li, Qingxiang Shui, Hailong Qu, Zhaolin Gu

Published: 2026-11-17T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [Loop Engineering](<https://devfeed.tech/topics/loop-engineering.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [reproducibility](<https://devfeed.tech/topics/reproducibility.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [cfd](<https://devfeed.tech/tags/cfd.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [execution](<https://devfeed.tech/tags/execution.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [metrics](<https://devfeed.tech/tags/metrics.md>), [parsing](<https://devfeed.tech/tags/parsing.md>), [provenance](<https://devfeed.tech/tags/provenance.md>), [raw](<https://devfeed.tech/tags/raw.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [token-consumption](<https://devfeed.tech/tags/token-consumption.md>), [usability](<https://devfeed.tech/tags/usability.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

A completed CFD run did not guarantee usable urban-wind metrics: on 30 OpenFOAM tasks, a base agent reached the structural-score maximum on 28 but earned numerical credit on only 6. UrbanWind-AgentBench defines contracts for variable and fixed conditions, thresholds and deliverables, and separates structural checks--including provenance and raw evidence--from numerical scores independently recomputed against references. WindPilot adds contract parsing, execution provenance, deterministic verification and bounded acceptance review to the execution loop. With the same model name and budget, it earned numerical credit on 17 tasks, achieved full scores on 3, and raised the mean score from 62.5 to 72.5; it also reduced mean action steps from 130.4 to 104.9 and token use by 12.9%. The reported mean gain was 18.5 points for atmospheric boundary layer tasks. Results are limited to the stated 30-task evaluation.

### Source excerpt

arXiv:2611.19385v1 Announce Type: new Abstract: AI agents based on large language models (LLMs) can now configure and run computational fluid dynamics (CFD) solvers, but a completed run does not ensure that delivered metrics can be recomputed from raw outputs. This gap was examined for urban wind simulation, where multi-case comparisons must hold non-target conditions fixed and reported values must be traceable to raw samples. UrbanWind-AgentBench, comprising 200 tasks and 367 cases in 10 engineering task families, was constructed. Public task contracts specify variable factors, fixed conditions, numerical thresholds and deliverable requirements, and two-layer scoring separates a structural score for deliverables, run provenance and raw evidence from a numerical score obtained by independent recomputation against references. WindPilot was then proposed as an execution framework that incorporates contract parsing, execution provenance, deterministic verification and bounded acceptance review into the LLM execution loop. On 30 OpenFOAM tasks with independent references, at least the structural maximum of 60 points was reached by a base agent on 28 tasks, but numerical credit was obtained on only 6. With the same model name and budget, WindPilot increased the number of tasks with numerical credit to 17, full-score tasks from 0 to 3 and the mean task score from 62.5 to 72.5. Mean action steps fell from 130.4 to 104.9, and mean token consumption decreased by 12.9%. The mean gain for atmospheric boundary layer (ABL) tasks was 18.5 points. A completed simulation run is therefore not sufficient for a usable urban wind result; usability depends on checks that tie reported metrics to raw evidence during execution.

## LZn : Robust LoRa Frame Synchronization Under Frame Collisions and Ultra-Low SNR Conditions

DevFeed: [LZn : Robust LoRa Frame Synchronization Under Frame Collisions and Ultra-Low SNR Conditions](<https://devfeed.tech/articles/lzn-robust-lora-frame-synchronization-under-frame-collisions-and-ultra-low-snr-conditions-137013.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2604.27672>)

Author: Jos\\'e \\'Alamos, Thomas C. Schmidt, Matthias W\\"ahlisch

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [synchronization](<https://devfeed.tech/topics/synchronization.md>), [Decoding](<https://devfeed.tech/topics/decoding.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [cost](<https://devfeed.tech/tags/cost.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [deployments](<https://devfeed.tech/tags/deployments.md>), [detection](<https://devfeed.tech/tags/detection.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [frame](<https://devfeed.tech/tags/frame.md>), [intersection](<https://devfeed.tech/tags/intersection.md>), [lora](<https://devfeed.tech/tags/lora.md>), [probability](<https://devfeed.tech/tags/probability.md>), [range](<https://devfeed.tech/tags/range.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [recovery](<https://devfeed.tech/tags/recovery.md>), [robust](<https://devfeed.tech/tags/robust.md>), [scheme](<https://devfeed.tech/tags/scheme.md>), [signal](<https://devfeed.tech/tags/signal.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [snr](<https://devfeed.tech/tags/snr.md>), [symbols](<https://devfeed.tech/tags/symbols.md>), [synchronization](<https://devfeed.tech/tags/synchronization.md>)

### AI overview

LZn targets LoRa frame synchronization when same-spreading-factor packets collide or arrive at very low SNR. It uses a minimum-based spectral intersection across consecutive symbols. Preamble search adds modest overhead, while fine synchronization costs two to three orders of magnitude less than in existing collision-tolerant receivers. In simulations and three real-world datasets, LZn improves detection sensitivity by up to 10 dB and detection probability by up to 1.54x. Against TnB, the next-best collision-tolerant scheme, it improves real-world decoding by 3.46x in the most challenging single-user scenario and up to 1.22x in collision scenarios. The abstract reports compatibility with real-time requirements.

### Source excerpt

arXiv:2604.27672v2 Announce Type: replace Abstract: LoRa has become a widely adopted wireless modulation scheme in LPWANs due to its low cost, long range, and minimal transmission power. However, collisions between frames of the same spreading factor -- common in dense LoRa deployments -- prevent conventional LoRa receivers from detecting and correctly decoding frames. Recent work has introduced methods to improve recovery, yet their detection stage degrades sharply under low signal-to-noise ratio (SNR) and high collision rates. In this work, we introduce LZn, a synchronization scheme driven by a minimum-based spectral intersection across consecutive symbols. While preamble search incurs a modest overhead, LZn reduces the cost of fine synchronization by two to three orders of magnitude compared to existing collision-tolerant receivers. Our method enables robust frame synchronization even under multiple packet overlaps or extremely low SNR conditions. We evaluate LZn on simulations and three independent, real-world LoRa datasets. LZn improves detection sensitivity by up to 10 dB and increases detection probability by up to 1.54x. In real-world datasets, LZn improves decoding by 3.46x in the most challenging single-user scenario and up to 1.22x in collision scenarios compared to the second best collision-tolerant scheme (TnB). These results demonstrate that LZn substantially improves the frame recovery of LoRa receivers, while remaining compatible with real-time requirements.

## Hierarchical Regime-Conditioned Dynamics for Spatiotemporal Graphs

DevFeed: [Hierarchical Regime-Conditioned Dynamics for Spatiotemporal Graphs](<https://devfeed.tech/articles/hierarchical-regime-conditioned-dynamics-for-spatiotemporal-graphs-139099.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20835>)

Author: Jeremy Baffou, Pascal Frossard, Dorina Thanou

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [World models](<https://devfeed.tech/topics/world-models.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>)

Tags: [cs-cg](<https://devfeed.tech/tags/cs-cg.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [generative](<https://devfeed.tech/tags/generative.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [inference](<https://devfeed.tech/tags/inference.md>), [interpretability](<https://devfeed.tech/tags/interpretability.md>)

### AI overview

HERON combines spatiotemporal graph forecasting with regime identification by separating latent state into discrete system-level regimes and continuous entity-level dynamics. The inferred regime conditions the system's dynamics, supporting regime tracking and simulations under alternative modes. The framework learns forecasts and regime dynamics self-supervised, without regime annotations, and reports recovery of meaningful modes on controlled synthetic and real-world datasets while maintaining competitive forecasting performance. The supplied text does not specify benchmarks or quantitative results.

### Source excerpt

arXiv:2611.20835v1 Announce Type: new Abstract: Forecasting the behavior of spatio-temporal systems often requires more than accurate predictions: models should uncover the dynamical modes governing future evolution. Existing temporal graph and latent dynamical models achieve strong forecasting performance, but their latent representations often entangle multiple dynamical patterns, limiting interpretability. Conversely, regime-inference methods explicitly model such modes but typically do not support generative forecasting over graph-structured systems. We introduce HERON, a self-supervised regime-aware generative framework that unifies graph-structured trajectory generation with regime identification. HERON factorizes the latent state into discrete system-level regimes, capturing global dynamical modes, and continuous entity-level dynamics, yielding a modular regime interface compatible with existing spatio-temporal backbones. Crucially, the inferred regime actively conditions system dynamics, enabling regime tracking and controlled simulations under alternative dynamical modes. Without regime annotations, HERON jointly learns forecasts and regime dynamics in a self-supervised manner, recovering meaningful modes across controlled synthetic and real-world datasets while maintaining competitive forecasting performance. These results open a path toward interpretable, controllable generative modeling of spatio-temporal dynamics.

## SWE-WhatIf: Simulating Real Users of Coding Agents from Recorded Session

DevFeed: [SWE-WhatIf: Simulating Real Users of Coding Agents from Recorded Session](<https://devfeed.tech/articles/swe-whatif-simulating-real-users-of-coding-agents-from-recorded-session-137656.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21095>)

Author: Tae Soo Kim, Tongshuang Wu, Juho Kim

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [agentic-coding](<https://devfeed.tech/topics/agentic-coding.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Context-aware AI](<https://devfeed.tech/topics/context-aware-ai.md>), [AI-assisted coding](<https://devfeed.tech/topics/ai-assisted-coding.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [coding-agents](<https://devfeed.tech/tags/coding-agents.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-hc](<https://devfeed.tech/tags/cs-hc.md>), [llms](<https://devfeed.tech/tags/llms.md>), [ranking](<https://devfeed.tech/tags/ranking.md>), [recording](<https://devfeed.tech/tags/recording.md>), [session](<https://devfeed.tech/tags/session.md>), [sessions](<https://devfeed.tech/tags/sessions.md>), [simulator](<https://devfeed.tech/tags/simulator.md>), [users](<https://devfeed.tech/tags/users.md>)

### AI overview

SWE-WhatIf replays recorded coding-agent sessions by modeling the user's intent, satisfaction criteria, and the conditions that prompt replies. Its simulator adapts to new agent turns while staying grounded in the original recording, addressing why recorded replies cannot simply be replayed when an agent takes a different path. Across 89 real-world sessions, its replies were most similar to real users' and it matched the strongest baseline on rewritten sessions. In tests where agents avoided or repeated actions users had challenged, SWE-WhatIf had a 66.3% win rate for avoiding those actions, significantly above chance. When ranking five LLM coding agents, the top model varied with how users expressed and developed their intent. In a study with 16 users, replaying their sessions changed 14 participants' rankings and informed their future agent use.

### Source excerpt

arXiv:2611.21095v1 Announce Type: cross Abstract: Recorded sessions between users and coding agents offer a way to evaluate how agents complete real-world tasks and interact with users. However, these sessions cannot simply be replayed with new agents, because recorded user replies may no longer apply when an agent takes a different trajectory. We introduce SWE-WhatIf, which replays recorded sessions with new agents by modeling the user's intents, the criteria for satisfying them, and the conditions under which they arise. Using this model, a user simulator generates replies that adapt to unseen agent turns while remaining grounded in the recording. Across 89 real-world sessions, SWE-WhatIf generated the replies most similar to those of real users and matched the strongest baseline when sessions were rewritten. To test adaptation, we replay sessions with agents instructed to avoid or repeat actions that the recorded user pushed back on. SWE-WhatIf produced the highest win rate for avoiding these actions (66.3%), significantly above chance. We further demonstrate its utility by ranking five LLMs as coding agents, where the highest-ranked model depended on how users specified and developed their intents, and a study with 16 users, where replaying their own sessions changed 14 participants' rankings and informed their future agent use.

## Conditional Endorsement: Simulating How Adults with Different Skills Evaluate Canada's National AI Strategy

DevFeed: [Conditional Endorsement: Simulating How Adults with Different Skills Evaluate Canada's National AI Strategy](<https://devfeed.tech/articles/conditional-endorsement-simulating-how-adults-with-different-skills-evaluate-canada-s-national-ai-strategy-137396.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19111>)

Author: Dipto Das, Felix Leduc, Shion Guha

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [AI Chat](<https://devfeed.tech/topics/ai-chat.md>), [Learning](<https://devfeed.tech/topics/learning.md>), [inclusive design](<https://devfeed.tech/topics/inclusive-design.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-adoption](<https://devfeed.tech/tags/ai-adoption.md>), [ai-literacy](<https://devfeed.tech/tags/ai-literacy.md>), [ai-strategy](<https://devfeed.tech/tags/ai-strategy.md>), [ai-training](<https://devfeed.tech/tags/ai-training.md>), [canada](<https://devfeed.tech/tags/canada.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cy](<https://devfeed.tech/tags/cs-cy.md>), [cs-hc](<https://devfeed.tech/tags/cs-hc.md>), [digital-skills](<https://devfeed.tech/tags/digital-skills.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [policies](<https://devfeed.tech/tags/policies.md>), [skills](<https://devfeed.tech/tags/skills.md>)

### AI overview

In a simulation using 3,200 generative agents built from a weighted sample of PIAAC Cycle 2 respondents, agents supported nearly all 20 policies in Canada's 2026 AI strategy but were less confident that the policies would improve adult AI literacy or benefit them personally. The gap grew as modeled digital technology use declined: agents representing adults who had never used a digital device still endorsed policies but rarely expected personal benefit. Agents linked this conditional endorsement to participation costs, rights that may be difficult to exercise, and limited community control. The study argues that AI literacy policy should be designed and evaluated with adults who have the fewest digital skills in mind.

### Source excerpt

arXiv:2611.19111v1 Announce Type: new Abstract: Canada's 2026 national AI strategy, AI for All, commits to free AI training for everyone and to expanding business AI adoption, yet it is difficult to anticipate whether these policies will reach adults with uneven skills and circumstances. We ask how adults with diverse skills might rate these policies on support, effectiveness, and personal benefit, how their skills and circumstances shape these evaluations, and what implementation conditions they raise. We built 3,200 generative agents from a weighted sample of the Programme for the International Assessment of Adult Competencies (PIAAC) Cycle 2 respondents, collected their ratings and explanations for 20 policies, and analyzed dialogues between agents with contrasting ratings. The agents supported nearly every policy but were far less confident that they would improve adult AI literacy or benefit them personally. This gap widened as digital technology use declined: agents modeled on adults who had never used a digital device still endorsed the policies but rarely expected to benefit. Agents traced the gap to participation costs, hard-to-exercise rights, and limited community control, and their dialogues specified these conditions rather than resolving disagreement. We describe this pattern as conditional endorsement and argue that AI literacy policy should be designed and evaluated for adults with the fewest digital skills.

## Evaluating Feedback-Driven Black-Box Processes via Stochastic Modeling and Simulation

DevFeed: [Evaluating Feedback-Driven Black-Box Processes via Stochastic Modeling and Simulation](<https://devfeed.tech/articles/evaluating-feedback-driven-black-box-processes-via-stochastic-modeling-and-simulation-135908.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18477>)

Author: Mengfan Xu, Zirui Liu, Juan Zhai, Shiqing Ma, Barry Nelson

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>), [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [Fuzzing/Fuzz testing](<https://devfeed.tech/topics/fuzzing.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [black-box](<https://devfeed.tech/tags/black-box.md>), [bugs](<https://devfeed.tech/tags/bugs.md>), [case-studies](<https://devfeed.tech/tags/case-studies.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [develop](<https://devfeed.tech/tags/develop.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [feedback](<https://devfeed.tech/tags/feedback.md>), [fuzzing](<https://devfeed.tech/tags/fuzzing.md>), [guarantees](<https://devfeed.tech/tags/guarantees.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [markov](<https://devfeed.tech/tags/markov.md>), [markov-chain](<https://devfeed.tech/tags/markov-chain.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [mutation](<https://devfeed.tech/tags/mutation.md>), [processes](<https://devfeed.tech/tags/processes.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [software-engineering](<https://devfeed.tech/tags/software-engineering.md>)

### AI overview

The paper proposes a Markov-chain and simulation framework for evaluating sequential black-box policies that use system feedback to choose later inputs, even when the underlying system's structure is unknown. For mutation-based fuzzing, it models transitions through the mutation strategy and feedback through program execution. The authors describe new performance measures, sound estimators, and evaluation procedures with provable guarantees, then apply them to 9 fuzzers across 18 benchmarks and report case studies in 4 non-fuzzing domains. The supplied abstract does not give comparative results or details of those case studies.

### Source excerpt

arXiv:2611.18477v1 Announce Type: cross Abstract: We study feedback-driven black-box processes across software engineering and machine learning. These processes are inherently sequential: policies generate inputs, observe outputs/feedback from systems, and use the feedback to guide the design of subsequent inputs. While many policies are developed under structural assumptions on the underlying systems, many real-world systems operate without such knowledge, necessitating black-box policies that lack a unified evaluation framework. We introduce a stochastic framework that models and evaluates such policies using Markov chains and simulation, thereby connecting empirical practice with theory. We instantiate the framework in mutation-based fuzzing (widely used for discovering software bugs via sequential input mutation), by a novel Markov chain model of fuzzing whose transitions are governed by the mutation strategy and whose feedback is given by program execution. We develop a rigorous evaluation paradigm with new performance measures, sound estimators, and evaluation procedures with provable guarantees. Guided by the theory, we evaluate 9 fuzzers on 18 widely used fuzzing benchmarks and conduct case studies in 4 non-fuzzing domains. These results show that the framework provides a principled basis for evaluation while connecting to practice, with implications beyond fuzzing.

## A mesh-free deep energy method for phase-field modeling of thermally driven brittle fracture

DevFeed: [A mesh-free deep energy method for phase-field modeling of thermally driven brittle fracture](<https://devfeed.tech/articles/a-mesh-free-deep-energy-method-for-phase-field-modeling-of-thermally-driven-brittle-fracture-135812.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17630>)

Author: Han Zhang, Mehrisadat Makki Alamdari, Babak Shahbodagh, Mohammad Vahab, Cosmin Anitescu, Timon Rabczuk, Elena Atroshchenko

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Deep learning](<https://devfeed.tech/topics/deep-learning.md>), [Physics-guided deep learning](<https://devfeed.tech/topics/physics-guided-deep-learning.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Finite Element Method (FEM)](<https://devfeed.tech/topics/finite-element-method.md>)

Tags: [array](<https://devfeed.tech/tags/array.md>), [arrays](<https://devfeed.tech/tags/arrays.md>), [arrest](<https://devfeed.tech/tags/arrest.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [ceramic](<https://devfeed.tech/tags/ceramic.md>), [cond-mat-mtrl-sci](<https://devfeed.tech/tags/cond-mat-mtrl-sci.md>), [crack](<https://devfeed.tech/tags/crack.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deep](<https://devfeed.tech/tags/deep.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [fields](<https://devfeed.tech/tags/fields.md>), [free](<https://devfeed.tech/tags/free.md>), [functional](<https://devfeed.tech/tags/functional.md>), [heat-equation](<https://devfeed.tech/tags/heat-equation.md>), [loading](<https://devfeed.tech/tags/loading.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [neural](<https://devfeed.tech/tags/neural.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [reference](<https://devfeed.tech/tags/reference.md>), [spacing](<https://devfeed.tech/tags/spacing.md>), [temperature](<https://devfeed.tech/tags/temperature.md>)

### AI overview

The proposed mesh-free deep energy method predicts spontaneous crack formation under transient thermal loading without prescribed crack paths, nucleation sites, or crack-adapted meshes. Separate multiresolution networks represent displacement and phase fields and temperature; energy terms are estimated at integration points redrawn each iteration. Restricting irreversibility to the crack set, carrying optimizer state across load steps, and decaying learning rates within steps help limit spurious damage. Reported results include initiation peak loads on two notched plates that closely match an independent finite element reference, and crack patterns in glass and ceramic cases consistent with stability predictions or published observations and benchmarks. However, crack arrays in a quenched slab and annulus are denser than finite element results on the same material field.

### Source excerpt

arXiv:2611.17630v1 Announce Type: new Abstract: Phase-field simulation of thermally driven fracture requires resolving localized crack bands whose paths are unknown in advance and thermal boundary layers whose thickness evolves during the transient. Neural energy-based computations of thermal fracture have so far started from defects placed in advance. This paper proposes a mesh-free deep energy method based on multiresolution neural representations that predicts spontaneous crack nucleation, crack spacing, and selective crack propagation and arrest under transient thermal loading. Two networks, each with its own multiresolution encoding, represent the displacement and phase fields and the transient temperature, and the mechanical energy and the incremental functional of the backward Euler heat equation are estimated on integration points redrawn at every iteration. Restricting irreversibility to the crack set, carrying the optimizer state across load steps and decaying the learning rates within each step help prevent spurious damage accumulation. On two notched plates the initiation peak loads agree closely with an independent finite element reference. On a quenched glass strip under an analytical temperature field the crack path changes from straight to oscillatory and then to branched, with an oscillation threshold close to the linear stability prediction. Under a prescribed boundary temperature a quenched ceramic slab forms a crack array of the type observed in experiment, with a spacing close to that of a published benchmark. On the slab and a quenched annulus the arrays are denser than those of a finite element computation on the same material field. No crack paths, nucleation sites or crack-adapted meshes are prescribed.

## CPM-MultiAgent: A CPM-Grounded Appraisal Framework for Simulating Dynamic Patient Emotional Evolution in Healthcare Dialogue

DevFeed: [CPM-MultiAgent: A CPM-Grounded Appraisal Framework for Simulating Dynamic Patient Emotional Evolution in Healthcare Dialogue](<https://devfeed.tech/articles/cpm-multiagent-a-cpm-grounded-appraisal-framework-for-simulating-dynamic-patient-emotional-evolution-in-healthcare-dialogue-134996.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2607.07824>)

Author: Jingyao Cai, Shuaijun Liu, Xiaowan Li, Yutong Guo, Abdul Rehman, Qintian, Thomas Dolby, Sue M Green, Xiaosong Yang

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [communication](<https://devfeed.tech/tags/communication.md>), [cpm](<https://devfeed.tech/tags/cpm.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ma](<https://devfeed.tech/tags/cs-ma.md>), [emotion](<https://devfeed.tech/tags/emotion.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [framework](<https://devfeed.tech/tags/framework.md>), [grounded](<https://devfeed.tech/tags/grounded.md>), [healthcare](<https://devfeed.tech/tags/healthcare.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [multi-agent](<https://devfeed.tech/tags/multi-agent.md>), [multiagent](<https://devfeed.tech/tags/multiagent.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

CPM-MultiAgent models patient emotions as changing in response to healthcare professionals' communication, providing interactional feedback across dialogue turns. It identifies healthcare-related triggers, applies structured Component Process Model appraisal, and integrates an updated emotional state in light of the patient profile, clinical context, and prior emotion. The framework's emotion taxonomy draws on medical literature and expert input. Its evaluation combines student-led conversations and controlled trigger cases with nursing-expert assessments, LLM-judge comparisons, component ablations, backbone checks, and student feedback. The supplied text describes the framework and evaluation design but gives no results.

### Source excerpt

arXiv:2607.07824v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) enable patient simulation for healthcare communication training, where learners practice responding to clinical information, concerns, and emotional reactions. However, existing patient simulation and affective dialogue systems often represent patient emotions as static attributes or focus on recognizing emotions and generating empathetic responses. They provide limited support for modeling how a simulated patient's emotional state evolves in response to a healthcare professional's communication. Changes in patient emotion constitute interactional feedback that learners must recognize and respond to across dialogue turns. We draw on the Component Process Model (CPM), a psychological theory that explains emotion as a dynamic process shaped by event appraisal. We propose CPM-MultiAgent, a CPM-grounded multi-agent framework for dynamic patient emotion simulation in healthcare communication training. The framework uses an emotion taxonomy informed by medical literature and expert input, and updates emotional states through healthcare-related trigger identification, structured CPM appraisal, and emotion-state integration, accounting for the patient's profile, clinical context, and prior emotional state. We evaluate the framework through student-led conversations and controlled trigger cases, combining nursing-expert assessments, LLM-judge comparisons, component ablations, backbone checks, and student feedback.

[Next page](<https://devfeed.tech/topics/simulation.md?cursor=WyIyMDI2LTExLTE2VDA1OjAwOjAwKzAwOjAwIiwgIjUxYTgxNDI3LTZiNmEtNGJmZi05Njg0LWM4Yjc3MDFiN2Q5YyJd>)