antGLasso: An Efficient Tensor Graphical Lasso Algorithm

11/05/2022
by   Bailey Andrew, et al.
0

The class of bigraphical lasso algorithms (and, more broadly, 'tensor'-graphical lasso algorithms) has been used to estimate dependency structures within matrix and tensor data. However, all current methods to do so take prohibitively long on modestly sized datasets. We present a novel tensor-graphical lasso algorithm that analytically estimates the dependency structure, unlike its iterative predecessors. This provides a speedup of multiple orders of magnitude, allowing this class of algorithms to be used on large, real-world datasets.

READ FULL TEXT

page 5

page 6

page 8

page 9

page 11

research
02/01/2020

The Sylvester Graphical Lasso (SyGlasso)

This paper introduces the Sylvester graphical lasso (SyGlasso) that capt...
research
05/17/2017

Learning Gaussian Graphical Models Using Discriminated Hub Graphical Lasso

We develop a new method called Discriminated Hub Graphical Lasso (DHGL) ...
research
10/25/2011

A Flexible, Scalable and Efficient Algorithmic Framework for Primal Graphical Lasso

We propose a scalable, efficient and statistically motivated computation...
research
01/31/2022

Statistical Downscaling of Model Projections with Multivariate Basis Graphical Lasso

We describe an improved statistical downscaling method for Earth science...
research
06/25/2023

A naıve Bayesian graphical elastic net: driving advances in differential network analysis

Differential Networks (DNs), tools that encapsulate interactions within ...
research
04/23/2020

Rapid Detection of Hot-spots via Tensor Decomposition with applications to Crime Rate Data

We propose an efficient statistical method (denoted as SSR-Tensor) to ro...
research
07/16/2021

Efficient proximal gradient algorithms for joint graphical lasso

We consider learning an undirected graphical model from sparse data. Whi...

Please sign up or login with your details

Forgot password? Click here to reset