I guess convergence in general means it is in asymptotic sense but what does non-asymptotic convergence mean?. Can someone please explain with an example?
$\begingroup$
$\endgroup$
-
$\begingroup$ Where did you find that term? Can you include some context? $\endgroup$ – Federico Poloni Jun 10 at 14:52
-
$\begingroup$ Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning (papers.nips.cc/paper/…) @FedericoPoloni $\endgroup$ – Kethan Chauhan Jun 10 at 15:29
-
3$\begingroup$ Can you add some information from that paper to the question to provide context? Most people won't go and read that paper to understand your question. $\endgroup$ – nicoguaro♦ Jun 10 at 15:50
$\begingroup$
$\endgroup$
The authors provide bounds on various things as an explicit function of the iterate $n$, for a generic, but finite, $n$. These bounds apply for finite $n$, not only in the limit as $n \rightarrow \infty$, hence are non-asymptotic bounds.
-
1$\begingroup$ With first order methods for optimization we don't typically run the optimization all the way to convergence but rather stop as soon as the solution is "good enough" This kind of analysis addresses the "good enough" problem. $\endgroup$ – Brian Borchers Jun 10 at 18:32
