Iterative Regularization for Learning with Convex Loss Functions

03/31/2015
by   Junhong Lin, et al.
0

We consider the problem of supervised learning with convex loss functions and propose a new form of iterative regularization based on the subgradient method. Unlike other regularization approaches, in iterative regularization no constraint or penalization is considered, and generalization is achieved by (early) stopping an empirical iteration. We consider a nonparametric setting, in the framework of reproducing kernel Hilbert spaces, and prove finite sample bounds on the excess risk under general regularity conditions. Our study provides a new class of efficient regularized learning algorithms and gives insights on the interplay between statistics and optimization in machine learning.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/24/2016

A Consistent Regularization Approach for Structured Prediction

We propose and analyze a regularization approach for structured predicti...
04/30/2014

Learning with incremental iterative regularization

Within a statistical learning setting, we propose and study an iterative...
06/16/2021

Beyond Tikhonov: Faster Learning with Self-Concordant Losses via Iterative Regularization

The theory of spectral filtering is a remarkable tool to understand the ...
10/09/2019

Learning Near-optimal Convex Combinations of Basis Models with Generalization Guarantees

The problem of learning an optimal convex combination of basis models ha...
07/05/2017

Early stopping for kernel boosting algorithms: A general analysis with localized complexities

Early stopping of iterative algorithms is a widely-used form of regulari...
08/30/2010

Fixed-point and coordinate descent algorithms for regularized kernel methods

In this paper, we study two general classes of optimization algorithms f...
09/07/2021

Regularized Learning in Banach Spaces

This article presents a different way to study the theory of regularized...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Availability of large high-dimensional data-sets has motivated an interest in the interplay between statistics and optimization, towards developing new, more efficient learning solutions

[8]

. Indeed, while much theoretical work has been classically devoted to study statistical properties of estimators defined by variational schemes (e.g. Empirical Risk Minimization

[36] or Tikhonov regularization [35]), and to the computational properties of optimization procedures to solve the corresponding minimization problems (see e.g. [32]), much less work has considered the integration of statistical and optimization aspects, see for example [15, 39, 25].

With the latter objective in mind, in this paper, we focus on so called iterative regularization. This class of methods, originated in a series of work in the mid-eighties [23, 26], is based on the observation that early termination of an iterative optimization scheme applied to an ill-posed problem has a regularization effect. A critical implication of this fact is that the number of iterations serves as a regularization parameter, hence linking modeling and computational aspects: computational resources are directly linked to the generalization properties in the data, rather than their raw amount. Further, iterative regularization algorithms have a built-in ”warm restart” property which allows to compute automatically a whole sequence (path) of solutions corresponding to different levels of regularization. This latter property is especially relevant to efficiently determine the appropriate regularization via model selection.

Iterative regularization techniques are well known in the solution of inverse problems, where several variants have been studied, see [18, 21]

and references therein. In machine learning, iterative regularization is often simply referred to as early stopping and is a well known ”trick”, e.g. in training neural networks

[22]. Theoretical studies of iterative regularization in machine learning have mostly focused on the least squares loss function [11, 41, 7, 27]. Indeed, it is in this latter case that the connection to inverse problems can be made precise [38]. Interestingly, early stopping with the square loss has been shown to be related to boosting [11] and also to be a special case of a large class of regularization approaches based on spectral filtering [19, 4]. The regularizing effect of early stopping for loss functions other than the least squares one has hardly been studied. Indeed, to the best of our knowledge the only papers considering related ideas are [3, 6, 20, 45], where early stopping is studied in the context of boosting algorithms.

This paper is a different step towards understanding how early stopping can be employed with general convex loss functions. Within a statistical learning setting, we consider convex loss functions and propose a new form of iterative regularization based on the subgradient method, or the gradient descent if the loss is smooth. The resulting algorithms provide iterative regularization alternatives to support vector machines or regularized logistic regression, and have built in the property of computing the whole regularization path. Our primary contribution in this paper is theoretical. By integrating optimization and statistical results, we establish non-asymptotic bounds quantifying the generalization properties of the proposed method under standard regularity assumptions. Interestingly, our study shows that considering the last iterate leads to essentially the same results as considering averaging, or selecting of the ”best” iterate, as typically done in subgradient methods

[9]. From a technical point of view, considering a general convex loss requires different error decompositions than those for the square loss. Moreover, operator theoretic techniques need to be replaced by convex analysis and empirical process results. The error decomposition we consider, accounts for the contribution of both optimization and statistics to the error, and could be useful also for other methods.

The rest of the paper is organized as as follows. We begin in Section 2 by briefly recalling the supervised learning problem, and then introduce our learning algorithm, discuss its numerical realization. In Section 3, after discussing the assumptions that underlie our analysis, we present our main theorems with discussions and discuss the general error decomposition which are composed of three error terms: the computational, the sample and approximation error terms. In Section 4, we will estimate computational error, while in Section 5, we develop sample error bounds, and finally prove our main results.

2 Learning Algorithm

After briefly recalling the supervised learning problem, we introduce the algorithm we propose and give some comments on its numerical realization.

2.1 Problem Statement

In this paper we consider the problem of supervised learning. Let be a separable metric space, and let

be a Borel probability measure on

Moreover, let be a so called loss function, measuring the local error for and . The generalization error (or expected risk) associated to is given by

and is well defined for any measurable loss function and measurable function . We assume throughout that there exists a function that minimizes the expected error among all measurable functions . Roughly speaking, the goal of learning is to find an approximation of when the measure is known only through a sample of size independently and identically drawn according to . More precisely, given the goal is to design a computational procedure to efficiently estimate a function , an estimator, for which it is possible to derive an explicit probabilistic bound on the excess expected risk

We end with this section with a remark and an example.

Remark 2.1.

For several loss functions, it is possible to show that exists– see example below. However, as will be seen in the following, the search for an estimator in practice is often restricted to some hypothesis space of measurable functions. In this case one should replace by . Interestingly, examples of hypothesis spaces are known for which , namely universal hypothesis spaces [34]. In the following, we consider , with the understanding that it should be replaced by the infimum over , if the latter is not universal.

The following example gives several possible choices of loss functions.

Example 2.1.

The most classical example of loss function is probably the square loss , . In this case, is the regression function, defined at every point as the expectation of the conditional distribution of given [17, 34]. Further examples include the absolute value loss for which is the median of the conditional distribution and more generally -loss functions , . Vapnik’s -insensitive loss , and its generalizations , provide yet other examples. For classification i.e. , other examples of loss functions used in classification, include the hinge loss , the logistic loss and the exponential loss . For all these examples can be computed, see e.g. [34], and measurability is easy to check.

2.2 Learning via Subgradient Methods with Early Stopping

To present the proposed learning algorithm we need a few preliminary definitions. Consider a reproducing kernel , that is a symmetric function, such that the matrix is positive semidefinite for any finite set of points in . Recall that a reproducing kernel defines a reproducing kernel Hilbert space (RKHS) as the completion of the linear span of the set with respect to the inner product . Moreover, assume the loss function to be measurable and convex in its second argument, so that the corresponding left derivative exists and is non-decreasing at every point. For a step size sequence , a stopping iteration and a initial value , we consider the iteration

(2.1)

The above iteration corresponds to the subgradient method [5, 10] for minimizing the empirical error with respect to the loss , which is given by

Indeed, it is easy to see that , the subgradient of the empirical risk for . In the special case where the loss function is smooth then (2.1) reduces to the gradient descent algorithm. Since the subgradient method is not a descent algorithm, rather then the last iterate, the so called Cesáro mean is often considered, corresponding, for , to the following weighted average

(2.2)

Alternatively, the best iterate is also often considered, which is defined for by

(2.3)

In what follows, we will consider the learning algorithms obtained considering these different choices.

We note that, classical results [5, 10, 9] on the subgradient method focus on how the iteration (2.1) can be used to minimize . Different to these studies, in the following we are interested in showing how iteration (2.1) can be used to define a statistical estimator, hence a learning algorithm to minimize the expected risk , rather than the empirical risk . We end with one remark.

Remark 2.2 (Early Stopping SVM and Kernel Perceptron).

If we consider the hinge loss function in (2.1

), the corresponding algorithm is closely related to a batch (kernel) version of the perceptron

[29, 1], where an entire pass over the data is done before updating the solution. Such an algorithm can also be seen as an early stopping version of Support Vector Machines [16]. Interestingly, in this case the whole regularization path is computed incrementally albeit sparsity could be lost. We defer to a future work the study of the practical implications of these observations.

2.3 Numerical Realization

The simplest case to derive a numerical procedure from Algorithm 2.1 is when for some and is the associated inner product. In this case it is straightforward to see that for all , with

and .

Beyond the linear kernel, it can be easily seen that given a finite dictionary

one can consider the kernel . In this case, it holds , for all , with

and . Finally, for a general kernel it is easy to prove by induction that for all , with

for and with . Indeed, The base case is straightforward to check and moreover by the inductive hypothesis

3 Main Results with Discussions

After presenting our main assumptions, in this section we state and discuss our main results.

3.1 Assumptions

Our learning rates will be stated under several conditions on the triple , that we describe and comment next. We begin with a basic assumption.

Assumption 3.1.

We assume the kernel to be bounded, that is and moreover and . Furthermore, we consider the following growth condition for the left derivative . For some and constant it holds,

(3.1)

The boundness conditions on and are fairly common [17, 34]. They could probably be weakened by considering a more involved analysis which is outside the scope of this paper. Interestingly, the growth condition on the left derivative of is weaker than assuming the loss, or its gradient, to be Lipschitz in its second entry, as often done both in learning theory [17, 34] and in optimization [9]. We note that the growth condition (3.1) is implied by the requirement for the loss function to be Nemitiski, as introduced in [37] (see also [34]). This latter condition, which is satisfied by most loss function, is natural to provide a variational characterization of the learning problem.

The second assumption refines the above boundness condition by considering a variance-expectation bound which quantifies a notion of noise in the measure

with respect to the balls in , [17, 34].

Assumption 3.2.

We assume that there exist an exponent and a positive constant such that for any and , we have

(3.2)

Assumption 3.2 always holds true for , in which case will also depend on . In classification, the above condition can be related to the so called Tsybakov margin condition. The latter quantifies the intuition that a classification problem is hard if the conditional probability of given is close to for many input points. More precisely if we denote by the conditional probability for all and by the marginal probability on , then we say that satisfies the Tsybakov margin condition with exponent if there exists a constant such that for all

Interestingly, under Tsybakov margin condition Assumption 3.2 holds with and with depending only .

The third condition is about the decay of a suitable notion approximation error [31].

Assumption 3.3.

Let be a minimizer of:

(3.3)

The approximation error associated with the tripe is defined by

(3.4)

We assume that for some and , the approximation error satisfies

(3.5)

The above assumption is standard when analyzing regularized empirical risk minimization and is related to the the definition of interpolation spaces by means of so the called

- functional [17]. Interestingly, we will see in the following that it is also important when analyzing the approximation properties of the subgradient algorithms 2.1.

Finally, the last condition characterizes the capacity of a ball in the RKHS in terms of empirical covering numbers, and plays an essential role in sample error estimates. Recall that for a subset of a metric space , the covering number is defined by

Assumption 3.4.

Let be a set of functions on . The metric is defined on by

We assume that for some , , the covering numbers of the unit ball in with respect to satisfy

(3.6)

The smaller is the more stringent is the capacity assumption. As approaches we are essentially considering a capacity independent scenario. In what follows, we will briefly comment on the connection between the above assumption and other related assumptions. Recall that capacity of the RKHS may be measured by various concepts: covering numbers of balls in

, (dyadic) entropy numbers and decay of the eigenvalues of the integral operator

given by where For a subset of a metric space , its -th entropy number is defined by

First, the covering and entropy numbers are equivalent (see e.g. [34, Lemma 6.21]). Indeed, for the covering numbers satisfy

for some , if and only if the entropy numbers satisfy

for some Second, it is shown in [33] that if the eigenvalues of the integral operator satisfy

for some constants and then the expectations of the random entropy numbers satisfy

for some constant Hence, using the equivalence of covering and entropy numbers, one can be estimated from the eigenvalue decay of the integral operator . Last, since one has that for any is bounded by the uniform covering number of under the metric Thus, the covering numbers can be estimated given the uniform smoothness of the kernel [46].

3.2 Finite Sample Bounds for General Convex Loss Functions

The following is our main result providing a general finite sample bound for the iterative regularization induced by the the subgradient method for convex loss functions considering the last iterate.

Theorem 3.5.

Assume (3.1) with , (3.2) with , (3.5) with and (3.6) with ,. Let with satisfying and satisfying

(3.7)

If is the integer part of , then for any , with confidence , we have

where the power indices and are defined as

(3.8)
(3.9)

and is a constant independent of or (given explicitly in the proof).

The proof is deferred to Section 5 and is based on a novel error decomposition, discussed in Section 3.6, integrating statistical and optimization aspects. We illustrate the above result for Lipschitz loss functions, that is considering .

Corollary 3.6.

Assume (3.1) with , (3.6) with and (3.5) with . Let with and satisfying If is the integer part of , then for any , with confidence , we have

where the power indices and are defined as

and is a constant independent of or .

The above results give finite sample bounds on the excess risk, provided that a suitable stopping rule is considered. While the stopping rule in above theorems is distribution dependent, a data-drive stopping rule can be given by hold-out cross validation and adaptively achieves the same bound. The proof of this latter result is straightforward using the techniques in [14] and is omitted. The obtained bounds directly yields strong consistency (almost sure convergence) using standard arguments. Interestingly, our analysis suggests that a decaying stepsize needs to be chosen to achieve meaningful error bounds. The stepsize choice can influence both the early stopping rule and the error bounds. More precisely, if the step size decreases fast enough , the stopping rule depends on the decay speed but the error bound does not. In this case the best possible choice for the early stopping rule is , that is in the case of Lipschitz loss functions. With this choice, if for example we take the limit , , we have that the stopping rule scales as whereas the corresponding finite sample bounds is . A slower stepsize decay given by affects both the stopping rule and the error bounds, but the results in these regime worsen. A more detailed discussion of the obtained bounds in comparison to other learning algorithms is postponed to Section 3.5. Next we discuss the behavior of different variants of the proposed algorithm.

As mentioned before in the subgradient method, when the goal is empirical risk minimization, the average or best iterates are often considered (see (2.2), (2.3)). It is natural to ask what are the properties of the estimator obtained with these latter choices, that is when they are used as approximate minimizers of the expected, rather than the empirical, risk. The following theorem provides an answer.

Theorem 3.7.

Under the assumptions of Theorem 3.5, if is the integer part of and (or ) then for any , with confidence , we have

where the power indices and are defined as in Theorem 3.5 and is a constant independent of or (can be given explicitly).

The above result shows that, perhaps surprisingly, the behavior of the average and best iterates is essentially the same as the last iterate. Indeed, there is only a subtle difference between the upper bounds in Theorem 3.7 and Theorem 3.5, since the latter has an extra factor when In the next section we consider the case where loss is not only convex but also smooth.

3.3 Finite Sample Bounds for Smooth Loss Functions

In this section, we additionally assume that is differentiable and is Lipschitz continuous with constant , i.e., for any and

For the logistic loss in binary classification, see Example 2.1, it is easy to prove that both and is Lipschitz continuous with constant , for all . With the above smoothness assumption, we prove the following convergence result.

Theorem 3.8.

Assume (3.1) with , (3.2) with , (3.5) with and (3.6) with . Assume that is differentiable and is Lipschitz continuous with constant . Let with and If is the integer part of , then for any , with confidence , we have

where the power indices and are defined as

and is a constant independent of or .

The proof of this result will be given in Section 5. We can simplify the result by considering Lipschitz loss function () and setting .

Corollary 3.9.

Under the assumptions of Theorem 3.8, let If is the integer part of , then for any , with confidence , we have

where the power indices and are defined as

and is a constant independent of or .

The finite sample bound obtained above is essentially the same as the best possible bound obtained for general convex loss. However, the important difference is that for smooth loss function, a constant stepsize can be chosen and allows to considerably improve the stopping rule. Indeed, if for example we can consider the limit , , we have that the stopping is , rather than , whereas the corresponding finite sample bounds is again .

3.4 Iterative Regularization for Classification: Surrogate Loss Functions and Hinge Loss

We briefly discuss how the above results allows us to derive error bounds in binary classification. In this latter case and a natural choice for the loss function is the misclassification loss given by

(3.10)

for and , if , and otherwise. The corresponding generalization error, usually denoted by , is called mislassification risk, since it can be shown to be the probability of the event . The minimizer of the misclassification error is the Bayes rule given by

The misclassification loss (3.10) is neither convex nor smooth and thus leads to intractable problems. Moreover, the search of a solution among binary valued functions is also unfeasible. In practice, a convex (so called surrogate

) loss function is typically considered and a classifier is obtained by estimating a real function

and then taking its sign defined as

The question arises of if, and how, error bounds on the excess risk yields results on . Indeed, so called comparison results are known relating these different error measures, see e.g. [17, 34] and references therein. We discuss in particular the case of the hinge loss function, see Example 2.1, since in this case for all measurable functions it holds that

Indeed, the hinge loss satisfies Assumption (3.1) with and, under Tsybakov noise condition, Assumption (3.2). Misclassification error bound, for the iterative regularization induced by the hinge loss, can then be obtained as a corollary of Theorem 3.5 and using the above facts. Below we provide a simplified result.

Theorem 3.10.

Let and be the hinge loss. Let and (3.5) is satisfied with . Let with and If (3.6) is valid with and is the integer part of , then with confidence , we have

(3.11)

In particular, if with then with confidence

The proof of the above result is given in Section 5, whereas we comment on the obtained rates in the next section. We add one of observation first. We note that, as illustrated by the the next result, a different regularization strategy than early stopping can be considered, where the stopping rule is kept fixed while the step size is chosen in a distribution dependent way.

Theorem 3.11.

Let and be the hinge loss given. Let and (3.5) is satisfied with . Let with and If (3.6) is valid with and is the integer part of , then with confidence , we have

3.5 Comparison with Other Learning Algorithms

As mentioned before iterative regularization has clear advantages from a computational point of view. The algorithm reduces to a simple first order method with typically low iteration cost and allows to seemly compute the estimators corresponding to different regularization level (the regularization path), a crucial fact since model selection needs to be performed. It is natural to compare the obtained statistical bounds with those for other learning algorithms. For general convex loss functions, the methods for which sharp bounds are available, are penalized empirical risk minimization (Tikhonov regularization), i.e.

see e.g. [17, 34] and references therein. The best error bounds for Tikhonov regularization with Lipschitz loss functions, see e.g. [34, Chapter 7], are of order with

which reduces to

if no variance assumption is made () and in capacity independent limit (). While from Theorem 3.5 for Lipschitz loss functions, we see that the bound we obtain are of order with exponent

reducing to

in no variance and capacity independent limit. The obtained bounds are worse than the best ones available for Tikhnov regularization. However, the analysis of the latter does not take into account the optimization error and it is still an open question whether the best rate is preserved when such an error is incorporated. At this point we are prone to believe this gap to be a byproduct of our analysis rather than a fundamental fact, and addressing this point should be a subject of further work. Moreover, we note that our analysis allows to derive error bound for all Nemitski loss functions.

Beyond Tikhnov regularization, we can compare with the online regularization scheme for the hinge loss. The online learning algorithms with regularization sequence defined by

(3.12)

were studied in [43, 42]. Our results improves the results in [43, 42] in two aspects. The bound obtained in [43] is of the form while the bound in Theorem 3.11 is of type by substituting the expression for . Moreover, our results are with high probability and promptly yields almost sure convergence whereas the results in [43] are only in expectation. We note that, interestingly, sharp bounds for Lipschitz loss functions are derived in [25], although the obtained results do not take into account capacity and variance assumptions that could lead to large improvements.

We next compare with the previous results on iterative regularization. The only results available thus far have been obtained for the square loss, for which bounds have been first derived for gradient descent in [11], but only for a fixed design regression setting, and in [41] for a general statistical learning setting. While the bounds in [41] are suboptimal, they have later been improved in [4, 14, 27]. Interestingly, sharp error bounds have also been proved for iterative regularization induced by other, potentially faster, iterative techniques, including incremental gradient [28], conjugate gradient [7] and the so called -method [4, 14], an accelerated gradient descent technique related to Chebyshev method [18]. The best obtained bounds are of order and can be shown to be optimal since they match a corresponding minimax lower bound [13]. Holding not only for the square loss, but for general Nemitski loss functions, the bound obtained in Theorem 3.8 is of order , which is worse. In the capacity independent limit, the best available bound we obtain is of order , whereas the optimal bound is of order . Also, in this case, the reason for the gap appears to be of technical reason and should be further studied.

Finally, before giving the proof of our results in details, in the next section, we discuss the general error decomposition underlying our approach, which highlights the interplay between statistics and optimization and could be also useful in other contexts.

3.6 Error Decomposition

Theorems 3.5 and 3.8 rely on a key error decomposition, that we derive next. The goal is to estimate the excess risk , and the starting point is to split the error by introducing a reference function ,

(3.13)

The above equation can be further developed by considering

(3.14)

Inspection of the above expression provides several insights. The first term is a computational error related to optimization. It quantifies the discrepancy between the empirical errors of the iterate defined by the subgradient method and that of the reference function. The last two terms are related to statistics. The second term is a sample error and can be studied using empirical process theory, provided that a bound on the norm of the iterates (and of the reference function) is available. Indeed, to get a sharper concentration the recentered quantity

can be considered [17, 34]. Note that the second addend can be negative so that we effectively only need to control

(3.15)

Finally the last term suggests that a natural choice for the reference function is an almost minimizer

of the expected risk, having bounded norm, and for which the approximation level can be quantified. While there is a certain degree of freedom in the latter choice, in the following we will consider

, the minimizer of (3.3). With this latter choice we can control

by given in Assumption 3.3. Indeed, other choices are possible, for example