On Conditional Independence Graph Learning From Multi-Attribute Gaussian Dependent Time Series

• URL: http://arxiv.org/abs/2512.07557v1
• Date: Mon, 08 Dec 2025 13:48:25 GMT
• Title: On Conditional Independence Graph Learning From Multi-Attribute Gaussian Dependent Time Series
• Authors: Jitendra K. Tugnait,
• Abstract summary: We consider estimation of the conditional independence graph (CIG) of high-dimensional multivariate time series from multi-attribute data.<n>We do investigate the Bayesian selection of the parameters based on the information criterion, and we also illustrate our approach using both synthetic and real data.
• Score: 16.481440561437307
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Estimation of the conditional independence graph (CIG) of high-dimensional multivariate Gaussian time series from multi-attribute data is considered. Existing methods for graph estimation for such data are based on single-attribute models where one associates a scalar time series with each node. In multi-attribute graphical models, each node represents a random vector or vector time series. In this paper we provide a unified theoretical analysis of multi-attribute graph learning for dependent time series using a penalized log-likelihood objective function formulated in the frequency domain using the discrete Fourier transform of the time-domain data. We consider both convex (sparse-group lasso) and non-convex (log-sum and SCAD group penalties) penalty/regularization functions. We establish sufficient conditions in a high-dimensional setting for consistency (convergence of the inverse power spectral density to true value in the Frobenius norm), local convexity when using non-convex penalties, and graph recovery. We do not impose any incoherence or irrepresentability condition for our convergence results. We also empirically investigate selection of the tuning parameters based on the Bayesian information criterion, and illustrate our approach using numerical examples utilizing both synthetic and real data.

Related papers

• PiXTime: A Model for Federated Time Series Forecasting with Heterogeneous Data Structures Across Nodes [52.821072802825654]
  Time series are highly valuable and rarely shareable across nodes.<n>Different sampling standards lead to diverse time granularities and variable sets across nodes.<n>We propose PiXTime, a novel time series forecasting model designed for federated learning.
  arXiv  Detail & Related papers  (2026-01-09T08:11:45Z)
• Learning Conditional Independence Differential Graphs From Time-Dependent Data [16.481440561437307]
  We consider estimation of differences in conditional independence (CIGs) of two time series Gaussian graphical models (TSGGMs)<n>In this paper we consider estimation of the difference difference in two IPSDs to characterize the underlying changes in conditional of two sets of time-dependent data.
  arXiv  Detail & Related papers  (2025-12-07T18:45:04Z)
• Multi-Attribute Graph Estimation with Sparse-Group Non-Convex Penalties [12.94486861344922]
  We consider the problem of inferring the conditional independence graph (CIG) vectors from multi-attribute data.<n>Most existing methods for graph estimation are based on a single scalar random variable with each node.
  arXiv  Detail & Related papers  (2025-05-17T12:35:28Z)
• Learning Sparse High-Dimensional Matrix-Valued Graphical Models From Dependent Data [12.94486861344922]
  We consider the problem of inferring the conditional independence graph (CIG) of a sparse, high-dimensional, stationary matrix- Gaussian time series. We consider a sparse-based formulation of the problem with a Kronecker-decomposable power spectral density (PSD) We illustrate our approach using numerical examples utilizing both synthetic and real data.
  arXiv  Detail & Related papers  (2024-04-29T19:32:50Z)
• Generating Graphs via Spectral Diffusion [48.70458395826864]
  We present GGSD, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.<n>An extensive set of experiments on both synthetic and real-world graphs demonstrates the strengths of our model against state-of-the-art alternatives.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Sparse Training of Discrete Diffusion Models for Graph Generation [45.103518022696996]
  We introduce SparseDiff, a novel diffusion model based on the observation that almost all large graphs are sparse. By selecting a subset of edges, SparseDiff effectively leverages sparse graph representations both during the noising process and within the denoising network. Our model demonstrates state-of-the-art performance across multiple metrics on both small and large datasets.
  arXiv  Detail & Related papers  (2023-11-03T16:50:26Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• Sparse-Group Log-Sum Penalized Graphical Model Learning For Time Series [12.843340232167266]
  We consider the problem of inferring the conditional independence graph (CIG) of a stationary multivariate Gaussian time series. A sparse-group lasso based frequency-domain formulation of the problem has been considered in the literature. We illustrate our approach utilizing both synthetic and real data.
  arXiv  Detail & Related papers  (2022-04-29T00:06:41Z)
• On Sparse High-Dimensional Graphical Model Learning For Dependent Time Series [12.94486861344922]
  We consider the problem of inferring the conditional independence graph (CIG) of a sparse, high-dimensional stationary time series. A sparse-group lasso-based frequency-domain formulation of the problem is presented. We also empirically investigate selection of the tuning parameters based on Bayesian information criterion.
  arXiv  Detail & Related papers  (2021-11-15T16:52:02Z)
• Graph Gamma Process Generalized Linear Dynamical Systems [60.467040479276704]
  We introduce graph gamma process (GGP) linear dynamical systems to model real multivariate time series. For temporal pattern discovery, the latent representation under the model is used to decompose the time series into a parsimonious set of multivariate sub-sequences. We use the generated random graph, whose number of nonzero-degree nodes is finite, to define both the sparsity pattern and dimension of the latent state transition matrix.
  arXiv  Detail & Related papers  (2020-07-25T04:16:34Z)
• Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks [91.65637773358347]
  We propose a general graph neural network framework designed specifically for multivariate time series data. Our approach automatically extracts the uni-directed relations among variables through a graph learning module. Our proposed model outperforms the state-of-the-art baseline methods on 3 of 4 benchmark datasets.
  arXiv  Detail & Related papers  (2020-05-24T04:02:18Z)
• 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.