Distributionally Robust Graphical Models
Not on the map. Why?
Abstract (arXiv)
In many structured prediction problems, complex relationships between variables are compactly defined using graphical structures. The most prevalent graphical prediction methods---probabilistic graphical models and large margin methods---have their own distinct strengths but also possess significant drawbacks. Conditional random fields (CRFs) are Fisher consistent, but they do not permit integration of customized loss metrics into their learning process. Large-margin models, such as structured support vector machines (SSVMs), have the flexibility to incorporate customized loss metrics, but lack Fisher consistency guarantees. We present adversarial graphical models (AGM), a distributionally robust approach for constructing a predictor that performs robustly for a class of data distributions defined using a graphical structure. Our approach enjoys both the flexibility of incorporating customized loss metrics into its design as well as the statistical guarantee of Fisher consistency. We present exact learning and prediction algorithms for AGM with time complexity similar to existing graphical models and show the practical benefits of our approach with experiments.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Nov 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2.
3 papers.
- 2021Distributionally Robust Learningcited by 44
- 2023Uncertainty-Aware Robust Learning on Noisy Graphscited by 6
- 2023Distributionally Robust Skeleton Learning of Discrete Bayesian Networkscited by 0
- 2023Distributionally Robust Skeleton Learning of Discrete Bayesian Networks10 Nov 2023
- 2023Uncertainty-Aware Robust Learning on Noisy Graphs14 Jun 2023
- 2021Distributionally Robust Learning20 Aug 2021