A Bregman Method for Structure Learning on Sparse Directed Acyclic Graphs

11/05/2020
by   Manon Romain, et al.
0

We develop a Bregman proximal gradient method for structure learning on linear structural causal models. While the problem is non-convex, has high curvature and is in fact NP-hard, Bregman gradient methods allow us to neutralize at least part of the impact of curvature by measuring smoothness against a highly nonlinear kernel. This allows the method to make longer steps and significantly improves convergence. Each iteration requires solving a Bregman proximal step which is convex and efficiently solvable for our particular choice of kernel. We test our method on various synthetic and real data sets.

READ FULL TEXT

page 14

page 15

research
10/22/2020

Learning Graph Laplacian with MCP

Motivated by the observation that the ability of the ℓ_1 norm in promoti...
research
08/04/2023

Adaptive Proximal Gradient Method for Convex Optimization

In this paper, we explore two fundamental first-order algorithms in conv...
research
07/15/2020

A General Family of Stochastic Proximal Gradient Methods for Deep Learning

We study the training of regularized neural networks where the regulariz...
research
01/26/2023

Causal Structural Learning from Time Series: A Convex Optimization Approach

Structural learning, which aims to learn directed acyclic graphs (DAGs) ...
research
05/10/2016

Kernel-Based Structural Equation Models for Topology Identification of Directed Networks

Structural equation models (SEMs) have been widely adopted for inference...
research
05/01/2021

NuSPAN: A Proximal Average Network for Nonuniform Sparse Model – Application to Seismic Reflectivity Inversion

We solve the problem of sparse signal deconvolution in the context of se...

Please sign up or login with your details

Forgot password? Click here to reset