We show that this method can solve SDPs in polynomial time in a smoothed analysis setting.

Wethus establish that policy iteration on reward-robust MDPs can have the same time complexityasonregularizedMDPs.

As with all data-driven approaches, BO is prone to cases where the given data shifts from the data of interest.

As with all data-driven approaches, BO is prone to cases where the given data shifts from the data of interest.