Pan Xu

Mining maximal cliques from an uncertain graph

2015

We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs. For parameter 0 <; α <; 1, we consider the notion of an …

Stochastic Nested Variance Reduction for Nonconvex Optimization

2018 · arXiv (Cornell University)

We study finite-sum nonconvex optimization problems, where the objective function is an average of $n$ nonconvex functions. We propose a new stochastic gradient descent algorithm based on nested variance reduction. Compared with conventional stochastic variance …