Backtracking line search

In (unconstrained) mathematical optimization, a backtracking line search is a line search method to determine the amount to move along a given search direction. Its use requires that the objective function is differentiable and that its gradient is known.

The method involves starting with a relatively large estimate of the step size for movement along the line search direction, and iteratively shrinking the step size (i.e., "backtracking") until a decrease of the objective function is observed that adequately corresponds to the amount of decrease that is expected, based on the step size and the local gradient of the objective function. A common stopping criterion is the Armijo–Goldstein condition.

Backtracking line search is typically used for gradient descent (GD), but it can also be used in other contexts. For example, it can be used with Newton's method if the Hessian matrix is positive definite.

Motivation

Given a starting position $\mathbf {x}$ and a search direction $\mathbf {p}$, the task of a line search is to determine a step size $\alpha >0$ that adequately reduces the objective function $f:\mathbb {R} ^{n}\to \mathbb {R}$ (assumed $C^{1}$ i.e. continuously differentiable), i.e., to find a value of $\alpha$ that reduces $f(\mathbf {x} +\alpha \,\mathbf {p} )$ relative to $f(\mathbf {x} )$. However, it is usually undesirable to devote substantial resources to finding a value of $\alpha$ to precisely minimize $f$. This is because the computing resources needed to find a more precise minimum along one particular direction could instead be employed to identify a better search direction. Once an improved starting point has been identified by the line search, another subsequent line search will ordinarily be performed in a new direction. The goal, then, is just to identify a value of $\alpha$ that provides a reasonable amount of improvement in the objective function, rather than to find the actual minimizing value of $\alpha$.

The backtracking line search starts with a large estimate of $\alpha$ and iteratively shrinks it. The shrinking continues until a value is found that is small enough to provide a decrease in the objective function that adequately matches the decrease that is expected to be achieved, based on the local function gradient $\nabla f(\mathbf {x} )\,.$

Define the local slope of the function of $\alpha$ along the search direction $\mathbf {p}$ as $m=\nabla f(\mathbf {x} )^{\mathrm {T} }\,\mathbf {p} =\langle \nabla f(\mathbf {x} ),\mathbf {p} \rangle$ (where $\langle \cdot ,\cdot \rangle$ denotes the dot product). It is assumed that $\mathbf {p}$ is a vector for which some local decrease is possible, i.e., it is assumed that $m<0$.

Based on a selected control parameter $c\,\in \,(0,1)$, the Armijo–Goldstein condition tests whether a step-wise movement from a current position $\mathbf {x}$ to a modified position $\mathbf {x} +\alpha \,\mathbf {p}$ achieves an adequately corresponding decrease in the objective function. The condition is fulfilled, see Armijo (1966), if $f(\mathbf {x} +\alpha \,\mathbf {p} )\leq f(\mathbf {x} )+\alpha \,c\,m\,.$

This condition, when used appropriately as part of a line search, can ensure that the step size is not excessively large. However, this condition is not sufficient on its own to ensure that the step size is nearly optimal, since any value of $\displaystyle \alpha$ that is sufficiently small will satisfy the condition.

Thus, the backtracking line search strategy starts with a relatively large step size, and repeatedly shrinks it by a factor $\tau \,\in \,(0,1)$ until the Armijo–Goldstein condition is fulfilled.

The search will terminate after a finite number of steps for any positive values of $c$ and $\tau$ that are less than 1. For example, Armijo used 1⁄2 for both $c$ and $\tau$ in Armijo (1966).

Algorithm

This condition is from Armijo (1966). Starting with a maximum candidate step size value $\alpha _{0}>0\,$, using search control parameters $\tau \,\in \,(0,1)$ and $c\,\in \,(0,1)$, the backtracking line search algorithm can be expressed as follows:

1. Set $t=-c\,m$ and iteration counter $j\,=\,0$.
2. Until the condition is satisfied that $f(\mathbf {x} )-f(\mathbf {x} +\alpha _{j}\,\mathbf {p} )\geq \alpha _{j}\,t,$ repeatedly increment $j$ and set $\alpha _{j}=\tau \,\alpha _{j-1}\,.$
3. Return $\alpha _{j}$ as the solution.

In other words, reduce $\alpha _{0}$ by a factor of $\tau \,$ in each iteration until the Armijo–Goldstein condition is fulfilled.

Function minimization using backtracking line search in practice

In practice, the above algorithm is typically iterated to produce a sequence $\mathbf {x} _{n}$, $n=1,2,...$, to converge to a minimum, provided such a minimum exists and $\mathbf {p} _{n}$ is selected appropriately in each step. For gradient descent, $\mathbf {p} _{n}$ is selected as $-\nabla f(\mathbf {x} _{n})$.

The value of $\alpha _{j}$ for the $j$ that fulfills the Armijo–Goldstein condition depends on $\mathbf {x}$ and $\mathbf {p}$, and is thus denoted below by $\alpha (\mathbf {x} ,\mathbf {p} )$. It also depends on $f$, $\alpha _{0}$, $\tau$ and $c$ of course, although these dependencies can be left implicit if they are assumed to be fixed with respect to the optimization problem.

The detailed steps are thus, see Armijo (1966), Bertsekas (2016):

1. Choose an initial starting point $\mathbf {x} _{0}$ and set the iteration counter $n=0$.
2. Until some stopping condition is satisfied, choose a descent direction $\mathbf {p} _{n}$, update the position to $\mathbf {x} _{n+1}=\mathbf {x} _{n}+\alpha (\mathbf {x} _{n},\mathbf {p} _{n})\,\mathbf {p} _{n}$, and increment $n$.
3. Return $\mathbf {x} _{n}$ as the minimizing position and $f(\mathbf {x} _{n})$ as the function minimum.

To assure good behavior, it is necessary that some conditions must be satisfied by $\mathbf {p} _{n}$. Roughly speaking $\mathbf {p} _{n}$ should not be too far away from $\nabla f(\mathbf {x} _{n})$. A precise version is as follows (see e.g. Bertsekas (2016)). There are constants $C_{1},C_{2}>0$ so that the following two conditions are satisfied:

1. For all n, $\|\mathbf {p} _{n}\|\geq C_{1}\,\|\nabla f(\mathbf {x} _{n})\|$. Here, $\|y\|$ is the Euclidean norm of $y$. (This assures that if $\mathbf {p} _{n}=0$, then also $\nabla f(\mathbf {x} _{n})=0$. More generally, if $\lim _{n\rightarrow \infty }\mathbf {p} _{n}=0$, then also $\lim _{n\rightarrow \infty }\nabla f(\mathbf {x} _{n})=0$.) A more strict version requires also the reverse inequality: $\|\mathbf {p} _{n}\|\leq C_{3}\,\|\nabla f(\mathbf {x} _{n})\|$ for a positive constant $C_{3}>0$.
2. For all n, $\|\mathbf {p} _{n}\|\,\|\nabla f(\mathbf {x} _{n})\|\leq -C_{2}\,\langle \mathbf {p} _{n},\nabla f(\mathbf {x} _{n})\rangle$. (This condition ensures that the directions of $\mathbf {p} _{n}$ and $-\nabla f(\mathbf {x} _{n})$ are similar.)

Lower bound for learning rates

This addresses the question whether there is a systematic way to find a positive number $\beta (\mathbf {x} ,\mathbf {p} )$ - depending on the function f, the point $\mathbf {x}$ and the descent direction $\mathbf {p}$ - so that all learning rates $\alpha \leq \beta (\mathbf {x} ,\mathbf {p} )$ satisfy Armijo's condition. When $\mathbf {p} =-\nabla f(\mathbf {x} )$, we can choose $\beta (\mathbf {x} ,\mathbf {p} )$ in the order of $1/L(\mathbf {x} )\,$, where $L(\mathbf {x} )\,$ is a local Lipschitz constant for the gradient $\nabla f\,$ near the point $\mathbf {x}$ (see Lipschitz continuity). If the function is $C^{2}$, then $L(\mathbf {x} )\,$ is close to the Hessian of the function at the point $\mathbf {x}$. See Armijo (1966) for more detail.

Upper bound for learning rates

In the same situation where $\mathbf {p} =-\nabla f(\mathbf {x} )$, an interesting question is how large learning rates can be chosen in Armijo's condition (that is, when one has no limit on $\alpha _{0}$ as defined in the section "Function minimization using backtracking line search in practice"), since larger learning rates when $\mathbf {x} _{n}$ is closer to the limit point (if exists) can make convergence faster. For example, in Wolfe conditions, there is no mention of $\alpha _{0}$ but another condition called curvature condition is introduced.

An upper bound for learning rates is shown to exist if one wants the constructed sequence $\mathbf {x} _{n}$ converges to a non-degenerate critical point, see Truong & Nguyen (2020): The learning rates must be bounded from above roughly by $||H||\times ||H^{-1}||^{2}$. Here H is the Hessian of the function at the limit point, $H^{-1}$ is its inverse, and $||.||$ is the norm of a linear operator. Thus, this result applies for example when one uses Backtracking line search for Morse functions. Note that in dimension 1, $H$ is a number and hence this upper bound is of the same size as the lower bound in the section "Lower bound for learning rates".

On the other hand, if the limit point is degenerate, then learning rates can be unbounded. For example, a modification of backtracking line search known as unbounded backtracking gradient descent (see Truong & Nguyen (2020)) allows the learning rate to be half the size $||\nabla f(\mathbf {x} _{n})||^{-\gamma }$, where $1>\gamma >0$ is a constant. Experiments with simple functions such as $f(x,y)=x^{4}+y^{4}$ show that unbounded backtracking gradient descent converges much faster than the basic version described in the section "Function minimization using backtracking line search in practice".

Time efficiency

An argument against the use of Backtracking line search, in particular in Large scale optimisation, is that satisfying Armijo's condition is expensive. There is a way (so-called Two-way Backtracking) to go around, with good theoretical guarantees and has been tested with good results on deep neural networks, see Truong & Nguyen (2020). (There, one can find also good/stable implementations of Armijo's condition and its combination with some popular algorithms such as Momentum and NAG, on datasets such as Cifar10 and Cifar100.) One observes that if the sequence $\mathbf {x} _{n}$ converges (as wished when one makes use of an iterative optimisation method), then the sequence of learning rates $\alpha _{n}$ should vary little when n is large enough. Therefore, in the search for $\alpha _{n}$, if one always starts from $\alpha _{0}$, one would waste a lot of time if it turns out that the sequence $\alpha _{n}$ stays far away from $\alpha _{0}$. Instead, one should search for $\alpha _{n}$ by starting from $\alpha _{n-1}$. The second observation is that $\alpha _{n}$ could be larger than $\alpha _{n-1}$, and hence one should allow to increase learning rate (and not just decrease as in the section Algorithm). Here is the detailed algorithm for Two-way Backtracking: At step n

1. Set $\gamma _{0}=\alpha _{n-1}$. Set $t=-c\,m$ and iteration counter $j\,=\,0$.
2. (Increase learning rate if Armijo's condition is satisfied.) If $f(\mathbf {x} )-f(\mathbf {x} +\gamma _{j}\,\mathbf {p} )\geq \gamma _{j}\,t,$, then while this condition and the condition that $\gamma _{j}\leq \alpha _{0}$ are satisfied, repeatedly set $\gamma _{j+1}=\gamma _{j}/\tau$ and increase j.
3. (Otherwise, reduce the learning rate if Armijo's condition is not satisfied.) If in contrast $f(\mathbf {x} )-f(\mathbf {x} +\gamma _{0}\,\mathbf {p} )<\gamma _{j}\,t,$, then until the condition is satisfied that $f(\mathbf {x} )-f(\mathbf {x} +\gamma _{j}\,\mathbf {p} )\geq \gamma _{j}\,t,$ repeatedly increment $j$ and set $\gamma _{j}=\tau \,\gamma _{j-1}\,.$
4. Return $\gamma _{j}$ for the learning rate $\alpha _{n}$.

(In Nocedal & Wright (2000) one can find a description of an algorithm with 1), 3) and 4) above, which was not tested in deep neural networks before the cited paper.)

One can save time further by a hybrid mixture between two-way backtracking and the basic standard gradient descent algorithm. This procedure also has good theoretical guarantee and good test performance. Roughly speaking, we run two-way backtracking a few times, then use the learning rate we get from then unchanged, except if the function value increases. Here is precisely how it is done. One choose in advance a number $N$, and a number $m\leq N$.

1. Set iteration counter j=0.
2. At the steps $jN+1,\ldots ,jN+m$, use Two-way Backtracking.
3. At each step k in the set $jN+m+1,\ldots ,jN+N-1$: Set $\alpha =\alpha _{k-2}$. If $f(x_{k-1})-f(x_{k-1}+\alpha p_{k-1})\geq 0$, then choose $\alpha _{k-1}=\alpha _{k-2}$ and $x_{k}=x_{k-1}+\alpha _{k-1}p_{k-1}$. (So, in this case, use the learning rate $\alpha _{k-2}$ unchanged.) Otherwise, if $f(x_{k-1})-f(x_{k-1}+\alpha p_{k-1})<0$, use Two-way Backtracking. Increase k by 1 and repeat.
4. Increase j by 1.

Theoretical guarantee (for gradient descent)

Compared with Wolfe's conditions, which is more complicated, Armijo's condition has a better theoretical guarantee. Indeed, so far backtracking line search and its modifications are the most theoretically guaranteed methods among all numerical optimization algorithms concerning convergence to critical points and avoidance of saddle points, see below.

Critical points are points where the gradient of the objective function is 0. Local minima are critical points, but there are critical points which are not local minima. An example is saddle points. Saddle points are critical points, at which there are at least one direction where the function is (local) maximum. Therefore, these points are far from being local minima. For example, if a function has at least one saddle point, then it cannot be convex. The relevance of saddle points to optimisation algorithms is that in large scale (i.e. high-dimensional) optimisation, one likely sees more saddle points than minima, see Bray & Dean (2007). Hence, a good optimisation algorithm should be able to avoid saddle points. In the setting of deep learning, saddle points are also prevalent, see Dauphin et al. (2014). Thus, to apply in deep learning, one needs results for non-convex functions.

For convergence to critical points: For example, if the cost function is a real analytic function, then it is shown in Absil, Mahony & Andrews (2005) that convergence is guaranteed. The main idea is to use Łojasiewicz inequality which is enjoyed by a real analytic function. For non-smooth functions satisfying Łojasiewicz inequality, the above convergence guarantee is extended, see Attouch, Bolte & Svaiter (2011). In Bertsekas (2016), there is a proof that for every sequence constructed by backtracking line search, a cluster point (i.e. the limit of one subsequence, if the subsequence converges) is a critical point. For the case of a function with at most countably many critical points (such as a Morse function) and compact sublevels, as well as with Lipschitz continuous gradient where one uses standard GD with learning rate <1/L (see the section "Stochastic gradient descent"), then convergence is guaranteed, see for example Chapter 12 in Lange (2013). Here the assumption about compact sublevels is to make sure that one deals with compact sets of the Euclidean space only. In the general case, where $f$ is only assumed to be $C^{1}$ and have at most countably many critical points, convergence is guaranteed, see Truong & Nguyen (2020). In the same reference, similarly convergence is guaranteed for other modifications of Backtracking line search (such as Unbounded backtracking gradient descent mentioned in the section "Upper bound for learning rates"), and even if the function has uncountably many critical points still one can deduce some non-trivial facts about convergence behaviour. In the stochastic setting, under the same assumption that the gradient is Lipschitz continuous and one uses a more restrictive version (requiring in addition that the sum of learning rates is infinite and the sum of squares of learning rates is finite) of diminishing learning rate scheme (see section "Stochastic gradient descent") and moreover the function is strictly convex, then the convergence is established in the well-known result Robbins & Monro (1951), see Bertsekas & Tsitsiklis (2006) for generalisations to less restrictive versions of a diminishing learning rate scheme. None of these results (for non-convex functions) have been proven for any other optimization algorithm so far.

For avoidance of saddle points: For example, if the gradient of the cost function is Lipschitz continuous and one chooses standard GD with learning rate <1/L, then with a random choice of initial point $\mathbf {x} _{0}$ (more precisely, outside a set of Lebesgue measure zero), the sequence constructed will not converge to a non-degenerate saddle point (proven in Lee et al. (2016)), and more generally it is also true that the sequence constructed will not converge to a degenerate saddle point (proven in Panageas & Piliouras (2017)). Under the same assumption that the gradient is Lipschitz continuous and one uses a diminishing learning rate scheme (see the section "Stochastic gradient descent"), then avoidance of saddle points is established in Panageas, Piliouras & Wang (2019).

A special case: (standard) stochastic gradient descent (SGD)

While it is trivial to mention, if the gradient of a cost function is Lipschitz continuous, with Lipschitz constant L, then with choosing learning rate to be constant and of the size $1/L$, one has a special case of backtracking line search (for gradient descent). This has been used at least in Armijo (1966). This scheme however requires that one needs to have a good estimate for L, otherwise if learning rate is too big (relative to 1/L) then the scheme has no convergence guarantee. One can see what will go wrong if the cost function is a smoothing (near the point 0) of the function f(t)=|t|. Such a good estimate is, however, difficult and laborious in large dimensions. Also, if the gradient of the function is not globally Lipschitz continuous, then this scheme has no convergence guarantee. For example, this is similar to an exercise in Bertsekas (2016), for the cost function $f(t)=|t|^{1.5}\,$ and for whatever constant learning rate one chooses, with a random initial point the sequence constructed by this special scheme does not converge to the global minimum 0.

If one does not care about the condition that learning rate must be bounded by 1/L, then this special scheme has been used much older, at least since 1847 by Cauchy, which can be called standard GD (not to be confused with stochastic gradient descent, which is abbreviated herein as SGD). In the stochastic setting (such as in the mini-batch setting in deep learning), standard GD is called stochastic gradient descent, or SGD.

Even if the cost function has globally continuous gradient, good estimate of the Lipschitz constant for the cost functions in deep learning may not be feasible or desirable, given the very high dimensions of deep neural networks. Hence, there is a technique of fine-tuning of learning rates in applying standard GD or SGD. One way is to choose many learning rates from a grid search, with the hope that some of the learning rates can give good results. (However, if the loss function does not have global Lipschitz continuous gradient, then the example with $f(t)=|t|^{1.5}\,$ above shows that grid search cannot help.) Another way is the so-called adaptive standard GD or SGD, some representatives are Adam, Adadelta, RMSProp and so on, see the article on Stochastic gradient descent. In adaptive standard GD or SGD, learning rates are allowed to vary at each iterate step n, but in a different manner from Backtracking line search for gradient descent. Apparently, it would be more expensive to use Backtracking line search for gradient descent, since one needs to do a loop search until Armijo's condition is satisfied, while for adaptive standard GD or SGD no loop search is needed. Most of these adaptive standard GD or SGD do not have the descent property $f(x_{n+1})\leq f(x_{n})$, for all n, as Backtracking line search for gradient descent. Only a few has this property, and which have good theoretical properties, but they turn out to be special cases of Backtracking line search or more generally Armijo's condition Armijo (1966). The first one is when one chooses learning rate to be a constant <1/L, as mentioned above, if one can have a good estimate of L. The second is the so called diminishing learning rate, used in the well-known paper by Robbins & Monro (1951), if again the function has globally Lipschitz continuous gradient (but the Lipschitz constant may be unknown) and the learning rates converge to 0.

Summary

In summary, backtracking line search (and its modifications) is a method which is easy to implement, is applicable for very general functions, has very good theoretical guarantee (for both convergence to critical points and avoidance of saddle points) and works well in practice. Several other methods which have good theoretical guarantee, such as diminishing learning rates or standard GD with learning rate <1/L – both require the gradient of the objective function to be Lipschitz continuous, turn out to be a special case of Backtracking line search or satisfy Armijo's condition. Even though a priori one needs the cost function to be continuously differentiable to apply this method, in practice one can apply this method successfully also for functions which are continuously differentiable on a dense open subset such as $f(t)=|t|$ or $f(t)=ReLu(t)=\max\{t,0\}$.

See also

• Gradient descent
• Stochastic gradient descent
• Wolfe conditions

References

• Absil, P. A.; Mahony, R.; Andrews, B. (2005). "Convergence of the iterates of Descent methods for analytic cost functions". SIAM J. Optim. 16 (2): 531–547. doi:10.1137/040605266.
• Armijo, Larry (1966). "Minimization of functions having Lipschitz continuous first partial derivatives". Pacific J. Math. 16 (1): 1–3. doi:10.2140/pjm.1966.16.1.
• Attouch, H.; Bolte, J.; Svaiter, B. F. (2011). "Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods". Mathematical Programming. 137 (1–2): 91–129. doi:10.1007/s10107-011-0484-9.
• Bertsekas, Dimitri P. (2016), Nonlinear Programming, Athena Scientific, ISBN 978-1886529052
• Bertsekas, D. P.; Tsitsiklis, J. N. (2006). "Gradient convergence in gradient methods with errors". SIAM J. Optim. 10 (3): 627–642. CiteSeerX 10.1.1.421.193. doi:10.1137/S1052623497331063.
• Bray, A. J.; Dean, D. S. (2007). "Statistics of critical points of gaussian fields on large-dimensional spaces". Physical Review Letters. 98 (15): 150–201. arXiv:cond-mat/0611023. Bibcode:2007PhRvL..98o0201B. doi:10.1103/PhysRevLett.98.150201. PMID 17501322.
• Dauphin, Y. N.; Pascanu, R.; Gulcehre, C.; Cho, K.; Ganguli, S.; Bengio, Y. (2014). "Identifying and attacking the saddle point problem in high-dimensional non-convex optimization". NeurIPS. 14: 2933–2941. arXiv:1406.2572.
• Lange, K. (2013). Optimization. New York: Springer-Verlag Publications. ISBN 978-1-4614-5838-8.
• Dennis, J. E.; Schnabel, R. B. (1996). Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Philadelphia: SIAM Publications. ISBN 978-0-898713-64-0.
• Lee, J. D.; Simchowitz, M.; Jordan, M. I.; Recht, B. (2016). "Gradient descent only converges to minimizers". Proceedings of Machine Learning Research. 49: 1246–1257.
• Nocedal, Jorge; Wright, Stephen J. (2000), Numerical Optimization, Springer-Verlag, ISBN 0-387-98793-2
• Panageas, I.; Piliouras, G. (2017). "Gradient descent only converges to minimizers: non-isolated critical points and invariant regions". 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) (PDF). Leibniz International Proceedings in Informatics (LIPIcs). Vol. 67. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 2:1–2:12. doi:10.4230/LIPIcs.ITCS.2017.2. ISBN 9783959770293.
• Panageas, I.; Piliouras, G.; Wang, X. (2019). "First-order methods almost always avoid saddle points: The case of vanishing step-sizes" (PDF). NeurIPS. arXiv:1906.07772.
• Robbins, H.; Monro, S. (1951). "A stochastic approximation method". Annals of Mathematical Statistics. 22 (3): 400–407. doi:10.1214/aoms/1177729586.
• Truong, T. T.; Nguyen, H.-T. (6 September 2020). "Backtracking Gradient Descent Method and Some Applications in Large Scale Optimisation. Part 2: Algorithms and Experiments". Applied Mathematics & Optimization. 84 (3): 2557–2586. doi:10.1007/s00245-020-09718-8. hdl:10852/79322.{{cite journal}}: CS1 maint: date and year (link)