Getting Started with TensorFlow: A Machine Learning Tutorial
A complete and rigorous introduction to Tensorflow. Code along with this tutorial to get started with hands-on examples.
TensorFlow supports different kinds of reduction. Reduction is an operation that removes one or more dimensions from a tensor by performing certain operations across those dimensions. A list of supported reductions for the current version of TensorFlow can be found here. We will present a few of them in the example below.
The first parameter of reduction operators is the tensor that we want to reduce. The second parameter is the indexes of dimensions along which we want to perform the reduction. That parameter is optional, and if not passed, reduction will be performed along all dimensions.
We can take a look at the reduce_sum operation. We pass a 2-d tensor, and want to reduce it along dimension 1.
In our case, the resulting sum would be:
If we passed dimension 0, the result would be:
If we don’t pass any axis, the result is just the overall sum of:
All reduction functions have a similar interface and are listed in the TensorFlow reduction documentation.
Segmentation is a process in which one of the dimensions is the process of mapping dimensions onto provided segment indexes, and the resulting elements are determined by an index row.
Segmentation is actually grouping the elements under repeated indexes, so for example, in our case, we have segmented ids
[0, 0, 1, 2, 2] applied on tensor
tens1, meaning that the first and second arrays will be transformed following segmentation operation (in our case summation) and will get a new array, which looks like
(2, 8, 1, 0) = (2+0, 5+3, 3-2, -5+5). The third element in tensor
tens1 is untouched because it isn’t grouped in any repeated index, and last two arrays are summed in same way as it was the case for the first group. Beside summation, TensorFlow supports product, mean, max, and min.
Sequence utilities include methods such as:
- argmin function, which returns the index with min value across the axes of the input tensor,
- argmax function, which returns the index with max value across the axes of the input tensor,
- setdiff, which computes the difference between two lists of numbers or strings,
- where function, which will return elements either from two passed elements x or y, which depends on the passed condition, or
- unique function, which will return unique elements in a 1-D tensor.
We demonstrate a few execution examples below:
Machine Learning with TensorFlow
In this section, we will present a machine learning use case with TensorFlow. The first example will be an algorithm for classifying data with the kNN approach, and the second will use the linear regression algorithm.
The first algorithm is k-Nearest Neighbors (kNN). It’s a supervised learning algorithm that uses distance metrics, for example Euclidean distance, to classify data against training. It is one of the simplest algorithms, but still really powerful for classifying data. Pros of this algorithm:
- Gives high accuracy when the training model is big enough, and
- Isn’t usually sensitive to outliers, and we don’t need to have any assumptions about data.
Cons of this algorithm:
- Computationally expensive, and
- Requires a lot of memory where new classified data need to be added to all initial training instances.
The distance which we will use in this code sample is Euclidean, which defines the distance between two points like this:
In this formula,
n is the number of dimensions of the space,
x is the vector of the training data, and
y is a new data point that we want to classify.
The dataset which we used in above example is one which can be found on the Kaggle datasets section. We used the one which contains transactions made by credit cards of European cardholders. We are using the data without any cleaning or filtering and as per the description in Kaggle for this dataset, it is highly unbalanced. The dataset contains 31 variables: Time, V1, …, V28, Amount, and Class. In this code sample we use only V1, …, V28 and Class. Class labels transactions which are fraudulent with 1 and those which aren’t with 0.
The code sample contains mostly the things which we described in previous sections with exception where we introduced the function for loading a dataset. The function
load_data(filepath) will take a CSV file as an argument and will return a tuple with data and labels defined in CSV.
Just below that function, we have defined placeholders for the test and trained data. Trained data are used in the prediction model to resolve the labels for the input data that need to be classified. In our case, kNN use Euclidian distance to get the nearest label.
The error rate can be calculated by simple division with the number when a classifier missed by the total number of examples which in our case for this dataset is 0.2 (i.e., the classifier gives us the wrong data label for 20% of test data).
The linear regression algorithm looks for a linear relationship between two variables. If we label the dependent variable as y, and the independent variable as x, then we’re trying to estimate the parameters of the function
y = Wx + b.
Linear regression is a widely used algorithm in the field of applied sciences. This algorithm allows adding in implementation two important concepts of machine learning: Cost function and the gradient descent method for finding the minimum of the function.
A machine learning algorithm that is implemented using this method must predict values of
y as a function of
x where a linear regression algorithm will determinate values
b, which are actually unknowns and which are determined across training process. A cost function is chosen, and usually the mean square error is used where the gradient descent is the optimization algorithm used to find a local minimum of the cost function.
The gradient descent method is only a local function minimum, but it can be used in the search for a global minimum by randomly choosing a new start point once it has found a local minimum and repeating this process many times. If the number of minima of the function is limited and there are very high number of attempts, then there is a good chance that at some point the global minimum is spotted. Some more details about this technique we will leave for the article which we mentioned in the introduction section.
In the above example, we have two new variables, which we called
train. With those two variables, we defined an optimizer which we want to use in our training model and the function which we want to minimize.
At the end, the output parameters of
b should be identical as those defined in the
generate_test_values function. In line 17, we actually defined a function which we used to generate the linear data points to train where
b=4. Linear regression from the above example is multivariate where more than one independent variable are used.
As you can see from this TensorFlow tutorial, TensorFlow is a powerful framework that makes working with mathematical expressions and multi-dimensional arrays a breeze—something fundamentally necessary in machine learning. It also abstracts away the complexities of executing the data graphs and scaling.
Over time, TensorFlow has grown in popularity and is now being used by developers for solving problems using deep learning methods for image recognition, video detection, text processing like sentiment analysis, etc. Like any other library, you may need some time to get used to the concepts that TensorFlow is built on. And, once you do, with the help of documentation and community support, representing problems as data graphs and solving them with TensorFlow can make machine learning at scale a less tedious process.
Original. Reposted with permission.
Bio: Dino has over five years of experience as a software developer. For the past two years, he has worked in Java and related technologies, mostly in implementing big data solutions using NoSQL technologies and in implementing REST services. He is based in Sarajevo and is a member of Toptal.
- NIPS 2017 Key Points & Summary Notes
- TensorFlow for Short-Term Stocks Prediction
- Accelerating Algorithms: Considerations in Design, Algorithm Choice and Implementation