Login / Signup
Exact asymptotic characterisation of running time for approximate gradient descent on random graphs.
Matthieu Jonckheere
Manuel Sáenz
Published in:
CoRR (2021)
Keyphrases
</>
random graphs
exact solution
graph theoretic
exact computation
phase transition
exact and approximate
learning curves
cost function
small world
exact answers
undirected graph
objective function
lower bound
worst case
random walk
approximate matches