A Bayesian Approach To Graph Partitioning

04/24/2022
by   Farshad Noravesh, et al.
0

A new algorithm based on bayesian inference for learning local graph conductance based on Gaussian Process(GP) is given that uses advanced MCMC convergence ideas to create a scalable and fast algorithm for convergence to stationary distribution which is provided to learn the bahavior of conductance when traversing the indirected weighted graph. First metric embedding is used to represent the vertices of the graph. Then, uniform induced conductance is calculated for training points. Finally, in the learning step, a gaussian process is used to approximate the uniform induced conductance. MCMC is used to measure uncertainty of estimated hyper-parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2019

Convergence of Gaussian Process Regression with Estimated Hyper-parameters and Applications in Bayesian Inverse Problems

This work is concerned with the convergence of Gaussian process regressi...
research
03/29/2017

Adaptive Gaussian process approximation for Bayesian inference with expensive likelihood functions

We consider Bayesian inference problems with computationally intensive l...
research
06/25/2019

Prediction Using a Bayesian Heteroscedastic Composite Gaussian Process

This research proposes a flexible Bayesian extension of the composite Ga...
research
11/17/2019

Iterative Construction of Gaussian Process Surrogate Models for Bayesian Inference

A new algorithm is developed to tackle the issue of sampling non-Gaussia...
research
06/21/2018

Deep Gaussian Process-Based Bayesian Inference for Contaminant Source Localization

This paper proposes a Bayesian framework for localization of multiple so...
research
09/28/2018

GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Acceleration

Despite advances in scalable models, the inference tools used for Gaussi...

Please sign up or login with your details

Forgot password? Click here to reset