2011
DOI: 10.48550/arxiv.1111.0576
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On parametric families for sampling binary data with specified mean and correlation

Christian Schäfer

Abstract: We discuss a class of binary parametric families with conditional probabilities taking the form of generalized linear models and show that this approach allows to model high-dimensional random binary vectors with arbitrary mean and correlation. We derive the special case of logistic conditionals as an approximation to the Ising-type exponential distribution and provide empirical evidence that this parametric family indeed outperforms competing approaches in terms of feasible correlations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 27 publications
0
3
0
Order By: Relevance
“…are equal the cumulative distribution function of the multivariate normal with respect to the entries indexed by I (see Schäfer (2012) for a more detailed discussion). In particular, the first and second moments are…”
Section: Gaussian Copula Familymentioning
confidence: 99%
See 2 more Smart Citations
“…are equal the cumulative distribution function of the multivariate normal with respect to the entries indexed by I (see Schäfer (2012) for a more detailed discussion). In particular, the first and second moments are…”
Section: Gaussian Copula Familymentioning
confidence: 99%
“…Indeed, stronger diagonal dominance in F corresponds to exponential quadratic distributions π(γ) := exp(γ Fγ) γ∈B d exp(γ Fγ) having lower dependencies between the components of γ. We can analytically derive a parameter A ∈ R d×d for a logistic conditionals family q A that approximates π(γ) where the quality of the approximation increases as the diagonal of F becomes more dominant Schäfer (2012). We can accelerate the sequential Monte Carlo algorithm by initializing the system from q A instead of U B d .…”
Section: Diagonalmentioning
confidence: 99%
See 1 more Smart Citation