Exact asymptotic characterisation of running time for approximate gradient descent on random graphs

arXiv2105.04228MaRDI QIDQ6367248FDOQ6367248

Authors: Matthieu Jonckheere, Manuel Sáenz 

Publication date: 10 May 2021

Abstract: In this work we study the time complexity for the search of local minima in random graphs whose vertices have i.i.d. cost values. We show that, for Erd"os-R'enyi graphs with connection probability given by $lambda/n^{a}lpha$ (with $lambda>0$ and $0<alpha<1$), a family of local algorithms that approximate a gradient descent find local minima faster than the full gradient descent. Furthermore, we find a probabilistic representation for the running time of these algorithms leading to asymptotic estimates of the mean running times.

This page was built for publication: Exact asymptotic characterisation of running time for approximate gradient descent on random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367248)