In this article, we study the landscape of an online nonconvex optimization problem, for which input data vary over time and solution is a trajectory rather than single point. To understand complexity finding global introduce notion spurious (i.e., nonglobal) local trajectory as generalization ...