A Copula Graphical Model for Multi-Attribute Data using Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Motivated by modern data forms such as images and multi-view data, the multi-attribute graphical model aims to explore the conditional independence structure among vectors. Under the Gaussian assumption, the conditional independence between vectors is characterized by blockwise zeros in the precision matrix. To relax the restrictive Gaussian assumption, in this paper, we introduce a novel semiparametric multi-attribute graphical model based on a new copula named Cyclically Monotone Copula. This new copula treats the distribution of the node vectors as multivariate marginals and transforms them into Gaussian distributions based on the optimal transport theory. Since the model allows the node vectors to have arbitrary continuous distributions, it is more flexible than the classical Gaussian copula method that performs coordinatewise Gaussianization. We establish the concentration inequalities of the estimated covariance matrices and provide sufficient conditions for selection consistency of the group graphical lasso estimator. For the setting with high-dimensional attributes, a {Projected Cyclically Monotone Copula} model is proposed to address the curse of dimensionality issue that arises from solving high-dimensional optimal transport problems. Numerical results based on synthetic and real data show the efficiency and flexibility of our methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 57 references that are in the map. First posted on arXiv 10 Apr 2024.
Builds on
11 of 57 references.
References · 11
- 2018Generative Modeling using the Sliced Wasserstein Distancecited by 108
- 2019Subspace Robust Wasserstein Distancescited by 89
- 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
- 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 52
- 2020A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distancecited by 27
- 2013On Graphical Models via Univariate Exponential Family Distributionscited by 26
- 2019Multivariate Rank-based Distribution-free Nonparametric Testing using Measure Transportationcited by 24
- 2021Large-scale optimal transport map estimation using projection pursuitcited by 16
- 2017Learning Graphs with Monotone Topology Properties and Multiple Connected Componentscited by 13
- 2021High-dimensional Functional Graphical Model Structure Learning via Neighborhood Selection Approachcited by 7
- 2021An additive graphical model for discrete datacited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.