{"word_count": 1032, "character_count": 7081}
This post is the fifth one of our series on the history and foundations of econometric and machine learning models. The first fours were on econometrics techniques. Part 4 is online here.In parallel with these tools developed by, and for economists, a whole literature has been developed on similar issues, centered on the problems of prediction and forecasting. For Breiman (2001a), a first difference comes from the fact that the statistic has developed around the principle of inference (or to explain the relationship linking [latex]y[/latex] to variables [latex]\mathbf{x}[/latex]) while another culture is primarily interested in prediction. In a discussion that follows the article, David Cox states very clearly that in statistic (and econometrics) "predictive success (...) is not the primary basis for model choice". We will get back here on the roots of automatic learning techniques. The important point, as we will see, is that the main concern of machine learning is related to the generalization properties of a model, i.e. its performance - according to a criterion chosen a priori - on new data, and therefore on non-sample tests.A learning machineToday, we speak of "machine learning" to describe a whole set of techniques, often computational, as alternatives to the classical econometric approach. Before characterizing them as much as possible, it should be noted that historically other names have been given. For example, Friedman (1997) proposes to make the link between statistics (which closely resemble econometric techniques - hypothesis testing, ANOVA, linear regression, logistics, GLM, etc.) and what was then called "data mining" (which then included decision trees, methods from the closest neighbours, neural networks, etc.). The bridge between those two cultures corresponds to "statistical learning" techniques described in Hastie et al (2009). But one should keep in mind that machine learning is a very large field of research.The so-called "natural" learning (as opposed to machine learning) is that of children, who learn to speak, read and play. Learning to speak means segmenting and categorizing sounds, and associating them with meanings. A child also learns simultaneously the structure of his or her mother tongue and acquires a set of words describing the world around him or her. Several techniques are possible, ranging from rote learning, generalization, discovery, more or less supervised or autonomous learning, etc. The idea in artificial intelligence is to take inspiration from the functioning of the brain to learn, to allow "artificial" or "automatic" learning, by a machine. A first application was to teach a machine to play a game (tic-tac-toe, chess, go, etc.). An essential step is to explain the objective it must achieve to win. One historical approach has been to teach the machine the rules of the game. If it allows you to play, it will not help the machine to play well. Assuming that the machine knows the rules of the game, and that it has a choice between several dozen possible moves, which one should it choose? The classical approach in artificial intelligence uses the so-called min-max algorithm using an evaluation function: in this algorithm, the machine searches forward in the possible moves tree, as far as the calculation resources allow (about ten moves in chess, for example). Then, it calculates different criteria (which have been previously indicated to her) for all positions (number of pieces taken, or lost, occupancy of the center, etc. in our example of the chess game), and finally, the machine plays the move that allows it to maximize its gain. Another example may be the classification and recognition of images or shapes. For example, the machine must identify a number in a handwritten handwriting (checks, ZIP code on envelopes, etc). It is a question of predicting the value of a variable [latex]y[/latex], knowing that a priori [latex]y\in\{0,1,2,\cdots,8,9\}[/latex]. A classical strategy is to provide the machine with learning bases, in other words here millions of labelled (identified) images of handwritten numbers. A simple (and natural) strategy is to use a decision criterion based on the closest neighbors whose labels are known (using a predefined metric).The method of the closest neighbors ("[latex]k[/latex]-nearest neighbors") can be described as follows: we consider (as in the previous part) a set of n observations, i. e. pairs [latex](y_i,\mathbf{x}_i)[/latex] with [latex]\mathbf{x}_i\in\mathbb{R}^p[/latex]. Let us consider a distance [latex]\Delta[/latex] on [latex]\mathbb{R}^p[/latex] (the Euclidean distance or the Mahalanobis distance, for example). Given a new observation [latex]\mathbf{x}\in\mathbb{R}^p[/latex], let us assume the ordered observations as a function of the distance between the [latex]\mathbf{x}_i[/latex] and [latex]\mathbf{x}[/latex], in the sense that [latex display="true"]\Delta(\mathbf{x}_1, \mathbf{x})\leq\Delta(\mathbf{x}_2, \mathbf{x})\leq\cdots\leq\Delta(\mathbf{x}_n, \mathbf{x}) [/latex] then we can consider as prediction for y the average of the nearest [latex]k[/latex] neighbours,[latex display="true"]\widehat{m}_k(\mathbf{x})=\frac{1}{k}\sum_{i=1}^k y_i[/latex]Learning here works by induction, based on a sample (called the learning – or training – sample).Automatic learning includes those algorithms that give computers the ability to learn without being explicitly programmed (as Arthur Samuel defined it in 1959). The machine will then explore the data with a specific objective (such as searching for the nearest neighbours in the example just described). Tom Mitchell proposed a more precise definition in 1998: a computer program is said to learn from experience [latex]E[/latex] in relation to a task [latex]T[/latex] and a performance measure [latex]P[/latex], if its performance on [latex]T[/latex], measured by [latex]P[/latex], improves with experience [latex]E[/latex]. Task [latex]T[/latex] can be a defect score for example, and performance [latex]P[/latex] can be the percentage of errors made. The system learns if the percentage of predicted defects increases with experience.As we can see, machine learning is basically a problem of optimizing a criterion based on data (from now on called learning). Many textbooks on machine learning techniques propose algorithms, without ever mentioning any probabilistic model. In Watt et al (2016) for example, the word "probability" is mentioned only once, with this footnote that will surprise and make smile any econometricians, "the logistic regression can also be interpreted from a probabilistic perspective" (page 86). But many recent books offer a review of machine learning approaches using probabilistic theories, following the work of Vaillant and Vapnik. By proposing the paradigm of "probably almost correct" learning (PAC), a probabilistic flavor has been added to the previously very computational approach, by quantifying the error of the learning algorithm (usually in a classification problem).To be continued (references are online here)…