On the minimum information checkerboard copulas under fixed Kendall's rank correlation

06/02/2023
by   Issey Sukeda, et al.
0

Copulas have become very popular as a statistical model to represent dependence structures between multiple variables in many applications. Given a finite number of constraints in advance, the minimum information copula is the closest to the uniform copula when measured in Kullback-Leibler divergence. For these constraints, the expectation of moments such as Spearman's rho are mostly considered in previous researches. These copulas are obtained as the optimal solution to convex programming. On the other hand, other types of correlation have not been studied previously in this context. In this paper, we present MICK, a novel minimum information copula where Kendall's rank correlation is specified. Although this copula is defined as the solution to non-convex optimization problem, we show that the uniqueness of this copula is guaranteed when correlation is small enough. We also show that the family of checkerboard copulas admits representation as non-orthogonal vector space. In doing so, we observe local and global dependencies of MICK, thereby unifying results on minimum information copulas.

READ FULL TEXT
research
01/28/2022

Simplifying deflation for non-convex optimization with applications in Bayesian inference and topology optimization

Non-convex optimization problems have multiple local optimal solutions. ...
research
11/20/2017

Solution of network localization problem with noisy distances and its convergence

The network localization problem with convex and non-convex distance con...
research
01/19/2019

Algebraic Properties of Wyner Common Information Solution under Graphical Constraints

The Constrained Minimum Determinant Factor Analysis (CMDFA) setting was ...
research
05/31/2016

Scalable and Flexible Multiview MAX-VAR Canonical Correlation Analysis

Generalized canonical correlation analysis (GCCA) aims at finding latent...
research
04/22/2016

Non-convex Global Minimization and False Discovery Rate Control for the TREX

The TREX is a recently introduced method for performing sparse high-dime...
research
01/15/2021

Local Search Algorithms for Rank-Constrained Convex Optimization

We propose greedy and local search algorithms for rank-constrained conve...

Please sign up or login with your details

Forgot password? Click here to reset