DeepAI AI Chat
Log In Sign Up

Online Edge Grafting for Efficient MRF Structure Learning

by   Walid Chaabene, et al.

Incremental methods for structure learning of pairwise Markov random fields (MRFs), such as grafting, improve scalability to large systems by avoiding inference over the entire feature space in each optimization step. Instead, inference is performed over an incrementally grown active set of features. In this paper, we address the computational bottlenecks that current techniques still suffer by introducing online edge grafting, an incremental, structured method that activates edges as groups of features in a streaming setting. The framework is based on reservoir sampling of edges that satisfy a necessary activation condition, approximating the search for the optimal edge to activate. Online edge grafting performs an informed edge search set reorganization using search history and structure heuristics. Experiments show a significant computational speedup for structure learning and a controllable trade-off between the speed and the quality of learning.


page 1

page 2

page 3

page 4


Improved Algorithms for Edge Colouring in the W-Streaming Model

In the W-streaming model, an algorithm is given O(n polylog n) space and...

Streaming and Batch Algorithms for Truss Decomposition

Truss decomposition is a method used to analyze large sparse graphs in o...

Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams

A great variety of complex systems, from user interactions in communicat...

Active Learning for Online Recognition of Human Activities from Streaming Videos

Recognising human activities from streaming videos poses unique challeng...

Incremental Reconstruction of Urban Environments by Edge-Points Delaunay Triangulation

Urban reconstruction from a video captured by a surveying vehicle consti...

Statistical inference on errorfully observed graphs

Statistical inference on graphs is a burgeoning field in the applied and...

Incremental Dead State Detection in Logarithmic Time

Identifying live and dead states in an abstract transition system is a r...