Table of Contents
Fetching ...

Beyond KL-divergence: Risk Aware Control Through Cross Entropy and Adversarial Entropy Regularization

Menno van Zutphen, Domagoj Herceg, Duarte J. Antunes

TL;DR

The paper tackles robust control under distributional uncertainty by introducing a risk-aware regularization that combines a cross-entropy term $H_c(p,r)$ and an entropy term $H(p)$ with weights $\gamma_H$ and $\gamma_E$. This yields a DP-like minsoftmax framework in which the adversary's distribution has a closed-form softmax form $p_k^{*}(w|x,u) \propto e^{\alpha_k/\gamma_E}$ with $\alpha_k=\gamma_H\log r(w|x,u) + J_{k+1}(f(x,u,w))$, enabling efficient computation of the optimal policy. In the linear-quadratic Gaussian setting, the method recovers $\mathcal{H}_\infty$-control in the infinite-horizon limit and can interpolate among ML-Certainty Equivalence, KL-regularization, and risk-sensitive controllers via parameter tuning. The approach is demonstrated on a numerical irrigation example, showing how parameter choices trade off conservatism against empirical disturbance information. Overall, minsoftmax provides a flexible, analytically tractable framework that unifies several robust control paradigms for practical, uncertainty-aware decision making.

Abstract

While the idea of robust dynamic programming (DP) is compelling for systems affected by uncertainty, addressing worst-case disturbances generally results in excessive conservatism. This paper introduces a method for constructing control policies robust to adversarial disturbance distributions that relate to a provided empirical distribution. The character of the adversary is shaped by a regularization term comprising a weighted sum of (i) the cross-entropy between the empirical and the adversarial distributions, and (ii) the entropy of the adversarial distribution itself. The regularization weights are interpreted as the likelihood factor and the temperature respectively. The proposed framework leads to an efficient DP-like algorithm -- referred to as the minsoftmax algorithm -- to obtain the optimal control policy, where the disturbances follow an analytical softmax distribution in terms of the empirical distribution, temperature, and likelihood factor. It admits a number of control-theoretic interpretations and can thus be understood as a flexible tool for integrating complementary features of related control frameworks. In particular, in the linear model quadratic cost setting, with a Gaussian empirical distribution, we draw connections to the well-known $\mathcal{H}_{\infty}$-control. We illustrate our results through a numerical example.

Beyond KL-divergence: Risk Aware Control Through Cross Entropy and Adversarial Entropy Regularization

TL;DR

The paper tackles robust control under distributional uncertainty by introducing a risk-aware regularization that combines a cross-entropy term and an entropy term with weights and . This yields a DP-like minsoftmax framework in which the adversary's distribution has a closed-form softmax form with , enabling efficient computation of the optimal policy. In the linear-quadratic Gaussian setting, the method recovers -control in the infinite-horizon limit and can interpolate among ML-Certainty Equivalence, KL-regularization, and risk-sensitive controllers via parameter tuning. The approach is demonstrated on a numerical irrigation example, showing how parameter choices trade off conservatism against empirical disturbance information. Overall, minsoftmax provides a flexible, analytically tractable framework that unifies several robust control paradigms for practical, uncertainty-aware decision making.

Abstract

While the idea of robust dynamic programming (DP) is compelling for systems affected by uncertainty, addressing worst-case disturbances generally results in excessive conservatism. This paper introduces a method for constructing control policies robust to adversarial disturbance distributions that relate to a provided empirical distribution. The character of the adversary is shaped by a regularization term comprising a weighted sum of (i) the cross-entropy between the empirical and the adversarial distributions, and (ii) the entropy of the adversarial distribution itself. The regularization weights are interpreted as the likelihood factor and the temperature respectively. The proposed framework leads to an efficient DP-like algorithm -- referred to as the minsoftmax algorithm -- to obtain the optimal control policy, where the disturbances follow an analytical softmax distribution in terms of the empirical distribution, temperature, and likelihood factor. It admits a number of control-theoretic interpretations and can thus be understood as a flexible tool for integrating complementary features of related control frameworks. In particular, in the linear model quadratic cost setting, with a Gaussian empirical distribution, we draw connections to the well-known -control. We illustrate our results through a numerical example.
Paper Structure (12 sections, 2 theorems, 61 equations, 5 figures, 1 algorithm)

This paper contains 12 sections, 2 theorems, 61 equations, 5 figures, 1 algorithm.

Key Result

Theorem 1

Consider problem eq:minsoftmaxproblem, eq:minsoftmaxcost. Let $J_h(x) = g_h(x)$, then consider the following recursion for $k\in \{h-1,h-2,\dots,0\}$. We find that an optimal adversary of eq:dp_solution_original, for every $(x,u,k)\in\mathcal{X}\times\mathcal{U}\times\mathcal{K}$, can be described in closed form as where which, when substituted together into eq:dp_solution_original, yields the

Figures (5)

  • Figure 1: By selecting $(\gamma_{H},\gamma_{E})$, we can traverse the design space of proposed minsoftmax controllers. Selecting a policy that is close to (and in the limit boils down to), e.g., $\mathcal{H}_\infty$-control, minimax control (MM), stochastic dynamic programming (SDP, see Remark \ref{['rem:SDP']}), maximum likelihood certainty equivalence (ML-CE, see Remark \ref{['rem:ml-ce']}), or risk-sensitive control (see Remark \ref{['rem:risk-sensitive']}), but also inherits interesting features from the others.
  • Figure 4: An example system at time $k$, where the cost-to-go happens to coincide with the disturbance as $J_{k+1}(w_{k})=w_{k}(u_k)$, and its dynamics are simply $x_{k+1}=w_k(u_k)$, with $u_k\in\{0,1\}$. The distributions $r(w_k|u_k)$ over $w_k\in\mathcal{W}=\{0,1,\dots,10000\}$, as a function of $u_k$ are obtained from (noisy) data and displayed in the figure. An engineer who aims to control this system in a semi-robust way using the KL-regularized framework is encouraged to reduce $\gamma_{E}$.
  • Figure 5: A second example system at time $k$, where the cost-to-go also happens to coincide with the disturbance as $J_{k+1}(w_{k})=w_k$, and its dynamics are state independent $x_{k+1}=w_k(u_k)$. This time, the distribution $r$ over $w_k\in\mathcal{W}=\{0,1,\dots,10000\}$ displayed in the figure is interpreted as an a-priori known distribution of the disturbance. An engineer who aims to control this system in a semi-robust way using the $\mathcal{H}_\infty$-framework is encouraged to increase $\gamma_{E}$.
  • Figure : ----- mean of simulated trajectories $\sigma$ region of simulated trajectories $2\sigma$ region of simulated trajectories
  • Figure : empirical disturbance distribution adversarial disturbance distribution

Theorems & Definitions (9)

  • Remark 1
  • Theorem 1
  • proof
  • Remark 2: Recovering maximum likelihood certainty equivalence control
  • Remark 3: Recovering risk-sensitive control
  • Remark 4: Recovering stochastic dynamic programming
  • Theorem 2
  • proof
  • Remark 5: Interpretation: $\mathcal{H}_\infty$-control equivalent algorithm for discrete spaces