Note

Click here to download the full example code

# Compiling and Optimizing a Model with the Python Interface (AutoTVM)¶

**Author**:
Chris Hoge

In the TVMC Tutorial, we covered how to compile, run, and tune a pre-trained vision model, ResNet-50 v2 using the command line interface for TVM, TVMC. TVM is more that just a command-line tool though, it is an optimizing framework with APIs available for a number of different languages that gives you tremendous flexibility in working with machine learning models.

In this tutorial we will cover the same ground we did with TVMC, but show how it is done with the Python API. Upon completion of this section, we will have used the Python API for TVM to accomplish the following tasks:

Compile a pre-trained ResNet-50 v2 model for the TVM runtime.

Run a real image through the compiled model, and interpret the output and model performance.

Tune the model that model on a CPU using TVM.

Re-compile an optimized model using the tuning data collected by TVM.

Run the image through the optimized model, and compare the output and model performance.

The goal of this section is to give you an overview of TVM’s capabilites and how to use them through the Python API.

TVM is a deep learning compiler framework, with a number of different modules available for working with deep learning models and operators. In this tutorial we will work through how to load, compile, and optimize a model using the Python API.

We begin by importing a number of dependencies, including `onnx`

for
loading and converting the model, helper utilities for downloading test data,
the Python Image Library for working with the image data, `numpy`

for pre
and post-processing of the image data, the TVM Relay framework, and the TVM
Graph Executor.

```
import onnx
from tvm.contrib.download import download_testdata
from PIL import Image
import numpy as np
import tvm.relay as relay
import tvm
from tvm.contrib import graph_executor
```

## Downloading and Loading the ONNX Model¶

For this tutorial, we will be working with ResNet-50 v2. ResNet-50 is a convolutional neural network that is 50 layers deep and designed to classify images. The model we will be using has been pre-trained on more than a million images with 1000 different classifications. The network has an input image size of 224x224. If you are interested exploring more of how the ResNet-50 model is structured, we recommend downloading Netron, a freely available ML model viewer.

TVM provides a helper library to download pre-trained models. By providing a model URL, file name, and model type through the module, TVM will download the model and save it to disk. For the instance of an ONNX model, you can then load it into memory using the ONNX runtime.

Working with Other Model Formats

TVM supports many popular model formats. A list can be found in the Compile Deep Learning Models section of the TVM Documentation.

```
model_url = (
"https://github.com/onnx/models/raw/main/"
"vision/classification/resnet/model/"
"resnet50-v2-7.onnx"
)
model_path = download_testdata(model_url, "resnet50-v2-7.onnx", module="onnx")
onnx_model = onnx.load(model_path)
# Seed numpy's RNG to get consistent results
np.random.seed(0)
```

## Downloading, Preprocessing, and Loading the Test Image¶

Each model is particular when it comes to expected tensor shapes, formats and
data types. For this reason, most models require some pre and
post-processing, to ensure the input is valid and to interpret the output.
TVMC has adopted NumPy’s `.npz`

format for both input and output data.

As input for this tutorial, we will use the image of a cat, but you can feel free to substitute this image for any of your choosing.

Download the image data, then convert it to a numpy array to use as an input to the model.

```
img_url = "https://s3.amazonaws.com/model-server/inputs/kitten.jpg"
img_path = download_testdata(img_url, "imagenet_cat.png", module="data")
# Resize it to 224x224
resized_image = Image.open(img_path).resize((224, 224))
img_data = np.asarray(resized_image).astype("float32")
# Our input image is in HWC layout while ONNX expects CHW input, so convert the array
img_data = np.transpose(img_data, (2, 0, 1))
# Normalize according to the ImageNet input specification
imagenet_mean = np.array([0.485, 0.456, 0.406]).reshape((3, 1, 1))
imagenet_stddev = np.array([0.229, 0.224, 0.225]).reshape((3, 1, 1))
norm_img_data = (img_data / 255 - imagenet_mean) / imagenet_stddev
# Add the batch dimension, as we are expecting 4-dimensional input: NCHW.
img_data = np.expand_dims(norm_img_data, axis=0)
```

## Compile the Model With Relay¶

The next step is to compile the ResNet model. We begin by importing the model to relay using the from_onnx importer. We then build the model, with standard optimizations, into a TVM library. Finally, we create a TVM graph runtime module from the library.

```
target = "llvm"
```

Defining the Correct Target

Specifying the correct target can have a huge impact on the performance of
the compiled module, as it can take advantage of hardware features
available on the target. For more information, please refer to
Auto-tuning a convolutional network for x86 CPU.
We recommend identifying which CPU you are running, along with optional
features, and set the target appropriately. For example, for some
processors `target = "llvm -mcpu=skylake"`

, or ```
target = "llvm
-mcpu=skylake-avx512"
```

for processors with the AVX-512 vector instruction
set.

```
# The input name may vary across model types. You can use a tool
# like Netron to check input names
input_name = "data"
shape_dict = {input_name: img_data.shape}
mod, params = relay.frontend.from_onnx(onnx_model, shape_dict)
with tvm.transform.PassContext(opt_level=3):
lib = relay.build(mod, target=target, params=params)
dev = tvm.device(str(target), 0)
module = graph_executor.GraphModule(lib["default"](dev))
```

Out:

```
/workspace/python/tvm/driver/build_module.py:264: UserWarning: target_host parameter is going to be deprecated. Please pass in tvm.target.Target(target, host=target_host) instead.
"target_host parameter is going to be deprecated. "
```

## Execute on the TVM Runtime¶

Now that we’ve compiled the model, we can use the TVM runtime to make predictions with it. To use TVM to run the model and make predictions, we need two things:

The compiled model, which we just produced.

Valid input to the model to make predictions on.

```
dtype = "float32"
module.set_input(input_name, img_data)
module.run()
output_shape = (1, 1000)
tvm_output = module.get_output(0, tvm.nd.empty(output_shape)).numpy()
```

## Collect Basic Performance Data¶

We want to collect some basic performance data associated with this unoptimized model and compare it to a tuned model later. To help account for CPU noise, we run the computation in multiple batches in multiple repetitions, then gather some basis statistics on the mean, median, and standard deviation.

```
import timeit
timing_number = 10
timing_repeat = 10
unoptimized = (
np.array(timeit.Timer(lambda: module.run()).repeat(repeat=timing_repeat, number=timing_number))
* 1000
/ timing_number
)
unoptimized = {
"mean": np.mean(unoptimized),
"median": np.median(unoptimized),
"std": np.std(unoptimized),
}
print(unoptimized)
```

Out:

```
{'mean': 493.1726890200014, 'median': 492.9526995499998, 'std': 0.9893551399775369}
```

## Postprocess the output¶

As previously mentioned, each model will have its own particular way of providing output tensors.

In our case, we need to run some post-processing to render the outputs from ResNet-50 v2 into a more human-readable form, using the lookup-table provided for the model.

```
from scipy.special import softmax
# Download a list of labels
labels_url = "https://s3.amazonaws.com/onnx-model-zoo/synset.txt"
labels_path = download_testdata(labels_url, "synset.txt", module="data")
with open(labels_path, "r") as f:
labels = [l.rstrip() for l in f]
# Open the output and read the output tensor
scores = softmax(tvm_output)
scores = np.squeeze(scores)
ranks = np.argsort(scores)[::-1]
for rank in ranks[0:5]:
print("class='%s' with probability=%f" % (labels[rank], scores[rank]))
```

Out:

```
class='n02123045 tabby, tabby cat' with probability=0.621103
class='n02123159 tiger cat' with probability=0.356379
class='n02124075 Egyptian cat' with probability=0.019712
class='n02129604 tiger, Panthera tigris' with probability=0.001215
class='n04040759 radiator' with probability=0.000262
```

This should produce the following output:

```
# class='n02123045 tabby, tabby cat' with probability=0.610553
# class='n02123159 tiger cat' with probability=0.367179
# class='n02124075 Egyptian cat' with probability=0.019365
# class='n02129604 tiger, Panthera tigris' with probability=0.001273
# class='n04040759 radiator' with probability=0.000261
```

## Tune the model¶

The previous model was compiled to work on the TVM runtime, but did not include any platform specific optimization. In this section, we will show you how to build an optimized model using TVM to target your working platform.

In some cases, we might not get the expected performance when running inferences using our compiled module. In cases like this, we can make use of the auto-tuner, to find a better configuration for our model and get a boost in performance. Tuning in TVM refers to the process by which a model is optimized to run faster on a given target. This differs from training or fine-tuning in that it does not affect the accuracy of the model, but only the runtime performance. As part of the tuning process, TVM will try running many different operator implementation variants to see which perform best. The results of these runs are stored in a tuning records file.

In the simplest form, tuning requires you to provide three things:

the target specification of the device you intend to run this model on

the path to an output file in which the tuning records will be stored

a path to the model to be tuned.

```
import tvm.auto_scheduler as auto_scheduler
from tvm.autotvm.tuner import XGBTuner
from tvm import autotvm
```

Set up some basic parameters for the runner. The runner takes compiled code
that is generated with a specific set of parameters and measures the
performance of it. `number`

specifies the number of different
configurations that we will test, while `repeat`

specifies how many
measurements we will take of each configuration. `min_repeat_ms`

is a value
that specifies how long need to run configuration test. If the number of
repeats falls under this time, it will be increased. This option is necessary
for accurate tuning on GPUs, and is not required for CPU tuning. Setting this
value to 0 disables it. The `timeout`

places an upper limit on how long to
run training code for each tested configuration.

```
number = 10
repeat = 1
min_repeat_ms = 0 # since we're tuning on a CPU, can be set to 0
timeout = 10 # in seconds
# create a TVM runner
runner = autotvm.LocalRunner(
number=number,
repeat=repeat,
timeout=timeout,
min_repeat_ms=min_repeat_ms,
enable_cpu_cache_flush=True,
)
```

Create a simple structure for holding tuning options. We use an XGBoost
algorithim for guiding the search. For a production job, you will want to set
the number of trials to be larger than the value of 20 used here. For CPU we
recommend 1500, for GPU 3000-4000. The number of trials required can depend
on the particular model and processor, so it’s worth spending some time
evaluating performance across a range of values to find the best balance
between tuning time and model optimization. Because running tuning is time
intensive we set number of trials to 10, but do not recommend a value this
small. The `early_stopping`

parameter is the minimum number of trails to
run before a condition that stops the search early can be applied. The
measure option indicates where trial code will be built, and where it will be
run. In this case, we’re using the `LocalRunner`

we just created and a
`LocalBuilder`

. The `tuning_records`

option specifies a file to write
the tuning data to.

```
tuning_option = {
"tuner": "xgb",
"trials": 20,
"early_stopping": 100,
"measure_option": autotvm.measure_option(
builder=autotvm.LocalBuilder(build_func="default"), runner=runner
),
"tuning_records": "resnet-50-v2-autotuning.json",
}
```

Defining the Tuning Search Algorithm

By default this search is guided using an XGBoost Grid algorithm. Depending on your model complexity and amount of time available, you might want to choose a different algorithm.

Setting Tuning Parameters

In this example, in the interest of time, we set the number of trials and early stopping to 10. You will likely see more performance improvements if you set these values to be higher but this comes at the expense of time spent tuning. The number of trials required for convergence will vary depending on the specifics of the model and the target platform.

```
# begin by extracting the tasks from the onnx model
tasks = autotvm.task.extract_from_program(mod["main"], target=target, params=params)
# Tune the extracted tasks sequentially.
for i, task in enumerate(tasks):
prefix = "[Task %2d/%2d] " % (i + 1, len(tasks))
tuner_obj = XGBTuner(task, loss_type="rank")
tuner_obj.tune(
n_trial=min(tuning_option["trials"], len(task.config_space)),
early_stopping=tuning_option["early_stopping"],
measure_option=tuning_option["measure_option"],
callbacks=[
autotvm.callback.progress_bar(tuning_option["trials"], prefix=prefix),
autotvm.callback.log_to_file(tuning_option["tuning_records"]),
],
)
```

Out:

```
[Task 1/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 1/25] Current/Best: 17.56/ 17.56 GFLOPS | Progress: (4/20) | 5.97 s
[Task 1/25] Current/Best: 6.17/ 17.56 GFLOPS | Progress: (8/20) | 8.91 s
[Task 1/25] Current/Best: 11.55/ 22.82 GFLOPS | Progress: (12/20) | 11.31 s
[Task 1/25] Current/Best: 16.79/ 22.82 GFLOPS | Progress: (16/20) | 12.99 s
[Task 1/25] Current/Best: 11.60/ 23.91 GFLOPS | Progress: (20/20) | 14.71 s Done.
[Task 2/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 2/25] Current/Best: 12.32/ 13.17 GFLOPS | Progress: (4/20) | 3.71 s
[Task 2/25] Current/Best: 14.06/ 18.10 GFLOPS | Progress: (8/20) | 5.00 s
[Task 2/25] Current/Best: 21.13/ 21.13 GFLOPS | Progress: (12/20) | 6.32 s
[Task 2/25] Current/Best: 12.29/ 21.13 GFLOPS | Progress: (16/20) | 7.57 s
[Task 2/25] Current/Best: 19.42/ 21.13 GFLOPS | Progress: (20/20) | 9.17 s Done.
[Task 3/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 3/25] Current/Best: 1.63/ 10.58 GFLOPS | Progress: (4/20) | 5.79 s
[Task 3/25] Current/Best: 15.55/ 16.85 GFLOPS | Progress: (8/20) | 7.71 s
[Task 3/25] Current/Best: 14.83/ 16.85 GFLOPS | Progress: (12/20) | 9.45 s
[Task 3/25] Current/Best: 7.19/ 23.84 GFLOPS | Progress: (16/20) | 11.38 s
[Task 3/25] Current/Best: 12.51/ 23.84 GFLOPS | Progress: (20/20) | 15.88 s Done.
[Task 4/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 4/25] Current/Best: 9.54/ 20.44 GFLOPS | Progress: (4/20) | 2.34 s
[Task 4/25] Current/Best: 6.87/ 20.44 GFLOPS | Progress: (8/20) | 6.69 s
[Task 4/25] Current/Best: 22.38/ 22.38 GFLOPS | Progress: (12/20) | 11.22 s
[Task 4/25] Current/Best: 16.83/ 22.38 GFLOPS | Progress: (16/20) | 13.43 s
[Task 4/25] Current/Best: 13.35/ 22.38 GFLOPS | Progress: (20/20) | 15.43 s Done.
[Task 5/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 5/25] Current/Best: 9.57/ 10.34 GFLOPS | Progress: (4/20) | 2.52 s
[Task 5/25] Current/Best: 11.56/ 12.41 GFLOPS | Progress: (8/20) | 4.57 s
[Task 5/25] Current/Best: 11.73/ 18.15 GFLOPS | Progress: (12/20) | 7.49 s
[Task 5/25] Current/Best: 11.87/ 22.97 GFLOPS | Progress: (16/20) | 8.90 s
[Task 5/25] Current/Best: 11.98/ 22.97 GFLOPS | Progress: (20/20) | 10.73 s Done.
[Task 6/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 6/25] Current/Best: 12.18/ 20.69 GFLOPS | Progress: (4/20) | 3.85 s
[Task 6/25] Current/Best: 19.06/ 20.69 GFLOPS | Progress: (8/20) | 5.60 s
[Task 6/25] Current/Best: 13.25/ 20.69 GFLOPS | Progress: (12/20) | 7.51 s
[Task 6/25] Current/Best: 19.97/ 20.69 GFLOPS | Progress: (16/20) | 9.79 s
[Task 6/25] Current/Best: 3.76/ 20.69 GFLOPS | Progress: (20/20) | 12.27 s Done.
[Task 7/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 7/25] Current/Best: 11.24/ 12.93 GFLOPS | Progress: (4/20) | 3.45 s
[Task 7/25] Current/Best: 20.24/ 21.08 GFLOPS | Progress: (8/20) | 4.97 s
[Task 7/25] Current/Best: 16.06/ 21.08 GFLOPS | Progress: (12/20) | 6.86 s
[Task 7/25] Current/Best: 12.25/ 21.08 GFLOPS | Progress: (16/20) | 8.90 s
[Task 7/25] Current/Best: 6.35/ 21.77 GFLOPS | Progress: (20/20) | 11.35 s Done.
[Task 8/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 8/25] Current/Best: 10.52/ 14.22 GFLOPS | Progress: (4/20) | 2.83 s
[Task 8/25] Current/Best: 9.86/ 14.22 GFLOPS | Progress: (8/20) | 7.59 s
[Task 8/25] Current/Best: 12.58/ 14.22 GFLOPS | Progress: (12/20) | 13.69 s
[Task 8/25] Current/Best: 18.72/ 18.72 GFLOPS | Progress: (16/20) | 15.80 s
[Task 8/25] Current/Best: 20.18/ 20.18 GFLOPS | Progress: (20/20) | 22.21 s Done.
[Task 9/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 9/25] Current/Best: 14.27/ 14.92 GFLOPS | Progress: (4/20) | 11.91 s
[Task 9/25] Current/Best: 23.50/ 23.50 GFLOPS | Progress: (8/20) | 13.66 s
[Task 9/25] Current/Best: 8.23/ 23.50 GFLOPS | Progress: (12/20) | 16.03 s
[Task 9/25] Current/Best: 18.03/ 23.50 GFLOPS | Progress: (16/20) | 18.54 s
[Task 9/25] Current/Best: 9.09/ 23.50 GFLOPS | Progress: (20/20) | 26.20 s
[Task 10/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 10/25] Current/Best: 18.12/ 18.12 GFLOPS | Progress: (4/20) | 2.51 s
[Task 10/25] Current/Best: 15.53/ 18.12 GFLOPS | Progress: (8/20) | 4.07 s
[Task 10/25] Current/Best: 12.30/ 18.91 GFLOPS | Progress: (12/20) | 5.58 s
[Task 10/25] Current/Best: 19.09/ 20.38 GFLOPS | Progress: (16/20) | 6.68 s
[Task 10/25] Current/Best: 8.94/ 20.38 GFLOPS | Progress: (20/20) | 8.23 s Done.
[Task 11/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 11/25] Current/Best: 11.58/ 18.14 GFLOPS | Progress: (4/20) | 3.27 s
[Task 11/25] Current/Best: 16.92/ 18.14 GFLOPS | Progress: (8/20) | 6.01 s
[Task 11/25] Current/Best: 18.20/ 18.20 GFLOPS | Progress: (12/20) | 8.00 s
[Task 11/25] Current/Best: 13.43/ 21.22 GFLOPS | Progress: (16/20) | 10.69 s
[Task 11/25] Current/Best: 19.50/ 21.43 GFLOPS | Progress: (20/20) | 12.71 s Done.
[Task 12/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 12/25] Current/Best: 7.81/ 18.13 GFLOPS | Progress: (4/20) | 5.24 s
[Task 12/25] Current/Best: 5.27/ 18.13 GFLOPS | Progress: (8/20) | 8.90 s
[Task 12/25] Current/Best: 18.89/ 18.89 GFLOPS | Progress: (12/20) | 10.89 s
[Task 12/25] Current/Best: 15.34/ 18.89 GFLOPS | Progress: (16/20) | 13.67 s
[Task 12/25] Current/Best: 15.07/ 18.89 GFLOPS | Progress: (20/20) | 15.59 s Done.
[Task 13/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 13/25] Current/Best: 8.78/ 17.30 GFLOPS | Progress: (4/20) | 3.56 s
[Task 13/25] Current/Best: 15.94/ 21.11 GFLOPS | Progress: (8/20) | 5.98 s
[Task 13/25] Current/Best: 19.62/ 21.70 GFLOPS | Progress: (12/20) | 8.80 s
[Task 13/25] Current/Best: 12.25/ 21.70 GFLOPS | Progress: (16/20) | 12.16 s
[Task 13/25] Current/Best: 18.85/ 21.70 GFLOPS | Progress: (20/20) | 14.39 s Done.
[Task 14/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 14/25] Current/Best: 13.65/ 13.65 GFLOPS | Progress: (4/20) | 3.24 s
[Task 14/25] Current/Best: 6.11/ 13.65 GFLOPS | Progress: (8/20) | 5.41 s
[Task 14/25] Current/Best: 20.73/ 20.73 GFLOPS | Progress: (12/20) | 7.93 s
[Task 14/25] Current/Best: 15.80/ 20.73 GFLOPS | Progress: (16/20) | 9.79 s Done.
[Task 14/25] Current/Best: 17.18/ 20.73 GFLOPS | Progress: (20/20) | 11.55 s
[Task 15/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 15/25] Current/Best: 16.16/ 17.65 GFLOPS | Progress: (4/20) | 2.61 s
[Task 15/25] Current/Best: 14.47/ 18.14 GFLOPS | Progress: (8/20) | 4.07 s
[Task 15/25] Current/Best: 10.32/ 22.30 GFLOPS | Progress: (12/20) | 6.09 s
[Task 15/25] Current/Best: 20.37/ 22.30 GFLOPS | Progress: (16/20) | 9.09 s
[Task 15/25] Current/Best: 9.71/ 22.30 GFLOPS | Progress: (20/20) | 10.27 s
[Task 16/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 16/25] Current/Best: 20.51/ 20.51 GFLOPS | Progress: (4/20) | 2.84 s
[Task 16/25] Current/Best: 3.01/ 20.51 GFLOPS | Progress: (8/20) | 4.46 s
[Task 16/25] Current/Best: 19.16/ 20.51 GFLOPS | Progress: (12/20) | 5.67 s
[Task 16/25] Current/Best: 17.94/ 20.51 GFLOPS | Progress: (16/20) | 7.00 s
[Task 16/25] Current/Best: 10.06/ 22.08 GFLOPS | Progress: (20/20) | 9.04 s Done.
[Task 17/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 17/25] Current/Best: 13.63/ 18.84 GFLOPS | Progress: (4/20) | 4.61 s
[Task 17/25] Current/Best: 14.41/ 23.38 GFLOPS | Progress: (8/20) | 7.46 s
[Task 17/25] Current/Best: 17.22/ 23.38 GFLOPS | Progress: (12/20) | 9.49 s
[Task 17/25] Current/Best: 16.52/ 23.38 GFLOPS | Progress: (16/20) | 11.61 s
[Task 17/25] Current/Best: 10.04/ 23.38 GFLOPS | Progress: (20/20) | 13.72 s Done.
[Task 18/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 18/25] Current/Best: 11.19/ 16.62 GFLOPS | Progress: (4/20) | 3.65 s
[Task 18/25] Current/Best: 10.63/ 19.37 GFLOPS | Progress: (8/20) | 7.07 s
[Task 18/25] Current/Best: 19.29/ 19.37 GFLOPS | Progress: (12/20) | 9.00 s
[Task 18/25] Current/Best: 10.07/ 19.37 GFLOPS | Progress: (16/20) | 12.51 s
[Task 18/25] Current/Best: 20.58/ 20.58 GFLOPS | Progress: (20/20) | 14.03 s Done.
[Task 19/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 19/25] Current/Best: 7.13/ 20.27 GFLOPS | Progress: (4/20) | 5.90 s
[Task 19/25] Current/Best: 2.61/ 20.27 GFLOPS | Progress: (8/20) | 9.20 s
[Task 19/25] Current/Best: 19.79/ 21.49 GFLOPS | Progress: (12/20) | 12.00 s
[Task 19/25] Current/Best: 15.51/ 22.00 GFLOPS | Progress: (16/20) | 14.83 s
[Task 19/25] Current/Best: 2.70/ 23.47 GFLOPS | Progress: (20/20) | 17.63 s Done.
[Task 20/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 20/25] Current/Best: 9.86/ 15.34 GFLOPS | Progress: (4/20) | 3.23 s Done.
Done.
[Task 20/25] Current/Best: 9.79/ 15.34 GFLOPS | Progress: (8/20) | 6.69 s
[Task 20/25] Current/Best: 2.32/ 16.84 GFLOPS | Progress: (12/20) | 10.54 s
[Task 20/25] Current/Best: 12.40/ 16.84 GFLOPS | Progress: (16/20) | 14.31 s
[Task 20/25] Current/Best: 11.59/ 22.20 GFLOPS | Progress: (20/20) | 16.39 s
[Task 21/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 21/25] Current/Best: 6.41/ 17.72 GFLOPS | Progress: (4/20) | 3.14 s
[Task 21/25] Current/Best: 14.63/ 17.72 GFLOPS | Progress: (8/20) | 4.67 s
[Task 21/25] Current/Best: 1.61/ 17.72 GFLOPS | Progress: (12/20) | 6.80 s
[Task 21/25] Current/Best: 17.99/ 17.99 GFLOPS | Progress: (16/20) | 10.20 s
[Task 21/25] Current/Best: 4.47/ 17.99 GFLOPS | Progress: (20/20) | 17.29 s
[Task 22/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 22/25] Current/Best: 2.70/ 17.00 GFLOPS | Progress: (4/20) | 2.61 s
[Task 22/25] Current/Best: 8.68/ 21.81 GFLOPS | Progress: (8/20) | 4.58 s
[Task 22/25] Current/Best: 19.91/ 21.81 GFLOPS | Progress: (12/20) | 6.85 s
[Task 22/25] Current/Best: 15.31/ 21.81 GFLOPS | Progress: (16/20) | 8.92 s
[Task 22/25] Current/Best: 14.10/ 21.81 GFLOPS | Progress: (20/20) | 10.57 s Done.
[Task 23/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 23/25] Current/Best: 17.24/ 20.40 GFLOPS | Progress: (4/20) | 3.20 s
[Task 23/25] Current/Best: 14.94/ 20.40 GFLOPS | Progress: (8/20) | 6.46 s
[Task 23/25] Current/Best: 20.87/ 21.67 GFLOPS | Progress: (12/20) | 8.25 s
[Task 23/25] Current/Best: 6.37/ 21.67 GFLOPS | Progress: (16/20) | 15.15 s
[Task 23/25] Current/Best: 7.72/ 21.67 GFLOPS | Progress: (20/20) | 19.35 s Done.
[Task 24/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 24/25] Current/Best: 8.40/ 8.40 GFLOPS | Progress: (4/20) | 11.72 s
[Task 24/25] Current/Best: 2.11/ 8.40 GFLOPS | Progress: (8/20) | 22.71 s
[Task 24/25] Current/Best: 4.27/ 8.40 GFLOPS | Progress: (12/20) | 34.17 s Done.
Done.
[Task 24/25] Current/Best: 6.71/ 8.76 GFLOPS | Progress: (16/20) | 39.53 s
[Task 24/25] Current/Best: 3.30/ 9.00 GFLOPS | Progress: (20/20) | 45.35 s Done.
[Task 25/25] Current/Best: 0.00/ 0.00 GFLOPS | Progress: (0/20) | 0.00 s
[Task 25/25] Current/Best: 1.55/ 2.81 GFLOPS | Progress: (4/20) | 11.52 s
[Task 25/25] Current/Best: 5.89/ 8.06 GFLOPS | Progress: (8/20) | 22.76 s
[Task 25/25] Current/Best: 6.00/ 8.06 GFLOPS | Progress: (12/20) | 34.01 s
[Task 25/25] Current/Best: 5.81/ 9.47 GFLOPS | Progress: (16/20) | 35.85 s
[Task 25/25] Current/Best: 2.89/ 9.47 GFLOPS | Progress: (20/20) | 46.52 s
```

The output from this tuning process will look something like this:

```
# [Task 1/24] Current/Best: 10.71/ 21.08 GFLOPS | Progress: (60/1000) | 111.77 s Done.
# [Task 1/24] Current/Best: 9.32/ 24.18 GFLOPS | Progress: (192/1000) | 365.02 s Done.
# [Task 2/24] Current/Best: 22.39/ 177.59 GFLOPS | Progress: (960/1000) | 976.17 s Done.
# [Task 3/24] Current/Best: 32.03/ 153.34 GFLOPS | Progress: (800/1000) | 776.84 s Done.
# [Task 4/24] Current/Best: 11.96/ 156.49 GFLOPS | Progress: (960/1000) | 632.26 s Done.
# [Task 5/24] Current/Best: 23.75/ 130.78 GFLOPS | Progress: (800/1000) | 739.29 s Done.
# [Task 6/24] Current/Best: 38.29/ 198.31 GFLOPS | Progress: (1000/1000) | 624.51 s Done.
# [Task 7/24] Current/Best: 4.31/ 210.78 GFLOPS | Progress: (1000/1000) | 701.03 s Done.
# [Task 8/24] Current/Best: 50.25/ 185.35 GFLOPS | Progress: (972/1000) | 538.55 s Done.
# [Task 9/24] Current/Best: 50.19/ 194.42 GFLOPS | Progress: (1000/1000) | 487.30 s Done.
# [Task 10/24] Current/Best: 12.90/ 172.60 GFLOPS | Progress: (972/1000) | 607.32 s Done.
# [Task 11/24] Current/Best: 62.71/ 203.46 GFLOPS | Progress: (1000/1000) | 581.92 s Done.
# [Task 12/24] Current/Best: 36.79/ 224.71 GFLOPS | Progress: (1000/1000) | 675.13 s Done.
# [Task 13/24] Current/Best: 7.76/ 219.72 GFLOPS | Progress: (1000/1000) | 519.06 s Done.
# [Task 14/24] Current/Best: 12.26/ 202.42 GFLOPS | Progress: (1000/1000) | 514.30 s Done.
# [Task 15/24] Current/Best: 31.59/ 197.61 GFLOPS | Progress: (1000/1000) | 558.54 s Done.
# [Task 16/24] Current/Best: 31.63/ 206.08 GFLOPS | Progress: (1000/1000) | 708.36 s Done.
# [Task 17/24] Current/Best: 41.18/ 204.45 GFLOPS | Progress: (1000/1000) | 736.08 s Done.
# [Task 18/24] Current/Best: 15.85/ 222.38 GFLOPS | Progress: (980/1000) | 516.73 s Done.
# [Task 19/24] Current/Best: 15.78/ 203.41 GFLOPS | Progress: (1000/1000) | 587.13 s Done.
# [Task 20/24] Current/Best: 30.47/ 205.92 GFLOPS | Progress: (980/1000) | 471.00 s Done.
# [Task 21/24] Current/Best: 46.91/ 227.99 GFLOPS | Progress: (308/1000) | 219.18 s Done.
# [Task 22/24] Current/Best: 13.33/ 207.66 GFLOPS | Progress: (1000/1000) | 761.74 s Done.
# [Task 23/24] Current/Best: 53.29/ 192.98 GFLOPS | Progress: (1000/1000) | 799.90 s Done.
# [Task 24/24] Current/Best: 25.03/ 146.14 GFLOPS | Progress: (1000/1000) | 1112.55 s Done.
```

## Compiling an Optimized Model with Tuning Data¶

As an output of the tuning process above, we obtained the tuning records
stored in `resnet-50-v2-autotuning.json`

. The compiler will use the results to
generate high performance code for the model on your specified target.

Now that tuning data for the model has been collected, we can re-compile the model using optimized operators to speed up our computations.

```
with autotvm.apply_history_best(tuning_option["tuning_records"]):
with tvm.transform.PassContext(opt_level=3, config={}):
lib = relay.build(mod, target=target, params=params)
dev = tvm.device(str(target), 0)
module = graph_executor.GraphModule(lib["default"](dev))
```

Verify that the optimized model runs and produces the same results:

```
dtype = "float32"
module.set_input(input_name, img_data)
module.run()
output_shape = (1, 1000)
tvm_output = module.get_output(0, tvm.nd.empty(output_shape)).numpy()
scores = softmax(tvm_output)
scores = np.squeeze(scores)
ranks = np.argsort(scores)[::-1]
for rank in ranks[0:5]:
print("class='%s' with probability=%f" % (labels[rank], scores[rank]))
```

Out:

```
class='n02123045 tabby, tabby cat' with probability=0.621104
class='n02123159 tiger cat' with probability=0.356378
class='n02124075 Egyptian cat' with probability=0.019712
class='n02129604 tiger, Panthera tigris' with probability=0.001215
class='n04040759 radiator' with probability=0.000262
```

Verifying that the predictions are the same:

```
# class='n02123045 tabby, tabby cat' with probability=0.610550
# class='n02123159 tiger cat' with probability=0.367181
# class='n02124075 Egyptian cat' with probability=0.019365
# class='n02129604 tiger, Panthera tigris' with probability=0.001273
# class='n04040759 radiator' with probability=0.000261
```

## Comparing the Tuned and Untuned Models¶

We want to collect some basic performance data associated with this optimized model to compare it to the unoptimized model. Depending on your underlying hardware, number of iterations, and other factors, you should see a performance improvement in comparing the optimized model to the unoptimized model.

```
import timeit
timing_number = 10
timing_repeat = 10
optimized = (
np.array(timeit.Timer(lambda: module.run()).repeat(repeat=timing_repeat, number=timing_number))
* 1000
/ timing_number
)
optimized = {"mean": np.mean(optimized), "median": np.median(optimized), "std": np.std(optimized)}
print("optimized: %s" % (optimized))
print("unoptimized: %s" % (unoptimized))
```

Out:

```
optimized: {'mean': 410.85454964999826, 'median': 410.6706577000068, 'std': 0.5093760131884688}
unoptimized: {'mean': 493.1726890200014, 'median': 492.9526995499998, 'std': 0.9893551399775369}
```

## Final Remarks¶

In this tutorial, we gave a short example of how to use the TVM Python API to compile, run, and tune a model. We also discussed the need for pre and post-processing of inputs and outputs. After the tuning process, we demonstrated how to compare the performance of the unoptimized and optimize models.

Here we presented a simple example using ResNet-50 v2 locally. However, TVM supports many more features including cross-compilation, remote execution and profiling/benchmarking.

**Total running time of the script:** ( 10 minutes 9.638 seconds)