Abstract
Empirical risk minimization is recognized as a special form in standard convex optimization. When using a first order method, the Lipschitz constant of the empirical risk plays a crucial role in the convergence analysis and stepsize strategies for these problems. We derive the probabilistic bounds for such Lipschitz constants using random matrix theory. We show that, on average, the Lipschitz constant is bounded by the ratio of the dimension of the problem to the amount of training data. We use our results to develop a new stepsize strategy for first order methods. The proposed algorithm, Probabilistic Upperbound Guided stepsize strategy, outperforms the regular stepsize strategies with strong theoretical guarantee on its performance.
Introduction
Empirical risk minimization (ERM) is one of the most powerful tools in applied statistics, and is regarded as the canonical approach to regression analysis. In the context of machine learning and big data analytics, various important problems such as support vector machines, (regularized) linear regression, and logistics regression can be cast as ERM problems, see for e.g. [17]. In an ERM problem, a training set with m instances, \(\{(\mathbf {a}_i,b_i)\}_{i=1}^m\), is given, where \(\mathbf {a}_i \in \mathbb {R}^n\) is an input and \(b_i \in \mathbb {R}\) is the corresponding output, for \(i=1,2,\dots , m\). The ERM problem is then defined as the following convex optimization problem,
where each loss function \(\phi _i\) is convex with a Lipschitz continuous gradient, and the regularizer \(g:\mathbb {R}^n \rightarrow \mathbb {R}\) is a continuous convex function which is possibly nonsmooth. Two common loss functions are

Quadratic loss function: \(\phi _i(x) = \dfrac{1}{2}(xb_i)^2 .\)

Logistic loss function: \(\phi _i(x) = \log (1+\exp (xb_i)) .\)
One important example of g is the scaled 1norm \(\omega \Vert \mathbf {x}\Vert _1\) with a scaling factor \(\omega \in \mathbb {R}^+\). This particular case is known as \(\ell _1\) regularization, and it has various applications in statistics [3], machine learning [18], signal processing [6], etc. The regularizer g acts as an extra penalty function to regularize the solution of (1). \(\ell _1\) regularization encourages sparse solutions, i.e. it favors solutions \(\mathbf x\) with few nonzero elements. This phenomenon can be explained by the fact that the \(\ell _1\) norm is the tightest convex relaxation of the \(\ell _0\) norm, i.e. the cardinality of the nonzero elements of \(\mathbf x\) [5].
In general, if the regularizer g is nonsmooth, subgradient methods are used to solve (1). However, subgradient methods are not advisable if g is simple enough, and one can achieve higher efficiency by generalizing existing algorithms for unconstrained differentiable convex programs. Much research has been undertaken to efficiently solve ERM problems with simple g’s. Instead of assuming the objective function is smooth and continuously differentiable, they aim to solve problems of the following form
where \(f:\mathbb {R}^n \rightarrow \mathbb {R}\) is a convex function with LLipschitz continuous gradient, and \(g:\mathbb {R}^n \rightarrow \mathbb {R}\) is a continuous convex function which is nonsmooth but simple. By simple we mean that a proximal projection step can be performed either in closed form or is at least computationally inexpensive. Norms, and the \(\ell _1\) norm in particular satisfy this property. A function f is said to have a LLipschitz continuous gradient if
For the purpose of this paper, we denote the matrix \(\mathbf {A} \in \mathbb {R}^{m \times n}\) to be a dataset such that the \(i^{\text {th}}\) row of \(\mathbf {A}\) is \(\mathbf {a}_i^T\), and so in the case of ERM problems,
where \(\mathbf {e}_i \in \mathbb {R}^m\) has 1 on its \(i^{\text {th}}\) component and 0’s elsewhere. f is called the empirical risk in ERM. We assume that each \(\phi _i\) have a \(\gamma _i\)Lipschitz continuous gradient and
Many algorithms [1, 4, 9, 13, 20] have been developed to solve (1) and (2). One famous example is the Fast Iterative ShrinkageThresholding Algorithm (FISTA) [1], which is a generalization of the optimal method proposed by Nesterov [10] for unconstrained differentiable convex programs. FISTA, with backtracking stepsize strategy, is known to converge according to the following rate,
where \(\mathbf {x}_{\star }\) is a solution of (2), and \(\eta \) is the parameter which is used in the backtracking stepsize strategy. The convergence result in (5) contains three key components: the distance between the initial guess and the solution \(\Vert \mathbf {x}_0  \mathbf {x}_{\star } \Vert \), the number of iterations k, and the Lipschitz constant L. While it is clear that the first two components are important to explain the convergence behavior, the Lipschitz constant, L, is relatively mysterious.
The appearance of L in (5) is due to algorithm design. In each iteration, one would have to choose a constant \(\tilde{L}\) to compute the stepsize that is proportional to \(1/\tilde{L}\), and \(\tilde{L}\) has to be large enough to satisfy the properties of the Lipschitz constant locally [1, 13]. Since the global Lipschitz constant condition (3) is a more restrictive condition, the Lipschitz constant L always satisfies the requirement of \(\tilde{L}\), and so L is used in convergence analysis. We emphasize that the above requirement of \(\tilde{L}\) is not unique for FISTA. For most first order methods that solve (2), L also appears in their convergence rates for the same reason.
Despite L being an important quantity in both convergence analysis and stepsize strategy, it is usually unknown and the magnitude could be arbitrary for a general nonlinear function; one could artificially construct a small dimensional function with large Lipschitz constant, and a high dimensional function with small Lipschitz constant.
Therefore, L is often treated as a constant [10, 11] that is independent of the dimensions of the problem, and so the convergence result shown in (5) is considered to be “dimensionfree” because both \(\Vert \mathbf {x}_0  \mathbf {x}_{\star } \Vert \) and k are independent of the dimension of the problem. Dimensionfree convergence shows that for certain types of optimization algorithms, the number of iterations required to achieve a certain accuracy is independent of the dimension of the model. For large scale optimization models that appear in machine learning and big data applications, algorithms with dimensionfree convergence are extremely attractive [1, 2, 16].
On the other hand, since L is considered to be an arbitrary constant, stepsize strategies for first order methods were developed independent of the knowledge of L. As we will show later, for adaptive strategies that try to use small \(\tilde{L}\) (large stepsize), extra function evaluations will be needed. If one try to eliminate the extra function evaluations, then \(\tilde{L}\) has to be sufficiently large, and thus the stepsize would be small. This tradeoff is due to the fact that L is unknown.
In this paper, we take the first steps to show that knowledge of L can be obtained in the case of ERM because of its statistical properties. For the ERM problem, it is known that the Lipschitz constant is highly related to \(\Vert \mathbf {A}\Vert \) [1, 14], and so understanding the properties of \(\Vert \mathbf {A}\Vert \) is the goal of this paper. If \(\mathbf {A}\) is arbitrary, then \(\Vert \mathbf {A}\Vert \) would also be arbitrary and analyzing \(\Vert \mathbf {A}\Vert \) would be impossible. However, for ERM problems that appear in practice, \(\mathbf {A}\) is structured. Since \(\mathbf {A}\) is typically constructed from a dataset then it is natural to assume that the rows of \(\mathbf {A}\) are independent samples of some random variables. This particular structure of \(\mathbf {A}\), allows us to consider \(\mathbf {A}\) as a nonarbitrary but random matrix. We are therefore justified to apply techniques from random matrix theory to derive the statistical bounds for the Lipschitz constant.
The contributions of this paper is twofold:

(a)
We obtain the average/probabilistic complexity bounds which provide better understanding of how the dimension, size of training set, and correlation affect the computational complexity. In particular, we showed that in the case of ERM, the complexity is not “dimensionfree”.

(b)
The derived statistical bounds can be computed/estimated with almost no cost, which is an attractive benefit for algorithms. We develop a novel stepsize strategy called Probabilistic Upperbound Guided stepsize strategy (PUG). We show that PUG may save unnecessary cost of function evaluations by adaptively choosing \(\tilde{L}\) intelligently. Promising numerical results are provided at the end of this paper.
Many research on bounding extreme singular values using random matrix theory have been taken in recent years, e.g. see [8, 15, 19]. However, we would like to emphasize that developments in random matrix theory is not our objective. Instead, we would like to consider this topic as a new and important application of random matrix theory. To the best of our knowledge, no similar work has been done in understanding how the statistics of the training set would affect the Lipschitz constant, computational complexity, and stepsize.
Preliminaries
This paper studies the Lipschitz constant L of the empirical risk f given in (4). In order to satisfy condition (3), one could select an arbitrarily large L, however, this would create a looser bound on the complexity (see for e.g. (5)). Moreover, L also plays a big role in stepsize strategy for first order algorithms. In many cases such as FISTA, algorithms use stepsize that is proportional to 1 / L. Therefore, a smaller L is always preferable because it does not only imply lower computational complexity, but also allows a larger stepsize for algorithms. While the lowest possible L that satisfies (3) is generally very difficult to compute, in this section, we will estimate the upper and lower bounds of L using the dataset \(\mathbf {A}\).
Notice that the Lipschitz constant condition (3) is equivalent to the following condition.
Therefore, a L that satisfies (6) also satisfies (3), and vice versa.
Proposition 1
Suppose f is of the form (4), then L satisfies the Lipschitz constant condition (6) with
Proof
See Proposition 2.1 in [14]. \(\square \)
Proposition 1 provides an upper bound for L, where \(\gamma \) is the maximum Lipschitz constant of loss functions, and it is usually known or easy to compute. For example, it is known that \(\gamma = 1\) for quadratic loss functions, and \(\gamma = \max _i b_i^2/4\) for logistics loss functions.
The upper bound of L is tight for the class of ERM problems. We can prove that by considering the example of least squares, where we have
In order to derive the lower bound of L, we need the following assumption.
Assumption 2
There exists a positive constant \(\tau > 0\) such that
for \(i=1,2,\dots , m\).
The above assumption requires the stronglyconvex loss function \(\phi _i\), which is not restrictive in practical setting. In particular, quadratic loss function satisfies Assumption 2, and the logistics loss function satisfies Assumption 2 within a bounded box \([b,b]\) for any positive \(b\in \mathbb {R}^{+}\). With the above assumption, we derive the lower bound of L using \(\mathbf {A}\).
Proposition 3
Suppose f is of the form (4) with \(\phi _i\) satisfying Assumption 2 for \(i=1,2,\dots , m\), then L satisfies the Lipschitz constant condition (6) with
Proof
By Assumption 2, for \(i=1,2,\dots , m\),
Therefore,
\(\square \)
From Propositions 1 and 3, we bound L using the largest and lowest eigenvalues of \(\mathbf {A}^T\mathbf {A}\). Even though \(\mathbf {A}\) can be completely different for different dataset, the statistical properties of \( \mathbf {A} \) can be obtained via random matrix theory.
Complexity analysis using random matrix theory
In this section, we will study the statistical properties of \( \Vert \mathbf {A}\Vert ^2= \Vert \mathbf {A}^T\mathbf {A}\Vert = \lambda _{\max }(\mathbf {A}^T\mathbf {A})\) as well as \(\lambda _{\min }(\mathbf {A}^T\mathbf {A})\). Recall that \(\mathbf {A}\) is an \(m \times n\) matrix containing m observations, and each observation contains n measurements which are independent samples from n random variables, i.e. we assume the rows of the matrix \(\mathbf {A}\) are samples from a vector of n random variables \({\varvec{\xi }}^T=(\xi _1,\xi _2,\ldots ,\xi _n)\) with covariance matrix \({\varvec{\Sigma }} = \mathbb {E}\left[ {\varvec{\xi }} {\varvec{\xi }}^T \right] \). To simplify the analysis, we assume, without loss of generality, that the observations are normalized, and so all the random variables have mean zero and unit variance. Therefore, \(\mathbb {E}[\xi _i] = 0\) for \(i = 1,2,\ldots , n\), and the diagonal elements of \({\varvec{\Sigma }}\) are all 1’s. This assumption is useful and simplifies the arguments and the analysis of this section but it is not necessary. The results from this section could be generalized without the above assumption, but it does not give further insights for the purposes of this section. In particular, this assumption will be dropped for the proposed stepsize strategy PUG, and so PUG is vaild for all the datasets used in practice.
Statistical bounds
We will derive both the upper and lower bounds for the average \(\Vert \mathbf {A} \Vert ^2\), and show that the average \(\Vert \mathbf {A} \Vert ^2\) increases nearly linearly in both m and n. The main tools for the proofs below can be found in [19].
Lower bounds
The following Lemma follows from Jensen’s inequality and plays a fundamental role on what is to follow.
Lemma 4
For a sequence \(\{ \mathbf {Q}_k : k = 1,2,\ldots ,m \}\) of random matrices,
Proof
For details, see [19].
With Lemma 4, we can derive a lower bound on the expected \(\Vert \mathbf {A}^T\mathbf {A}\Vert \).
We will start by proving the lower bound in the general setting, where the random variables are correlated with general covariance matrix \({\varvec{\Sigma }}\); then, we will add assumptions on \({\varvec{\Sigma }}\) to derive lower bounds in different cases.
Theorem 5
Let \(\mathbf {A}\) be an \(m \times n\) random matrix in which its rows are independent samples of some random variables \({\varvec{\xi }}^T=(\xi _1,\xi _2,\ldots ,\xi _n)\) with \(\mathbb {E}[\xi _i] = 0\) for \(i = 1,2,\ldots , n\), and covariance matrix \({\varvec{\Sigma }}\). Denote \(\mu _{\max } = \lambda _{\max }( {\varvec{\Sigma }} )\) then
In particular, if \(\xi _1,\xi _2,\ldots ,\xi _n\) are some random variables with zero mean and unit variance, then
Proof
We first try to prove (7). Denote \(\mathbf {a}_i^T\) as the \(i^{\text {th}}\) row of \(\mathbf {A}\). We can rewrite \(\mathbf {A}^T\mathbf {A}\) as
where \(\mathbf {a}_k\mathbf {a}_k^T,\)’s are independent random matrices with \(\mathbb {E} \left[ \mathbf {a}_k\mathbf {a}_k^T\right] = {\varvec{\Sigma }}\). Therefore,
In order to prove (8), we use the fact that
where the last inequality is obtained by applying Jensen’s inequality. Therefore, we can write \(\mathbf {A}\mathbf {A}^T\) as
where \(\mathbf {Y}_{i,j} \in \mathbb {R}^{m \times m}\) is a matrix such that \((\mathbf {Y}_{i,j})_{p,q} = 1\) if \(i=p\) and \(j=q\), and otherwise \((\mathbf {Y}_{i,j})_{p,q} = 0\). By the assumption that each entry of \(\mathbf {A}\) are random variable with zero mean and unit variance, we obtain
for \( i=1,2,\ldots , m,\) and for \(i\ne j\),
Therefore,
\(\square \)
Theorem 5 provides a lower bound of the expected \(\Vert \mathbf {A}^T\mathbf {A}\Vert \). The inequality in (7) is a general result and makes minimal assumptions on the covariance \({\varvec{\Sigma }}\). Note that the lower bound is independent of n. The reason is that this general setting covers cases where \({\varvec{\Sigma }}\) is not full rank: some \(\xi _i\)’s could be fixed 0’s instead of having unit variance. In fact, when all \(\xi _i\)’s are 0’s for \(i=1,2,\ldots ,n\), which implies \({\varvec{\Sigma }} = \mathbf {0}_{n \times n}\), the bound (7) is tight because \(\mathbf {A} = \mathbf {0}_{m\times n}\). For the setting that we consider in this paper, Eq. (8) is a tighter bound than (7) and depends on both m and n. In the case where all variables are independent, we could simplify the results above into the following.
Corollary 6
Let \(\mathbf {A}\) be an \(m \times n\) random matrix in which its rows are independent samples of some random variables \({\varvec{\xi }}^T=(\xi _1,\xi _2,\ldots ,\xi _n)\) with \(\mathbb {E}[\xi _i] = 0\), \(\mathbb {E}[\xi _i^2] = 1\), and \(\xi _i\)’s are independent for \(i = 1,2,\ldots , n\), then
Proof
Since all random variables are independent, \({\varvec{\Sigma }} = \mathbf {I}_n\) and so \(\mu _{\max } = \lambda _{\max }({\varvec{\Sigma }}){=}~1\).
Upper bounds
In order to compute an upper bound of the expected \(\Vert \mathbf {A}^T\mathbf {A}\Vert \), we first compute its tail bounds. The idea of the proof is to rewrite the \(\mathbf {A}^T\mathbf {A}\) as a sum of independent random matrices, and then use the existing results in random matrix theory to derive the tail bounds of \(\Vert \mathbf {A}^T\mathbf {A}\Vert \). We then compute the upper bound of the expected value. Notice that our approach for computing the tail bounds, in principle, is the same as in [19]. However, we present a tail bound that is easier to be integrated into the upper bound of the expected \(\Vert \mathbf {A}^T\mathbf {A}\Vert \). That is, the derived bound can be directly used to bound \(\Vert \mathbf {A}^T\mathbf {A}\Vert \) without any numerical constant.
In order to compute the tail bounds, the following two Lemmas will be used.
Lemma 7
[19] Suppose that \(\mathbf {Q}\) is a random positive semidefinite matrix that satisfies \(\lambda _{\max }(\mathbf {Q}) \le 1 \). Then
where \(\mathbf {I}\) is the identity matrix in the correct dimension.
Lemma 8
[19] Consider a sequence \(\{\mathbf {Q}_k:k=1,2,\ldots ,m\}\) of independent, random, selfadjoint matrices with dimension n. For all \(t \in \mathbb {R}\),
Combining the two results from random matrix theory, we can derive the following theorem for the tail bound of \(\Vert \mathbf {A}^T\mathbf {A}\Vert \).
Theorem 9
Let \(\mathbf {A}\) be an \(m \times n\) random matrix in which its rows are independent samples of some random variables \({\varvec{\xi }}^T =(\xi _1,\xi _2,\ldots ,\xi _n)\) for \(i = 1,2,\ldots , n\), and covariance matrix \({\varvec{\Sigma }} = \mathbb {E}\left[ {\varvec{\xi }} {\varvec{\xi }}^T \right] \). Denote \(\mu _{\max } = \lambda _{\max }( {\varvec{\Sigma }})\) and suppose
Then, for any \(\theta ,t \in \mathbb {R}^+\),
In particular,
Proof
Denote \(\mathbf {a}_i^T\) as the \(i^{\text {th}}\) row of \(\mathbf {A}\). We can rewrite \(\mathbf {A}^T\mathbf {A}\) as
Notice that \(\mathbf {a}_k\mathbf {a}_k^T\)’s are independent, random, positivesemidefinite matrices, and \(\mathbb {E}\left[ \mathbf {a}_k\mathbf {a}_k^T\right] = {\varvec{\Sigma }}\), for \(k=1,2,\ldots ,m\). Also, Using the Lemma 8, for any \(\theta >0\), we have
Notice that \(\lambda _{\max }(\mathbf {a}_k\mathbf {a}_k^T) \le R\), by rescaling on Lemma 7, we have,
and thus
Using standard calculus, the upper bound is minimized when
Therefore,
\(\square \)
For matrices which contain samples from unbounded random variables, assumption (11) in Theorem 9 might seem to be restrictive; however, in practice, assumption (11) is mild due to the fact that datasets that are used in the problem (1) are usually normalized and bounded. Therefore, it is reasonable to assume that an observation will be discarded if its magnitude is larger than some constant.
The tail bound (13) is the tightest bound over all possible \(\theta \)’s in (12), but it is difficult to interpret the relationships between the variables. The following corollary takes a less optimal \(\theta \) in (12), but yields a bound that is easier to understand.
Corollary 10
In the same setting as Theorem 9, we have
In particular, for \(\epsilon \in \mathbb {R}^+\), we have
Proof
Using Eq. (12), and the fact that \(log(y) \le y1\), \(\forall y \in \mathbb {R}^+\) , we have
The above upper bound is minimized when \(\theta = (1/R)\log \left[ t/(m\mu _{\max })\right] \), and so
Set \(\epsilon = n \exp \left[ \dfrac{1}{R}\left( 2m\mu _{\max }  t \right) \right] \), we obtain \(t = 2m\mu _{\max }  R \log \left( \dfrac{\epsilon }{n} \right) \). \(\square \)
The bound in (15) follows directly from (14) and shows that with high probability \(1\epsilon \) (for small \(\epsilon \)), \(\lambda _{\max } \left( \mathbf {A}^T\mathbf {A} \right) \) is less than \(2m\mu _{\max } + R\log (n) R \log \left( \epsilon \right) \). Applying the results in Corollary 10 provides the upper bound of the expected \(\Vert \mathbf {A}^T\mathbf {A}\Vert \).
Corollary 11
In the same setting as Theorem 9, we have
Proof
Using the Eq. (14), and the fact that
we have
\(\square \)
Therefore, for a matrix \(\mathbf {A}\) which is constructed by a set of normalized data, we obtain the bound
The result in (18) might look confusing because for small m and large n, the lower bound is of the order of n while the upper bound is of the order of \(\log (n)\). The reason is that we have to take into account the factor of dimensionality in the constant R. To illustrate this, we prove the following corollary.
Corollary 12
Let \(\mathbf {A}\) be an \(m \times n\) random matrix in which its rows are independent samples of some random variables \({\varvec{\xi }}^T =(\xi _1,\xi _2,\ldots ,\xi _n)\) with \(\mathbb {E}[\xi _i] = 0\) for \(i = 1,2,\ldots , n\), and covariance matrix \({\varvec{\Sigma }} = \mathbb {E}\left[ {\varvec{\xi }} {\varvec{\xi }}^T \right] \). Denote \(\mu _{\max } = \lambda _{\max }( {\varvec{\Sigma }})\) and suppose \(\vert \xi _i \vert \le c\) almost surely for \(i=1,2,\ldots ,n\). Then
and so
Proof
Since \({\varvec{\xi }} {\varvec{\xi }}^T\) is a symmetric rank 1 matrix, we have
\(\square \)
Therefore, R increases linearly in n for bounded \({\varvec{\xi }}\). Recall that the lower bound of the expected \(\Vert \mathbf {A}\Vert ^2\) is linear in both m and n, and the upper bound in (20), is almost linear in both m and n. Therefore, our results on the bounds for the expected Lipschitz constant are nearlyoptimal up to some constant.
On the other hand, in order to obtain the lower bound of L, we also need tail bound of \(\lambda _{\min } (\mathbf {A}^T\mathbf {A})\), which is provided in the following theorem.
Theorem 13
Let \(\mathbf {A}\) be an \(m \times n\) random matrix in which its rows are independent samples of some random variables \({\varvec{\xi }}^T =(\xi _1,\xi _2,\ldots ,\xi _n)\) for \(i = 1,2,\ldots , n\), and covariance matrix \({\varvec{\Sigma }} = \mathbb {E}\left[ {\varvec{\xi }} {\varvec{\xi }}^T \right] \). Denote \(\mu _{\min } = \lambda _{\min }( {\varvec{\Sigma }})\) and suppose \(\vert \xi _i \vert \le c\) almost surely for \(i=1,2,\dots , n\).
Then, if \(\mu _{\min } \ne 0\), for any \(\epsilon \in \left( n \exp \left[  \frac{m\mu _{\min }}{2nc^2} \right] \ ,n \right) \)
Proof
Suppose \(\vert \xi _i \vert \le c\) almost surely for \(i=1,2,\dots , n\). Then using Corollary 12 we have
Using the Theorem 1.1 from [19], for any \(\theta \in (0,1)\) we have
Notice that \(\theta >0 \) and
and so
For \(\mu _{\min } \ne 0\), we let \(\epsilon = n \exp \left[  \left( \theta  1\right) ^2 \frac{m\mu _{\min }}{2R} \right] \) and so
In particular, suppose \(\epsilon \in \left( n \exp \left[  \frac{m\mu _{\min }}{2R} \right] \ ,n \right) \), then
Therefore,
for \(\epsilon \in \left( n \exp \left[  \frac{m\mu _{\min }}{2R} \right] \ ,n \right) \)\(\square \)
For the tail bound in Theorem 13 to be meaningful, m has to be sufficiently large compared to n. In such cases, the smallest eigenvalue \(\lambda _{\min } \left( \mathbf {A}^T\mathbf {A} \right) \) is at least \(\mathcal {O}(m\sqrt{nm\log {n}})\) with high probability.
Complexity analysis
In this section, we will use the probabilistic bounds of L to study the complexity of solving ERM. We focus only on FISTA for illustrative purpose and clear presentation of the idea of the proposed approach. But the approach developed in this section can be applied to other algorithms as well.
By the assumption that \(\mathbf {A}\) is a random matrix, we also have the solution \(\mathbf {x}_{\star }\) as a random vector. Notice that the study of randomization of \(\mathbf {x}_{\star }\) is not covered this paper. In particular, if the statistical properties of \(\mathbf {x}_{\star }\) can be obtained, existing optimization algorithms might not be needed to solve the ERM problem. Therefore, in this paper, we remove this consideration by denoting a constant M such that \(\Vert \mathbf {x}_0  \mathbf {x}_{\star } \Vert ^2 \le M\). In such case, we have the FISTA convergence rate
where \(\mathbf {x}_{\star }\) is the solution of (1), and \(\eta > 1\) is the parameter which is used in the backtracking stepsize strategy.
Using Proposition 1 and Corollary 12, we know
Thus, on average,
In (22)–(23), the lower bound of \((\gamma /m) \mathbb {E} \left[ \Vert \mathbf {A} \Vert ^2 \right] \) is linear in n / m, and upper bound is nearlylinear in n / m. This suggests that the average complexity of ERM is bounded by the ratio of the dimensions to the amount of data. In particular, problems with overdetermined systems (\(m>>n\)) can be solved more efficiently than problems with underdetermined systems (\(m<n\)).
Another critical factor of the complexity is \(\mu _{\max } = \lambda _{\max }({\varvec{\Sigma }})\), where \({\varvec{\Sigma }}\) is the covariance matrix of the rows of \(\mathbf {A}\). In the ideal situation of regression analysis, all inputs should be statistically linearly independent. In such cases, since we assume the diagonal elements of \({\varvec{\Sigma }}\) are 1’s, \(\mu _{\max }=1\). It is, however, almost impossible to ensure this situation for practical applications. In practice, since \({\varvec{\Sigma }} \in \mathbb {R}^{n \times n}\), \(\mu _{\max } = \lambda _{\max }({\varvec{\Sigma }}) = \Vert {\varvec{\Sigma }} \Vert \) is likely to increase as n increases.
Similarly we can compute the probabilistic lower bound of L in the case that m is sufficiently larger than n. Using Theorem 13, we can show that L is bounded above by
We emphasize the lower bound of L is not equivalent to the lower bound of the complexity. However, since the stepsize of first order method algorithms is proportional to 1 / L, this result indicates that the upper bound of the stepsize which potentially could guarantee convergence.
PUG: Probabilistic Upperbound Guided stepsize strategy
The tail bounds in Sect. 3, as a byproduct of the upper bound in Sect. 3.1.2, can also be used in algorithms. As mentioned in the introduction, L is an important quantity in the stepsize strategy since the stepsize is usually inversely proportional to L. However, in large scale optimization, the computational cost of evaluating \(\Vert \mathbf {A}\Vert ^2\) is very expensive. One could use backtracking techniques to avoid the evaluation of the Lipschitz constant; in each iteration, we find a large enough constant \(\tilde{L}\) such that it satisfies the properties of the Lipschitz constant locally. In the case of FISTA [1], for the \(k^{\text {th}}\) iteration with incumbent \(\mathbf {x}_k\) one has to find a \(\tilde{L}\) such that
where,
and \(p_{\tilde{L}}(\mathbf {y}) \triangleq \arg \min _{\mathbf {x}} \{Q_{\tilde{L}}(\mathbf {x},\mathbf {y}): \mathbf {x} \in \mathbb {R}^n \}\). Equation (24) is identical to the Lipschitz constant condition (6) with specifically \(\mathbf {y} = p_{\tilde{L}}(\mathbf {x}_k)\) and \(\mathbf {x} = \mathbf {x}_k\). Therefore, (24) is a less restrictive condition compared to the Lipschitz constant condition (6). This indicates that \(\tilde{L}\) could be much smaller than L, and so it yields to larger stepsize. On the other hand, for \(\tilde{L} \ge L\), it is guaranteed that the local Lipschitz constant condition will be satisfied. In both cases, when computing L is intractable, we would not be able to distinguish the two cases by just having \(\tilde{L}\) that satisfies (24).
As we can see, finding a good \(\tilde{L}\) involves a series of function evaluations. In the next section, we will review the commonly used stepsize strategies.
Current stepsize strategies
To the best of our knowledge, current strategies fall into four categories:

(i)
A fixed stepsize from estimation of \(\Vert \mathbf {A} \Vert ^2\).

(ii)
Backtrackingtype method with initial guess \(\tilde{L}_0\), and monotonically increase \(\tilde{L} = \eta ^p \tilde{L}_0\) when it does not satisfy Lipschitz condition locally (\(\eta > 1\), \(p=0,1,\dots \)). See [1] for details.

(iii)
Adaptivetype method with initial guess \(\tilde{L}_0\). Suppose \(\tilde{L}_k\) is used for the \(k^{\text {th}}\) iteration, then find the smallest p such that \(\tilde{L}_{k+1} = 2^p \tilde{L}_k\) satisfies Lipschitz condition locally (\(p= 1,0,1,\dots \)). See Nesterov’s universal gradient methods [12] for details.

(iv)
Adaptive stepsize strategy for a specific algorithm. See [7] for example.
Theorem 14
Suppose \(\tilde{L}\) is used as an initial guess for the \(k^{\text {th}}\) iteration, and we select the smallest \(q \in \mathbb {N}\) such that \(\tilde{L}_k = \eta ^q \tilde{L}\) satisfies the local condition, for \(\eta \ge 1\). To guarantee convergence, it requires
which is also the numbers of function evaluations required. We have
Proof
To guarantee convergence, it requires q such that \(\tilde{L}_k = \eta ^q \tilde{L} \ge L\). If \(\tilde{L} \le L\), q should be selected such that \(\eta ^q \tilde{L} \le \eta L\); otherwise \(q1\) will be large enough to be selected, i.e. \(\tilde{L}_k = \eta ^{q1} \tilde{L} \ge L\). \(\square \)
Theorem 14 covers the setting of choice (i)–(iii), also referred to as the fixed stepsize strategy, backtracking method, and Nesterov’s adaptive method, respectively. For fixed stepsize strategies, \(\tilde{L} \ge L\) is selected for all iterations, which yields \(q=0\), and thus checking the local condition is not required [1]. For backtracking method, \(\tilde{L} = \tilde{L}_{k1}\) and \(\eta > 1\) is a parameter of the strategy. Since \(\tilde{L}_k\) is monotonically increasing in k, q is monotonically decreasing. Therefore, q at the \(k^{\text {th}}\) iteration is equivalent to the total number of (extra) function evaluations for the rest of the iterations.
On the other hand, for Nesterov’s adaptive method, \(\tilde{L} = \tilde{L}_{k1}/2\) and \(\eta = 2\). \(\tilde{L}_k\) is not monotonically increasing in k, and in each iteration, q is the number of function evaluations in the worst case. Notice that once the worst case occurs (having q function evaluations) in the \(k^{\text {th}}\) iterations, q will be smaller since \(\tilde{L}_k\) is sufficiently large. In Nesterov’s universal gradient methods [12], Nesterov proved that for k iterations, the number of function evaluations is bounded by \(\mathcal {O}(2k)\).
Theorem 14 illustrates the tradeoff between three aspects: aggressiveness of initial guess \(\tilde{L}\), recovering rate \(\eta \), and the convergence rate. Methods with small (aggressive) initial guess \(\tilde{L}\) have the possibility to result in larger stepsize. However, it will yield a larger q, the number of function evaluations in the worst case. One could reduce q by setting a larger \(\eta \), and so \(\tilde{L}\) could scale quickly towards L, but it will generate a slower rate of convergence (\(\eta L\)). If one wants to preserve a good convergence rate (small \(\eta \)) with small number of function evaluations (small q), then \(\tilde{L}\) could not be too small. In that case one has to give up on the opportunity of having large stepsizes. The fixed stepsize strategy is the extreme case of minimizing q by giving up the opportunity of having larger stepsizes.
The proposed stepsize strategy PUG tries to reduce \(\tilde{L}\) as (iii), but guides \(\tilde{L}\) to increase reasonably and quickly when it fails to satisfy the local condition. In particular, by replacing L with its probabilistic upper bound, aggressive \(\tilde{L}\) and fast recovering rate are allowed without slowing the convergence. This above feature does not obey the tradeoff that constraints choice (i)–(iii). Also, PUG is flexible compared to (iv). It can be applied to all algorithms that require L, as well as minibatch and blockcoordinatetype algorithms which require submatrix of \(\mathbf {A}\).
PUG
In this section, we will use the tail bounds to develop PUG. Using Eq. (15), we first define the upper bound at different confidence level,
with probability of at least \(1\epsilon \). We point out that the probabilistic upper bound (15) does not rely on the assumption that the dataset is normalized with mean zero and unit variance, and so it is applicable to all types of datasets. The basic idea of PUG is to use the result in the following Theorem.
Theorem 15
Suppose \(\tilde{L}\) is used as an initial guess for the \(k^{\text {th}}\) iteration, and we denote
where \(\mathcal {U}(\epsilon )\) is defined as in (25). If we select the smallest \(q \in \mathbb {N}\) such that \(\tilde{L}_k = \eta _{\text {PUG},N}^q \tilde{L}\) satisfies the local condition, then with probability of at least \(1\epsilon \), it requires \(q=N\) to guarantee convergence. In particular, we have
with probability of at least \(1\epsilon \).
Proof
To guarantee convergence, it requires q such that \(\tilde{L}_k = \eta _{\text {PUG},N}^q \tilde{L} \ge L\). When \(q=N\), \(\tilde{L}_k = \mathcal {U}(\epsilon ) \ge L\) with probability of at least \(1\epsilon \). \(\square \)
Theorem 15 shows the potential advantage of PUG. With any initial guess \(\tilde{L}\), PUG is able to scale \(\tilde{L}\) quickly towards L without interfering with the probabilistic convergence rate. This unique feature allows an aggressive initial guess \(\tilde{L}\) as Nesterov’s adaptive strategy without low recovering rate nor slow convergence rate. Algorithm 1 provided details of PUG with \(N=2\). In Algorithm 1, the Lipschitz constant estimation from last iteration, \(\tilde{L}_k\), is first divided by 2 to be the initial guess \(\tilde{L}\), which is the same as the Nesterov’s adaptive method. We point out that,
Therefore, the convergence of FISTA is guaranteed with PUG, even in the extreme case that \(L \le \mathcal {U}(\epsilon )\) with \(\epsilon \approx 0\).
In the case where computing \(\mu _{\max }\) is impractical, it could be bounded by
With the assumption that \(\xi _i\)’s have zero mean and unit variance, \(\mu _{\max } \le n\). For \(\mathbf {A}\) that does not satisfy these assumptions due to different normalization process of the data, (26) could be used to bound \(\mu _{\max }\). For the R in (25), one could use \(c^2 n\) as in Corollary 12, or a tighter estimation would be
since \( \lambda _{\max } \left[ {\varvec{\xi }} {\varvec{\xi }}^T\right] = \Vert {\varvec{\xi }} {\varvec{\xi }}^T \Vert = {\varvec{\xi }}^T {\varvec{\xi }} = \sum _{i=1}^n \xi _i^2. \)
Convergence bounds: regular strategies versus PUG
Different stepsize strategies would lead to different convergence rates even for the same algorithm. Since PUG is based on the probabilistic upper bound \(\mathcal {U}(\epsilon )\) in (25), it leads to a probabilistic convergence of FISTA. In particular,
with probability at least \(1\epsilon \). Equation (28) holds with probability at least \(1\epsilon \) because of Eq. (25), which holds for all iterations in FISTA. In particular, once the instance (matrix \(\mathbf {A}\)) is fixed, then we have know \(L \le \mathcal {U}(\epsilon )\), with probability at least \(1\epsilon \). If the probabilistic upper bound holds, then \(\mathcal {U}(\epsilon )\) is the worst Lipschitz constant estimation computed by PUG in all iterations, and so (27) holds. Therefore, the above result could be obtained using the same argument as in the proof of convergence in [1].
When using regular stepsize strategies, FISTA results in convergence rates that is in the form of (21) with different \(\eta \)’s (\(\eta > 1\)). For backtracking strategy, \(\eta \) would be an userspecified parameter. It is clear from (21) that convergence is better when \(\eta \) is close to 1. However, it would take more iterations and more function evaluations to find a satisfying stepsize, and these costs are not captured in (21). In the case of Nesterov’s adaptive strategy [12], \(\eta = 2\). Using the same analysis as in Sect. 3.2, L should be replaced with the upper bound in (22) for the average case, or \(\mathcal {U}(\epsilon )\) in (25) for the probabilistic case. For the probabilistic case, those convergences are in the same order as in the case of using PUG, as shown in (28).
Therefore, PUG is competitive compared to other stepsize strategies in the probabilistic case. The strength of PUG comes from the fact that it is adaptive with strong theoretical guarantee that with high probability, \(\tilde{L}_k\) will quickly be accepted at each iteration.
Minibatch algorithms and blockcoordinate algorithms
For minibatch algorithms, each iteration is performed using only a subset of the whole training set. Therefore, in each iteration, we consider a matrix that contains the corresponding subset. This matrix is a submatrix of \(\mathbf {A}\) with the same structure, and therefore it is also a random matrix with smaller size \(\bar{m}\)byn, where \(\bar{m} < m\). Using the existing results, we can conclude that the associated \(\mathcal {U}(\epsilon )\) in each iteration would be larger than those in fullbatch algorithms. As a result, the guaranteed stepsize for minibatch algorithms tends to be smaller than fullbatch algorithms.
On the other hand, blockcoordinate algorithms do not update all dimensions at once in each iteration. Rather, a subset of dimensions will be selected to perform the update. In such setting, we only consider the variables (columns of \(\mathbf {A}\)) that are associated with the selected coordinates. We should consider a submatrix that is formed by columns of \(\mathbf {A}\). This submatrix itself is also a random matrix with smaller size mby\(\bar{n}\), where \(\bar{n} < n\). Using the existing results, the guaranteed stepsize for blockcoordinate algorithms tends to be larger.
Thus, with minor modifications PUG can be applied to minibatch and blockcoordinate algorithms.
Numerical experiments
In the first part of this section, we will apply the bounds from Sect. 3 to illustrate the relationship between different parameters and L. Then, we will perform the PUG on two regression examples. The datasets used for the two regression examples can be found at https://www.csie.ntu.edu.tw/~cjlin/libsvmtools/datasets.
Numerical simulations for average L
We consider three cases, and in each case we simulate \(\mathbf {A}\)’s in different dimension m’s and n’s. Each configuration is simulated with 1000 instances, and we study the sample average behaviors of L.
In the first case, we consider the most complicated situation and create random vector such that its entries are not identical nor independent. We use a mixture of three types of random variables (exponential, uniform, and multivariate normal) to construct the matrix \(\mathbf {A} \in \mathbb {R}^{m\times n}\). The rows of \(\mathbf {A}\) are independent samples of \({\varvec{\xi }}^T = (\xi _1,\xi _2,\ldots ,\xi _n)\). We divide \(\mathbf {A}\) into three parts with \(n_1\), \(n_2\), and \(n_3\) columns. Note that \(n_1 = n_2 = n_3 = n/3\) up to rounding errors. We assign \({\varvec{\xi }}\) with the elements where
and \((\xi _{n_1+n_2+1},\xi _{n_1+n_2+2},\ldots ,\xi _n)\sim \mathcal {N}(\mathbf {0}_{n_3 \times 1},{\hat{\varvec{\Sigma }}})\). \({\hat{\varvec{\Sigma }}}\) is a \(n_3 \times n_3\) matrix with 1 on the diagonal and 0.5 otherwise. \(\xi _1,\xi _2,\ldots ,\xi _{n_1+n_2}\) are independent.
The scaling factors of the uniform distribution and exponential distribution are used to normalize the uniform random variables \(\xi _j\) such that \(\mathbb {E}[\xi _j]=0\), and \(\mathbb {E}[\xi _j^2]=1\). Some entries of \(\mathbf {A}\) are normally distributed or exponentially distributed, and we approximate the upper bound of the entries with \(c=3\). From statistics, we know that with very high probability, this approximation is valid.
In Fig. 1, we plot the sample average Lipschitz constant over 1000 instances. As expected, the expected Lipschitz constant is “trapped” between its lower and upper bound. We can see that the expected L increases when m and n increases with the ratio n / m is fixed. This phenomenon is due the fact that \(\mu _{\max } = \lambda _{\max }({\varvec{\Sigma }})\) increases as n increases.
To further illustrate this, we consider the second case. The setting in this case is the same as the first case except that we replace \({\hat{\varvec{\Sigma }}}\) with \(\mathbf {I}_n\). So, all the variables are linearly independent. In the case, \(\mu _{\max }=1\) regardless the size of the \(\mathbf {A}\). The ratio \(n/m = 2\) in this example. From Fig. 2, the sample average L does not increase rapidly as the size of \(\mathbf {A}\) increases. These results match with the bound (22).
In the last case, we investigate the effect of the ratio n / m. The setting is same as the first case, but we keep \(n=1024\) and test with different m’s. From Fig. 3, the sample average L decreases as m increases. This result suggests that a large dataset is favorable in terms of complexity, especially for largescale (large n) ERM problems.
Regularized logistics regression
We implement FISTA with three different stepsize strategies (i) the regular backtracking stepsize strategy, (ii) the Nesterov’s adaptive stepsize strategy, and (iii) the proposed adaptive stepsize strategy PUG. We compare the three strategies with an example in a \(\ell _1\) regularized logistic regression problem, in which we solve the convex optimization problem
We use the dataset gisette for \(\mathbf {A}\) and \(\mathbf {b}\). Gisette is a handwritten digits dataset from the NIPS 2003 feature selection challenge. The matrix \(\mathbf {A}\) is a \(6000 \times 5000\) dense matrix, and so we have \(n=5000\) and \(m=6000\). The parameter \(\omega \) is chosen to be the same as [9, 21]. We chose \(\tilde{L}_0 = 1\) for all three stepsize strategies. For backtracking stepsize strategy, we chose \(\eta = 1.5\).
We compare our proposed probabilitic bound and the deterministic upper bound \(\bar{L}\) using \(\Vert \mathbf {A} \Vert ^2 \le \text {trace}(\mathbf {A}^T \mathbf {A})\). We estimate \(\mu _{\max } = 1289.415\) and \(R = 4955\) using Eqs. (26) and (27), respectively. We thus obtain our probabilistic bound \(\mathcal {U}(0.1) = 646.941\), which is less than the deterministic upper bound \(\bar{L} = 1163.345\).
Table 1 shows the performances of three stepsize strategies. T is the scaled computational time, nIter is the scaled number of iterations, nFunEva is the scaled number of function evaluations, and Avg. \(\tilde{L}\) is the average of \(\tilde{L}\) used. This result encourages the two adaptive stepsize strategies as the number of iterations needed and the computational time are significantly smaller compared to the regular backtracking algorithm. This is due to the fact that \(\tilde{L}\) could be a lot smaller than the Lipschitz constant L in this example, and so the two adaptive strategies provide more efficient update for FISTA. As shown in Table 1, even though Nesterov’s strategy yields smaller \(\tilde{L}\) on average, it leads to higher number of function evaluations and so it takes more time than PUG.
Regularized linear regression
We also compare the three strategies with an example in a \(\ell _1\) regularized linear regression problem, a.k.a LASSO, in which we solve the convex optimization problem
We use the dataset YearPredictionMSDt (testing dataset) for \(\mathbf {A}\) and \(\mathbf {b}\). YearPredictionMSDt has matrix \(\mathbf {A}\) is a \(51630 \times 90\) dense matrix, and so we have \(n=90\) and \(m=51630\). The parameter \(\omega \) is chosen to be \(10^{6}\). We chose \(\tilde{L}_0 = 1\) for all three stepsize strategies. For backtracking stepsize strategy, we chose \(\eta = 1.5\).
We compare our proposed probabilitic bound and the deterministic upper bound \(\bar{L}\) using \(\Vert \mathbf {A} \Vert ^2 \le \text {trace}(\mathbf {A}^T \mathbf {A})\). We estimate \(\mu _{\max } = 9.603 \times 10^6\) and \(R = 4.644 \times 10^9\) using Eqs. (26) and (27), respectively. We thus obtain our probabilistic bound \(\mathcal {U}(0.1) = 1.982 \times 10^7\), which is less than the deterministic upper bound \(\bar{L} = 2.495 \times 10^7\).
Table 2 shows the performance of three stepsize strategies, and the structure is same as Table 1. Unlike Gisette, adaptive strategies failed to provide small \(\tilde{L}\) compared to L. Also, since n is very small, the cost of function evaluation is very cheap compared to Gisette. Therefore, both adaptive strategies do not outperform the backtracking strategy in this example. However, one can see that both adaptive strategies yielded to reduction in terms of the number of function evaluations. Therefore, one could expect they outperform backtracking strategy for larger/difficult instances.
Conclusions and perspectives
The analytical results in this paper show the relationship between the Lipschitz constant and the training set of an ERM problem. These results provide insightful information about the complexity of ERM problems, as well as opening up opportunities for new stepsize strategies for optimization problems.
One interesting extension could be to apply the same approach to different machine learning models, such as neural networks, deep learning, etc.
References
Beck, A., Teboulle, M.: A fast iterative shrinkagethresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183–202 (2009). https://doi.org/10.1137/080716542
Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037–2060 (2013). https://doi.org/10.1137/120887679
Belloni, A., Chernozhukov, V., Wang, L.: Pivotal estimation via squareroot Lasso in nonparametric regression. Ann. Stat. 42(2), 757–788 (2014). https://doi.org/10.1214/14AOS1204
Burke, J.V., Ferris, M.C.: A Gauss–Newton method for convex composite optimization. Math. Program. 71(2, Ser. A), 179–194 (1995). https://doi.org/10.1007/BF01585997
Candès, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207–1223 (2006). https://doi.org/10.1002/cpa.20124
Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289–1306 (2006). https://doi.org/10.1109/TIT.2006.871582
Gonzaga, C.C., Karas, E.W.: Fine tuning Nesterov’s steepest descent algorithm for differentiable convex programming. Math. Program. 138(1–2, Ser. A), 141–166 (2013). https://doi.org/10.1007/s101070120541z
Koltchinskii, V., Mendelson, S.: Bounding the smallest singular value of a random matrix without concentration. Int. Math. Res. Not. 23, 12991–13008 (2015)
Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newtontype methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420–1443 (2014). https://doi.org/10.1137/130921428
Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization, vol. 87. Kluwer Academic Publishers, Boston (2004). https://doi.org/10.1007/9781441988539
Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1, Ser. B), 125–161 (2013). https://doi.org/10.1007/s1010701206295
Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1–2, Ser. A), 381–404 (2015). https://doi.org/10.1007/s1010701407900
Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient blockcoordinate descent algorithms for the group Lasso. Math. Program. Comput. 5(2), 143–169 (2013). https://doi.org/10.1007/s125320130051x
Qu, Z., Richtarik, P.: Coordinate descent with arbitrary sampling II: expected separable overapproximation. arXiv:1412.8063 (2014)
Rudelson, M., Vershynin, R.: Nonasymptotic theory of random matrices: extreme singular values. In: Proceedings of the International Congress of Mathematicians, vol. III, pp. 1576–1602. Hindustan Book Agency, New Delhi (2010)
Saha, A., Tewari, A.: On the nonasymptotic convergence of cyclic coordinate descent methods. SIAM J. Optim. 23(1), 576–601 (2013). https://doi.org/10.1137/110840054
ShalevShwartz, S., BenDavid, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)
Sun, T., Zhang, C.H.: Sparse matrix inversion with scaled Lasso. J. Mach. Learn. Res. 14, 3385–3418 (2013)
Tropp, J.A.: Userfriendly tail bounds for sums of random matrices. Found. Comput. Math. 12(4), 389–434 (2012). https://doi.org/10.1007/s102080119099z
Yamakawa, E., Fukushima, M., Ibaraki, T.: An efficient trust region algorithm for minimizing nondifferentiable composite functions. SIAM J. Sci. Stat. Comput. 10(3), 562–580 (1989). https://doi.org/10.1137/0910036
Yuan, G.X., Ho, C.H., Lin, C.J.: An improved GLMNET for L1regularized logistic regression. J. Mach. Learn. Res. 13(1), 1999–2030 (2012)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The work of the authors was supported, in part, by EPSRC Grants EP/M028240/1 and EP/K040723, by FP7 Marie Curie Career Integration Grant (PCIG11GA2012321698 SOCMPES), and by the Imperial College Junior Research Fellowship.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Ho, C.P., Parpas, P. Empirical risk minimization: probabilistic complexity and stepsize strategy. Comput Optim Appl 73, 387–410 (2019). https://doi.org/10.1007/s10589019000802
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589019000802
Keywords
 Empirical risk minimization
 Complexity analysis
 Stepsize strategy