arXiv:2204.12927
A Bayesian Approach To Graph Partitioning
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Statistical Machine Learning for Astronomy -- A Textbook
PGT-I: Scaling Spatiotemporal GNNs with Memory-Efficient Distributed Training
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Scalable Bayesian Low-Rank Adaptation of Large Language Models via Stochastic Variational Subspace Inference
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
Generative Diffusion Receivers: Achieving Pilot-Efficient MIMO-OFDM Communications
토론
이 논문과 연결된 포럼 글이 아직 없습니다.