On the differentiability of the value function of switched linear systems under arbitrary and controlled switching
Guillaume O. Berger
TL;DR
The paper addresses differentiability of the optimal and worst-case value functions $J^\star$ and $J^\circ$ for switched linear systems. It proves Lipschitz continuity when the stage cost $c$ is Lipschitz and the joint spectral radius is below one, establishing a natural regularity baseline. The main contribution is a constructive demonstration that these value functions can be non-differentiable on dense subsets, even for smooth costs, by engineering a system whose optimal/worst-case switching induces an Interval Exchange Map with chaotic dynamics; this persists in higher dimensions and can be realized with rational matrices. The findings imply that exact computation of these value functions may require non-differentiable templates and highlight fundamental limits for optimization and reinforcement learning methods in this class of systems.
Abstract
This paper studies the differentiability of the value function of switched linear systems under arbitrary switching and controlled switching, referred to as worst-case and optimal value functions respectively. First, we show that the value functions are Lipschitz continuous, when the cost function is Lipschitz continuous. Then, as the central contribution of this work, we show with examples that each of these functions can be non-differentiable on dense subsets of the state space, even if the cost function is smooth and Lipschitz continuous. This has implications for optimal control and reinforcement learning since it implies that the exact computation of these value functions requires templates involving functions that are non-differentiable on dense subsets.
