Binary Expansion Group Intersection Network

• URL: http://arxiv.org/abs/2603.24763v2
• Date: Fri, 27 Mar 2026 03:38:17 GMT
• Title: Binary Expansion Group Intersection Network
• Abstract summary: We show that conditional independence is equivalent to a sparse linear representation of conditional expectations.<n>The resulting graph is indexed by the intersection of multiplicative groups of binary interactions.<n>This viewpoint treats data bits as atoms and local BEGIN molecules as building blocks for large Markov random fields.
• Score: 7.546982882975851
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Conditional independence is central to modern statistics, but beyond special parametric families it rarely admits an exact covariance characterization. We introduce the binary expansion group intersection network (BEGIN), a distribution-free graphical representation for multivariate binary data and bit-encoded multinomial variables. For arbitrary binary random vectors and bit representations of multinomial variables, we prove that conditional independence is equivalent to a sparse linear representation of conditional expectations, to a block factorization of the corresponding interaction covariance matrix, and to block diagonality of an associated generalized Schur complement. The resulting graph is indexed by the intersection of multiplicative groups of binary interactions, yielding an analogue of Gaussian graphical modeling beyond the Gaussian setting. This viewpoint treats data bits as atoms and local BEGIN molecules as building blocks for large Markov random fields. We also show how dyadic bit representations allow BEGIN to approximate conditional independence for general random vectors under mild regularity conditions. A key technical device is the Hadamard prism, a linear map that links interaction covariances to group structure.

Related papers

• Sample Complexity of Multicalibration for Multilevel Properties [52.27687531970317]
  We study multicalibration for a sequence of $k$ properties in which each property is identifiable once the preceding properties are fixed.<n>Even with only polylogarithmically many binary groups, achieving multicalibration error $varepsilon$ requires $widetilde(varepsilon-(k+2))$ samples.
  arXiv  Detail & Related papers  (2026-08-04T23:38:54Z)
• A Difference Operator Approach to Quantum Random Walks: Parseval Identity, Krawtchouk Matrices, and Hermite Limits [0.0]
  We study the one-dimensional quantum random walk (QRW) with the Hadamard coin.<n>Explicit expressions are obtained for the probability amplitudes a(n,k) and b(n,k)<n>We prove by induction that the amplitudes satisfy a Parseval identity sum (a2+b2)=2n-1.
  arXiv  Detail & Related papers  (2026-07-24T04:23:13Z)
• Any-Subgroup Equivariant Networks via Symmetry Breaking [47.72921214239821]
  equivariant architectures are usually highly constrained, designed for symmetries chosen a priori.<n>This precludes the development of flexible, multi-modal foundation models capable of processing diverse data equivariantly.<n>We build a single model that can be simultaneously equivariant to several groups, simply by modulating a certain auxiliary input feature.
  arXiv  Detail & Related papers  (2026-03-19T21:30:41Z)
• A Copula Graphical Model for Multi-Attribute Data using Optimal Transport [9.817170209575346]
  We introduce a novel semiparametric multi-attribute graphical model based on a new copula named Cyclically Monotone Copula. For the setting with high-dimensional attributes, a Projected Cyclically Monotone Copula model is proposed to address the curse of dimensionality issue.
  arXiv  Detail & Related papers  (2024-04-10T04:49:00Z)
• A class of 2x2 correlated random-matrix models with Brody spacing distribution [0.0]
  A class of 2x2 random-matrix models is introduced for which the Brody distribution is the eigenvalue spacing distribution.<n>The random matrices introduced here differ from those of the Gaussian Orthogonal Ensemble (GOE) in three important ways.
  arXiv  Detail & Related papers  (2023-08-03T03:11:54Z)
• Generalized Precision Matrix for Scalable Estimation of Nonparametric Markov Networks [11.77890309304632]
  A Markov network characterizes the conditional independence structure, or Markov property, among a set of random variables. In this work, we characterize the conditional independence structure in general distributions for all data types. We also allow general functional relations among variables, thus giving rise to a Markov network structure learning algorithm.
  arXiv  Detail & Related papers  (2023-05-19T01:53:10Z)
• Diagonal Nonlinear Transformations Preserve Structure in Covariance and Precision Matrices [3.652509571098291]
  For a certain class of non-Gaussian distributions, correspondences still hold, exactly for the covariance and approximately for the precision. The distributions -- sometimes referred to as "nonparanormal" -- are given by diagonal transformations of multivariate normal random variables.
  arXiv  Detail & Related papers  (2021-07-08T22:31:48Z)
• Coordinate Independent Convolutional Networks -- Isometry and Gauge Equivariant Convolutions on Riemannian Manifolds [70.32518963244466]
  A major complication in comparison to flat spaces is that it is unclear in which alignment a convolution kernel should be applied on a manifold. We argue that the particular choice of coordinatization should not affect a network's inference -- it should be coordinate independent. A simultaneous demand for coordinate independence and weight sharing is shown to result in a requirement on the network to be equivariant.
  arXiv  Detail & Related papers  (2021-06-10T19:54:19Z)
• Building powerful and equivariant graph neural networks with structural message-passing [74.93169425144755]
  We propose a powerful and equivariant message-passing framework based on two ideas. First, we propagate a one-hot encoding of the nodes, in addition to the features, in order to learn a local context matrix around each node. Second, we propose methods for the parametrization of the message and update functions that ensure permutation equivariance.
  arXiv  Detail & Related papers  (2020-06-26T17:15:16Z)
• Generalizing Convolutional Neural Networks for Equivariance to Lie Groups on Arbitrary Continuous Data [52.78581260260455]
  We propose a general method to construct a convolutional layer that is equivariant to transformations from any specified Lie group. We apply the same model architecture to images, ball-and-stick molecular data, and Hamiltonian dynamical systems.
  arXiv  Detail & Related papers  (2020-02-25T17:40:38Z)
• Neural Bayes: A Generic Parameterization Method for Unsupervised Representation Learning [175.34232468746245]
  We introduce a parameterization method called Neural Bayes. It allows computing statistical quantities that are in general difficult to compute. We show two independent use cases for this parameterization.
  arXiv  Detail & Related papers  (2020-02-20T22:28:53Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.