资源分类
》 资源 》论文》Wasserstein Distributionally Robust Kalman Filtering

Wasserstein Distributionally Robust Kalman Filtering

2020-02-14 | |  109 |   110 |   0

Abstract

 We study a distributionally robust mean square error estimation problem over a nonconvex Wasserstein ambiguity set containing only normal distributions. We show that the optimal estimator and the least favorable distribution form a Nash equilibrium. Despite the non-convex nature of the ambiguity set, we prove that the estimation problem is equivalent to a tractable convex program. We further devise a Frank-Wolfe algorithm for this convex program whose direction-searching subproblem can be solved in a quasi-closed form. Using these ingredients, we introduce a distributionally robust Kalman filter that hedges against model risk.

上一篇：Adversarial Attacks on Stochastic Bandits

下一篇：Pipe-SGD: A Decentralized Pipelined SGD Framework for Distributed Deep Net Training

用户评价
全部评价

热门资源

  • Deep Cross-media ...

    Cross-media retrieval is a research hotspot in ...

  • Regularizing RNNs...

    Recently, caption generation with an encoder-de...

  • Learning Expressi...

    Facial expression is temporally dynamic event w...

  • Attributed Graph ...

    Graph clustering is a fundamental task which di...

  • Compact MDDs for ...

    Pseudo-Boolean (PB) constraints are usually en...