Sketching method for large scale combinatorial inference

Wei Sun, Junwei Lu, Han Liu

Research output: Contribution to journalConference article

Abstract

We present computationally efficient algorithms to test various combinatorial structures of large-scale graphical models. In order to test the hypotheses on their topological structures, we propose two adjacency matrix sketching frameworks: neighborhood sketching and subgraph sketching. The neighborhood sketching algorithm is proposed to test the connectivity of graphical models. This algorithm randomly subsamples vertices and conducts neighborhood regression and screening. The global sketching algorithm is proposed to test the topological properties requiring exponential computation complexity, especially testing the chromatic number and the maximum clique. This algorithm infers the corresponding property based on the sampled subgraph. Our algorithms are shown to substantially accelerate the computation of existing methods. We validate our theory and method through both synthetic simulations and a real application in neuroscience.

Original languageEnglish (US)
Pages (from-to)10598-10607
Number of pages10
JournalAdvances in Neural Information Processing Systems
Volume2018-December
StatePublished - Jan 1 2018
Event32nd Conference on Neural Information Processing Systems, NeurIPS 2018 - Montreal, Canada
Duration: Dec 2 2018Dec 8 2018

Fingerprint

Screening
Testing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Cite this

Sketching method for large scale combinatorial inference. / Sun, Wei; Lu, Junwei; Liu, Han.

In: Advances in Neural Information Processing Systems, Vol. 2018-December, 01.01.2018, p. 10598-10607.

Research output: Contribution to journalConference article

Sun, Wei ; Lu, Junwei ; Liu, Han. / Sketching method for large scale combinatorial inference. In: Advances in Neural Information Processing Systems. 2018 ; Vol. 2018-December. pp. 10598-10607.
@article{5680028e67a5476ea40b30fe1c05ebb2,
title = "Sketching method for large scale combinatorial inference",
abstract = "We present computationally efficient algorithms to test various combinatorial structures of large-scale graphical models. In order to test the hypotheses on their topological structures, we propose two adjacency matrix sketching frameworks: neighborhood sketching and subgraph sketching. The neighborhood sketching algorithm is proposed to test the connectivity of graphical models. This algorithm randomly subsamples vertices and conducts neighborhood regression and screening. The global sketching algorithm is proposed to test the topological properties requiring exponential computation complexity, especially testing the chromatic number and the maximum clique. This algorithm infers the corresponding property based on the sampled subgraph. Our algorithms are shown to substantially accelerate the computation of existing methods. We validate our theory and method through both synthetic simulations and a real application in neuroscience.",
author = "Wei Sun and Junwei Lu and Han Liu",
year = "2018",
month = "1",
day = "1",
language = "English (US)",
volume = "2018-December",
pages = "10598--10607",
journal = "Advances in Neural Information Processing Systems",
issn = "1049-5258",

}

TY - JOUR

T1 - Sketching method for large scale combinatorial inference

AU - Sun, Wei

AU - Lu, Junwei

AU - Liu, Han

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We present computationally efficient algorithms to test various combinatorial structures of large-scale graphical models. In order to test the hypotheses on their topological structures, we propose two adjacency matrix sketching frameworks: neighborhood sketching and subgraph sketching. The neighborhood sketching algorithm is proposed to test the connectivity of graphical models. This algorithm randomly subsamples vertices and conducts neighborhood regression and screening. The global sketching algorithm is proposed to test the topological properties requiring exponential computation complexity, especially testing the chromatic number and the maximum clique. This algorithm infers the corresponding property based on the sampled subgraph. Our algorithms are shown to substantially accelerate the computation of existing methods. We validate our theory and method through both synthetic simulations and a real application in neuroscience.

AB - We present computationally efficient algorithms to test various combinatorial structures of large-scale graphical models. In order to test the hypotheses on their topological structures, we propose two adjacency matrix sketching frameworks: neighborhood sketching and subgraph sketching. The neighborhood sketching algorithm is proposed to test the connectivity of graphical models. This algorithm randomly subsamples vertices and conducts neighborhood regression and screening. The global sketching algorithm is proposed to test the topological properties requiring exponential computation complexity, especially testing the chromatic number and the maximum clique. This algorithm infers the corresponding property based on the sampled subgraph. Our algorithms are shown to substantially accelerate the computation of existing methods. We validate our theory and method through both synthetic simulations and a real application in neuroscience.

UR - http://www.scopus.com/inward/record.url?scp=85064817976&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85064817976&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:85064817976

VL - 2018-December

SP - 10598

EP - 10607

JO - Advances in Neural Information Processing Systems

JF - Advances in Neural Information Processing Systems

SN - 1049-5258

ER -