We’re starting this series of articles about the discipline of Machine Learning with an opening question from Tom Mitchell:

“How can we build computer systems that automatically improve with experience, and what are the fundamental laws that govern all learning processes?”

According to Mitchell, this question covers a broad range of learning tasks, and it really does. Try to think, How to develop a system that will automatically be able to learn its environment in the settings, which the humans encounter with on a daily basis?

Which algorithms should the computer science engineers write so that the system is building rationale predictions and conclusions, herewith in the case of an error the system could identify and remember this problem so avoiding it in the future.

For example, can we develop an autonomous system that’s being able to build the accurate predictions to determine which medications will best impact the patient’s treatment based on the gained observations and data?

We can consider such question in this meaning, as of Mitchell states:

“A machine learns with respect to a particular task T, performance metric P, and type of experience E, if the system reliably improves its performance P at task T, following experience E. Depending on how we specify T, P, and E, the learning task might also be called by names such as data mining, autonomous discovery, database updating, programming by example, etc.”

Many specialists say that the machines should learn in the way as humans do – through some observations, data checking, use cases, experiences or direct instructions.

So basically, the principles of ML are to learn the processes to perform them subsequently better and more accurate in the future. This is what MYLE team aims to build – an assistant powered with the algorithm that learns your speech manner, financial behaviour, your communication habits and other important aspects of your life to make accurate predictions that will enhance your life.

Also, ML refers to a core subarea of artificial intelligence (AI). Apparently you cannot build an intelligent system if it doesn’t automatically operate without human intervention or assistance.

Thus, ML is a core element of making the AI because AI must, for example, process language just as humans do. Humans sometimes communicate using extremely complex sentence structures with hidden meaning. Moreover, still yet it has been challenging to develop a computer system that would be capable of understanding those phrase patterns.

This is where a truly intelligent system begins – with the ability to understand and use gained knowledge to simplify and enhance existing processes. Hence, we cannot consider a system to be truly intelligent if it’s unable to learn since learning is a universal process of gaining knowledge or skills by studying, practicing or experiencing something.

Since the last decade, engineers have written thousands of ML algorithms, and all of them consisted of these three essential components – important to mention that these three components are the framework of any ML algorithm:

  • Representation: how to represent knowledge.
  • Evaluation: the way to evaluate candidate programs (hypotheses).
  • Optimization: the way candidate programs are generated known as the search process.

However, each ML algorithm could be taught by thousands of different methods. Albeit, only four methods are commonly used today.

Supervised learning is a learning model where a training process requiring to make predictions and is corrected when those predictions are wrong.

The training process continues until the model achieves the desired level of accuracy on the training data. The goal of this model is to get the system to learn a classification system that we have created and presented to the system. One of the most typical examples of the supervised learning is the digit recognition.

This learning model is especially useful when it’s easy to determine the problem. However, if a machine is unable to find a common pattern in the given problem, then it’s more likely not to identify the problem. Hence, this learning method is not practical for the systems in constantly changing environments

Unsupervised learning is a learning model where input data is not labelled and without a known result. This method seems more intriguing and harder because the main purpose – to make a system learn a process that we don’t tell it how to do.

This learning model has two approaches to teaching the machine how to do certain tasks.

The first approach is to teach the system by not giving straightforward classifications, but instead using some sort of reward approach to indicate its success. It should be mentioned that this approach fits into the decision problem framework because the primary objective is not to produce classification rather make correct decisions to maximize rewards.

It’s interesting that this approach closely simulates the real-world environment, where the system has a motivation to be rewarded and is also afraid of being punished for not doing the certain task or doing it wrong.

The second approach of this learning model is called clustering. That is, the system’s primary objective is to find similarities in data. This approach could be well used when there is sufficient data; for instance, social information filtering algorithms, such as those that use Amazon in its books recommendations.

Their algorithms are based on classifying and finding those clusters of the similar groups of people that read the same books or fit into the specific category of readers.

Semi-supervised learning is the model that combines both labelled and unlabelled methods.

In the case of semi-supervised learning, the system is given a desired prediction for the certain problem. However, it has to do self-learning to be able to organize the data and make predictions.

Reinforcement learning is the learning model that allows the system to determine automatically the ideal behaviour within a specific task to maximize its performance. That is, the system is not told which actions to take, but instead it must decide which actions generate the most reward.

This model is using the Markov Decision Methods because in some cases actions may affect not only the immediate reward but also the following situation and through that all subsequent rewards.

One of the good examples to understand reinforcement learning could be this (retrieved form University of Alberta):

A mobile robot decides whether it should enter a new room in search of more trash to collect or start trying to find its way back to its battery recharging station. It makes its decision based on how quickly and easily it has been able to find the recharger in the past.

In our next article we’re going to look at some key elements, history and challenges related to Machine Learning.

WordPress Lightbox