DeepAI AI Chat
Log In Sign Up

Graph-Based Ascent Algorithms for Function Maximization

by   Muni Sreenivas Pydi, et al.
University of Wisconsin-Madison

We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of the graph along a path, and the next iterate is chosen from the neighbors of the current iterate with probability distribution determined by the function values at the current iterate and its neighbors. We study two algorithms corresponding to a Metropolis-Hastings random walk with different transition kernels: (i) The first algorithm is an exponentially weighted random walk governed by a parameter γ. (ii) The second algorithm is defined with respect to the graph Laplacian and a smoothness parameter k. We derive convergence rates for the two algorithms in terms of total variation distance and hitting times. We also provide simulations showing the relative convergence rates of our algorithms in comparison to an unbiased random walk, as a function of the smoothness of the graph function. Our algorithms may be categorized as a new class of "descent-based" methods for function maximization on the nodes of a graph.


page 5

page 14


A Fast Method to Calculate Hitting Time Distribution for a Random Walk on Connected Undirected Graph

With the advent of increasingly larger graphs, we need to find a quick a...

Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited

Random walk kernels have been introduced in seminal work on graph learni...

A weighted graph zeta function involved in the Szegedy walk

We define a new weighted zeta function for a finite graph and obtain its...

Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation

The computation of electrical flows is a crucial primitive for many rece...

Implementing regularization implicitly via approximate eigenvector computation

Regularization is a powerful technique for extracting useful information...

Random Walk Graph Laplacian based Smoothness Prior for Soft Decoding of JPEG Images

Given the prevalence of JPEG compressed images, optimizing image reconst...

PAN: Path Integral Based Convolution for Deep Graph Neural Networks

Convolution operations designed for graph-structured data usually utiliz...