This paper presents a nonadaptive approach to robust nonlinear output regulation for general nonlinear systems with high relative degree in an output‑feedback setting. The design combines an input‑driven filter, a generic internal model, and a recursive backstepping law, transforming the regulation problem into robust input‑to‑state stabilization of an augmented error system. Under standard exosystem assumptions and a minimum‑phase input‑to‑state stability condition, the authors prove global asymptotic regulation and provide explicit inequalities for selecting design gains, demonstrating the method on a benchmark Duffing system.
arXiv:2506. 01226v3 Announce Type: replace-cross Abstract: We study parameterizations of stabilizing nonlinear policies for learning-based control.
arXiv:2607. 11122v1 Announce Type: cross Abstract: Implicit neural controllers (INCs) are static feedback laws that are evaluated through an algebraic fixed point {equation}; they include as special cases neural network controllers.
arXiv:2608. 06419v1 Announce Type: cross Abstract: In this paper, we address the certification of datadriven feedforward control for periodic tracking of unknown nonlinear systems under partial state measurements.
arXiv:2608.30431v1 Announce Type: cross Abstract: By focusing on algorithmic stability as a means of establishing out-of-sample bounds, we provide a system-theoretic interpretation of generalization...
arXiv:2607. 10026v1 Announce Type: cross Abstract: This paper proposes a new notion of robust invertibility for nonlinear dynamical systems, and introduces constructive parameterizations of recurrent neural network which are robustly invertible by design.
The paper studies least squares parameter estimation for discrete‑time, unstable, closed‑loop nonlinear stochastic systems with linearly parametrised uncertainty and additive i.i.d. process noise. By perturbing the control policy with exploratory input and assuming a sub‑exponential input‑to‑state growth property, the authors derive non‑asymptotic bounds on the estimation error whenever the state trajectory remains in an informative region of the state space. When the entire state space is informative, the bounds hold with high probability for all time steps, and the authors illustrate the applicability of their results with examples that extend beyond existing work.
The paper introduces a structured method for learning linear operators in control systems using data. It leverages the framework of (semi)groups for evolution equations to establish structural assumptions and applies inverse‑problems theory to analyze learning algorithms, revealing error decompositions, convergence guarantees, and optimal regularization. Focusing on bounded operators on Hilbert spaces, the authors derive a convergent estimator for time‑varying systems, illustrating the practical power of their approach.
arXiv:2606. 09047v1 Announce Type: cross Abstract: A classical universal stabilization formula offers the practitioner no design freedom: it is a single, parameter-free object.
arXiv:2608. 13651v1 Announce Type: cross Abstract: We solve exactly a fundamental problem of adaptive control against adversarial disturbances: regulate the scalar system $x_{t+1} = ax_t + u_t + w_t$, $x_0=0$, $\|w\|_\infty \le 1$, where the constant pole $a \in [-\Delta, \Delta]$ is unknown in sign and magnitude and $\Delta$ is arbitrarily large.
arXiv:2606. 11798v1 Announce Type: cross Abstract: In this paper, we develop a continuous-time model-free reinforcement learning algorithm to learn deterministic equilibrium policies in general time-inconsistent control problems.
arXiv:2606. 09929v1 Announce Type: cross Abstract: Physical reservoir computing harnesses nonlinear mechanical dynamics but, by convention, freezes the substrate and trains only a linear readout, presuming the substrate is not usefully trainable.
arXiv:2607. 02050v1 Announce Type: new Abstract: Motivated by the challenge of stabilizing a general unknown linear dynamical system (LDS) from observations, we study the natural prerequisite of online prediction.