We present different robust frameworks using probabilistic ambiguity descriptions of the input data in the least squares problems. The three probability ambiguity descriptions are given by: (1) confidence interval over the first two moments; (2) bounds on the probability measure with moments constraints; (3) confidence interval over the probability measure by using the Kantorovich probability distance. For these three cases we derive equivalent formulations and show that the resulting optimization problem can be solved efficiently.
Article
View Models and Algorithms for Distributionally Robust Least Squares Problems