FuDGE: A Method to Estimate a Functional Differential Graph in a High-Dimensional Setting
Not on the map. Why?
Abstract (arXiv)
We consider the problem of estimating the difference between two undirected functional graphical models with shared structures. In many applications, data are naturally regarded as a vector of random functions rather than as a vector of scalars. For example, electroencephalography (EEG) data are treated more appropriately as functions of time. In such a problem, not only can the number of functions measured per sample be large, but each function is itself an infinite-dimensional object, making estimation of model parameters challenging. This is further complicated by the fact that curves are usually observed only at discrete time points. We first define a functional differential graph that captures the differences between two functional graphical models and formally characterize when the functional differential graph is well defined. We then propose a method, FuDGE, that directly estimates the functional differential graph without first estimating each individual graph. This is particularly beneficial in settings where the individual graphs are dense but the differential graph is sparse. We show that FuDGE consistently estimates the functional differential graph even in a high-dimensional setting for both fully observed and discretely observed function paths. We illustrate the finite sample properties of our method through simulation studies. We also propose a competing method, the Joint Functional Graphical Lasso, which generalizes the Joint Graphical Lasso to the functional setting. Finally, we apply our method to EEG data to uncover differences in functional brain connectivity between a group of individuals with alcohol use disorder and a control group.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 4; 2026: 1.
7 papers.
- 2023Learning High-Dimensional Differential Graphs From Multi-Attribute Datacited by 3
- 2024Trans-Glasso: A Transfer Learning Approach to Precision Matrix Estimationcited by 2
- 2025Learning Multi-Attribute Differential Graphs with Non-Convex Penaltiescited by 1
- 2025Multi-Attribute Graph Estimation with Sparse-Group Non-Convex Penaltiescited by 0
- 2025Learning Conditional Independence Differential Graphs From Time-Dependent Datacited by 0
- 2025On Conditional Independence Graph Learning From Multi-Attribute Gaussian Dependent Time Seriescited by 0
- 2026High-dimensional Gaussian Graphical Model Testing for Long-Memory Time Seriescited by 0
- 2026High-dimensional Gaussian Graphical Model Testing for Long-Memory Time Series24 Sep 2026
- 2025On Conditional Independence Graph Learning From Multi-Attribute Gaussian Dependent Time Series8 Dec 2025
- 2025Learning Conditional Independence Differential Graphs From Time-Dependent Data7 Dec 2025
- 2025Multi-Attribute Graph Estimation with Sparse-Group Non-Convex Penalties17 May 2025
- 2025Learning Multi-Attribute Differential Graphs with Non-Convex Penalties14 May 2025
- 2024Trans-Glasso: A Transfer Learning Approach to Precision Matrix Estimation23 Nov 2024
- 2023Learning High-Dimensional Differential Graphs From Multi-Attribute Data5 Dec 2023