Searcharxiv⌕ Search

arXiv · 2610.21693

Policy-Gradient Transfer under a Shared State Estimator

Abstract

This paper considers the problem of policy-gradient transfer from a simulator to a physical plant when both are controlled through the same fixed state estimator. The plant and the simulator are partially observed nonlinear systems with additive Gaussian noise of common known covariance whose dynamics and observation models differ, and the controller is a squashed Gaussian policy with uniformly bounded latent mean and first two parameter derivatives. We derive a bound on the difference between the plant and simulator policy gradients that is linear in the noise-weighted model error and requires no estimator-accuracy guarantee, because the shared estimator is a common post-processing of the measurements and the data-processing inequality compares the trajectory laws without an estimation-error term. Based on this bound, we derive an occupancy-weighted refinement, a sufficient condition for the simulator gradient to be an ascent direction for the plant, and a bound on the expected squared plant gradient at a random iterate of a finite simulator-training run with optimization, truncation and model-error terms. Simulation results on a scalar system and a pendulum are presented to validate the theoretical results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dongming Wang, Wei Ren. 2026-10-15. Policy-Gradient Transfer under a Shared State Estimator. https://arxiv.org/abs/2610.21693

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

An Introduction to Model-Based Systems Engineering and Hetero-functional Graph Theory for Hydrological Systems of Systems

This introductory overview describes a unified modeling framework for representing interconnected environmental systems using Model-Based Systems Engineering and Hetero-functional Graph Theory. Existing environmental models encode rich structural and process-level information, yet much of this knowledge remains implicit within domain-specific formulations. This paper demonstrates how such information can be formalized into a consistent ontology that explicitly represents system structure, function, and interconnections. Using illustrative hydrological examples, the tutorial illustrates how conventional process models can be translated into a scalable system-of-systems representation. Agricultural nitrogen applied to land is represented explicitly as the point at which human decisions enter the hydrological system, illustrating how models of human systems can be coupled to hydrological models within the same representation. These examples highlight how embedded relationships in existing models can be made explicit and computationally tractable. Using simplified examples, the overview provides a foundation for integrating heterogeneous models across environmental and engineered domains. More broadly, this work offers a step-by-step introduction to a generalizable modeling framework for complex systems.

eess.SY↗

Reinforcement Learning based Traffic Signal Control for Queue Minimization: From Lane-based to Laneless Traffic

Efficient traffic signal control (TSC) is essential for reducing congestion and delays. Traditional TSC methods struggle to capture the dynamics of laneless, heterogeneous traffic. We propose a reinforcement learning (RL) based adaptive TSC framework whose reward depends only on approach-level queue length, motivated by the difficulty of obtaining per-vehicle measurements in laneless traffic, and evaluate it using SUMO on a conventional lane-based, homogeneous (LBHO) intersection and on a non-orthogonal laneless, heterogeneous (LLHE) intersection. On the LBHO site, the lowest mean configuration has about 23\% lower mean queue length than a Dynamic Webster baseline, and the unselected Full-State configuration about 15\% lower. On the LLHE site, all RL configurations have 66-73\% lower mean queue length than a Dynamic Webster baseline under nominal demand, and 63--74\% lower under two higher-demand scenarios evaluated without retraining. Our algorithm also outperforms actuated control and a RESCO-DQN baseline on mean queue length. We additionally release a laneless, heterogeneous-vehicle SUMO framework integrated with RL based signal control, to our knowledge the first such open implementation on a current SUMO version.

eess.SY↗

A Deep State-Space Model Compression Method using Upper Bound on Output Error

We study deep state-space models (Deep SSMs) that contain linear quadratic-output (LQO) systems as internal blocks and present a compression method with a provable output error guarantee. We first derive an upper bound on the output error between two Deep SSMs and show that the bound can be expressed in terms of the $h^2$-error norms between the layerwise LQO systems. In particular, we show that reducing the $h^2$ approximation errors of the LQO systems placed in shallow layers is effective in reducing the derived upper bound on the output error. Next, we formulate an optimization problem for the derived upper bound and develop a gradient-based MOR method. In the numerical experiments, using the IMDb task from the LRA benchmark, we demonstrate the effectiveness of the proposed upper-bound-based compression method. In particular, we show that the number of trainable parameters can be reduced by approximately 60\% without retraining while maintaining the performance of the original model.

eess.SY↗