arXiv research

Sparse models for high-dimensional linear regression and machine learning have received substantial attention over the past two decades. Model selection, or determining which features or covariates are the best explanatory variables, is critical to the interpretability of a learned model. Much of the current literature…

We study the problem of recovering the structure underlying large Gaussian graphical models or, more generally, partial correlation graphs. In high-dimensional problems it is often too costly to store the entire sample covariance matrix. We propose a new input model in which one can query single entries of the covarian…

A new GNN architecture called coVariance neural network (VNN) improves stability and transferability of covariance matrix analysis.

GATs improve node regression on noisy graphs with provable advantage.

Improved graph matching using covariates for network data integration.

Biological and social systems consist of myriad interacting units. The interactions can be represented in the form of a graph or network. Measurements of these graphs can reveal the underlying structure of these interactions, which provides insight into the systems that generated the graphs. Moreover, in applications s…

NTKs explain GNNs' alignment for graph prediction.

Method solves Gaussian graphical models on ladder graphs efficiently.

Bayesian methods estimate regression functions on submanifolds using graph Laplacian eigenbasis.

Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant operators, which include the edge Laplacian and the adjacency matrix on graphs. In the …

Two spectral algorithms for community detection in graphs with covariates are compared.

A new ranking model with dynamic covariates improves statistical analysis.

We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter $ρ$. Suppose the co- variance graph formed by thresholding the entries of the sample covariance matrix at $ρ$ is decomposed into connected components. We show that the vertex-partition induced by the thresh…

An algorithm finds optimal covariates for blocking in randomized experiments.

The paper infers multiple graphs from stationary signals on them.

We review recent probabilistic results on covariant Schrödinger operators on vector bundles over (possibly locally infinite) weighted graphs, and explain applications like semiclassical limits. We also clarify the relationship between these results and their formal analogues on smooth (possibly noncompact) Riemannian m…

We investigate the relationship between the structure of a discrete graphical model and the support of the inverse of a generalized covariance matrix. We show that for certain graph structures, the support of the inverse covariance matrix of indicator variables on the vertices of a graph reflects the conditional indepe…

New distribution simplifies covariance matrix inference.

The covariance graph (aka bi-directed graph) of a probability distribution $p$ is the undirected graph $G$ where two nodes are adjacent iff their corresponding random variables are marginally dependent in $p$. In this paper, we present a graphical criterion for reading dependencies from $G$, under the assumption that $…

Steerable E(3) Graph Neural Networks incorporate geometric and physical covariant information.

A new method for efficient portfolio optimization using graph structures.

Paper proposes a new algorithm for graph learning with covariance constraints.

New GL-GP models learn covariance respecting domain geometry.

FVNNs use graph convolutions on fair covariance estimates to improve fairness in machine learning.

New method estimates neuronal connectivity from partially observed data.

New method denoises graph signals using wavelets, scalable for large graphs.

EiGLasso speeds up sparse Kronecker-sum covariance estimation.

We provide the first information theoretic tight analysis for inference of latent community structure given a sparse graph along with high dimensional node covariates, correlated with the same latent communities. Our work bridges recent theoretical breakthroughs in the detection of latent community structure without no…

Filtered conformal ellipsoids for graph-native time series

RIA method improves OoD generalization for covariate shift.

In this paper, we present a simple non-parametric method for learning the structure of undirected graphs from data that drawn from an underlying unknown distribution. We propose to use Brownian distance covariance to estimate the conditional independences between the random variables and encodes pairwise Markov graph. …

In this paper, we present a graph-based semi-supervised framework for hyperspectral image classification. We first introduce a novel superpixel algorithm based on the spectral covariance matrix representation of pixels to provide a better representation of our data. We then construct a superpixel graph, based on carefu…

We establish a new framework for statistical estimation of directed acyclic graphs (DAGs) when data are generated from a linear, possibly non-Gaussian structural equation model. Our framework consists of two parts: (1) inferring the moralized graph from the support of the inverse covariance matrix; and (2) selecting th…

Undirected graphs can be used to describe matrix variate distributions. In this paper, we develop new methods for estimating the graphical structures and underlying parameters, namely, the row and column covariance and inverse covariance matrices from the matrix variate data. Under sparsity conditions, we show that one…

Unified framework for OOD detection and generalization using graph theory.

Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. Submatrices with low rank correspond to generalizations of conditional independence constraints on collections of random variables. We give a precise graph-theoretic characterization of when submatrices of the cov…

FREDE efficiently embeds graphs using linear space and guarantees quality.

CSTs improve stability in covariance spectrum analysis without training.

The paper proposes a method to analyze categorical feature interactions in large datasets using graph covariance and LLMs.

Improves causal graph learning on dependent binary data.

Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine learning algorithms like classification, clustering, etc., over graph datasets. In…

In this paper, we introduce a new directed graphical model from Gaussian data: the Gaussian graphical interaction model (GGIM). The development of this model comes from considering stationary Gaussian processes on graphs, and leveraging the equations between the resulting steady-state covariance matrix and the Laplacia…

The paper tests properties of trees in graphical models using covariance queries.

VNNs transfer well across datasets for brain age prediction using cortical thickness features.

Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using $\ell_1$-penalization methods. We propose and study the following method. We combine a multiple regression approach with ideas of thresholding and refitting: first we infer a sparse u…

We find a closed-form determinant for a specific sparse covariance matrix model.

Regularization has become a primary tool for developing reliable estimators of the covariance matrix in high-dimensional settings. To curb the curse of dimensionality, numerous methods assume that the population covariance (or inverse covariance) matrix is sparse, while making no particular structural assumptions on th…

Given i.i.d. observations of a random vector $X \in \mathbb{R}^p$, we study the problem of estimating both its covariance matrix $Σ^*$, and its inverse covariance or concentration matrix {$Θ^* = (Σ^*)^{-1}$.} We estimate $Θ^*$ by minimizing an $\ell_1$-penalized log-determinant Bregman divergence; in the multivariate G…