Sinkhorn divergence defines ambiguity sets that make distributionally robust linear quadratic control over linear policies solvable via convex programming even with safety constraints.
Regret-optimal estimation and control,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A nested dynamic program using the Regret-Bellman operator computes regret-optimal policies that interpolate between MDP and robust controllers for finite-state systems.
citing papers explorer
-
Sinkhorn Ambiguity Sets for Distributionally Robust Control: Convexity, Weak Compactness, and Tractability
Sinkhorn divergence defines ambiguity sets that make distributionally robust linear quadratic control over linear policies solvable via convex programming even with safety constraints.
-
Regret-Optimal Control for Finite-State Systems
A nested dynamic program using the Regret-Bellman operator computes regret-optimal policies that interpolate between MDP and robust controllers for finite-state systems.