Conditional Independence Estimates for the Generalized Nonparanormal

• URL: http://arxiv.org/abs/2508.11050v1
• Date: Thu, 14 Aug 2025 20:19:30 GMT
• Title: Conditional Independence Estimates for the Generalized Nonparanormal
• Authors: Ujas Shah, Manuel Lladser, Rebecca Morrison,
• Abstract summary: This paper builds on previous work to show that for a class of non-Gaussian distributions, information about the conditional independence structure can still be inferred from the precision matrix.<n>We provide a simple and computationally efficient algorithm that leverages this theory to recover conditional independence structure from the generalized nonparanormal data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: For general non-Gaussian distributions, the covariance and precision matrices do not encode the independence structure of the variables, as they do for the multivariate Gaussian. This paper builds on previous work to show that for a class of non-Gaussian distributions -- those derived from diagonal transformations of a Gaussian -- information about the conditional independence structure can still be inferred from the precision matrix, provided the data meet certain criteria, analogous to the Gaussian case. We call such transformations of the Gaussian as the generalized nonparanormal. The functions that define these transformations are, in a broad sense, arbitrary. We also provide a simple and computationally efficient algorithm that leverages this theory to recover conditional independence structure from the generalized nonparanormal data. The effectiveness of the proposed algorithm is demonstrated via synthetic experiments and applications to real-world data.

Related papers

• The symplectic rank of non-Gaussian quantum states [0.0]
  Non-Gaussianity is a key resource for achieving quantum advantages in bosonic platforms.<n>Here, we investigate the symplectic rank: a novel non-Gaussianity monotone that satisfies remarkable operational and resource-theoretic properties.<n>We show that the symplectic rank is a robust non-Gaussian measure, explaining how to witness it in experiments and how to exploit it to meaningfully benchmark different bosonic platforms.
  arXiv  Detail & Related papers  (2025-04-27T18:00:31Z)
• Asymptotics of Linear Regression with Linearly Dependent Data [28.005935031887038]
  We study the computations of linear regression in settings with non-Gaussian covariates.<n>We show how dependencies influence estimation error and the choice of regularization parameters.
  arXiv  Detail & Related papers  (2024-12-04T20:31:47Z)
• Decomposing Gaussians with Unknown Covariance [3.734088413551237]
  We present a general algorithm that encompasses all previous decomposition approaches for Gaussian data as special cases. It yields a new and more flexible alternative to sample splitting when $n>1$. We apply these decompositions to the tasks of model selection and post-selection inference in settings where alternative strategies are unavailable.
  arXiv  Detail & Related papers  (2024-09-17T18:56:08Z)
• Equivariance Discovery by Learned Parameter-Sharing [153.41877129746223]
  We study how to discover interpretable equivariances from data. Specifically, we formulate this discovery process as an optimization problem over a model's parameter-sharing schemes. Also, we theoretically analyze the method for Gaussian data and provide a bound on the mean squared gap between the studied discovery scheme and the oracle scheme.
  arXiv  Detail & Related papers  (2022-04-07T17:59:19Z)
• Deterministic Gaussian conversion protocols for non-Gaussian single-mode resources [58.720142291102135]
  We show that cat and binomial states are approximately equivalent for finite energy, while this equivalence was previously known only in the infinite-energy limit. We also consider the generation of cat states from photon-added and photon-subtracted squeezed states, improving over known schemes by introducing additional squeezing operations.
  arXiv  Detail & Related papers  (2022-04-07T11:49:54Z)
• Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors [54.936314353063494]
  We provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing. We make use of a practical iterative algorithm, and perform numerical experiments on image datasets to corroborate our results.
  arXiv  Detail & Related papers  (2021-08-08T05:28:06Z)
• 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)
• Benign Overfitting of Constant-Stepsize SGD for Linear Regression [122.70478935214128]
  inductive biases are central in preventing overfitting empirically. This work considers this issue in arguably the most basic setting: constant-stepsize SGD for linear regression. We reflect on a number of notable differences between the algorithmic regularization afforded by (unregularized) SGD in comparison to ordinary least squares.
  arXiv  Detail & Related papers  (2021-03-23T17:15:53Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)
• Gaussianization Flows [113.79542218282282]
  We propose a new type of normalizing flow model that enables both efficient iteration of likelihoods and efficient inversion for sample generation. Because of this guaranteed expressivity, they can capture multimodal target distributions without compromising the efficiency of sample generation.
  arXiv  Detail & Related papers  (2020-03-04T08:15:06Z)
• Sub-Gaussian Matrices on Sets: Optimal Tail Dependence and Applications [6.034622792544481]
  We study when a sub-Gaussian matrix can become a near isometry on a set. We show that previous best known dependence on the sub-Gaussian norm was sub-optimal. We also develop a new Bernstein type inequality for sub-exponential random variables, and a new Hanson-Wright inequality for quadratic forms of sub-Gaussian random variables.
  arXiv  Detail & Related papers  (2020-01-28T23:06:20Z)

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.