Exact characterisation of asymptotic running time for approximate gradient descent on random graphs
Sign Up to like & getrecommendations! Published in 2025 at "Stochastic Analysis and Applications"
DOI: 10.1080/07362994.2024.2434234
Abstract: Abstract. 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ös-Rényi graphs with connection probability given by λ∕nα (with λ… read more here.
Keywords: gradient descent; approximate gradient; time; random graphs ... See more keywords