Comparison Between TreeValue and Tianshou Batch¶
In this section, we will take a look at the feature and performance of the Tianshou Batch library, which is developed by Tsinghua Machine Learning Group.
Before starting the comparison, let us define some thing.
[1]:
import torch
_TREE_DATA_1 = {'a': 1, 'b': 2, 'x': {'c': 3, 'd': 4}}
_TREE_DATA_2 = {
'a': torch.randn(2, 3),
'x': {
'c': torch.randn(3, 4)
},
}
_TREE_DATA_3 = {
'obs': torch.randn(4, 84, 84),
'action': torch.randint(0, 6, size=(1,)),
'reward': torch.rand(1),
}
Read and Write Operation¶
Reading and writing are the two most common operations in the tree data structure based on the data model (TreeValue and Tianshou Batch both belong to this type), so this section will compare the reading and writing performance of these two libraries.
TreeValue’s Get and Set¶
[2]:
from treevalue import FastTreeValue
t = FastTreeValue(_TREE_DATA_2)
/tmp/tmp4q2ykbbk/131d60c1029b5142cef0f38fcc2163eb0e8d23aa/treevalue/tree/integration/torch.py:21: FutureWarning: `torch.utils._pytree._register_pytree_node` is deprecated. Please use `torch.utils._pytree.register_pytree_node` instead.
register_for_torch(TreeValue)
/tmp/tmp4q2ykbbk/131d60c1029b5142cef0f38fcc2163eb0e8d23aa/treevalue/tree/integration/torch.py:22: FutureWarning: `torch.utils._pytree._register_pytree_node` is deprecated. Please use `torch.utils._pytree.register_pytree_node` instead.
register_for_torch(FastTreeValue)
[3]:
t
[3]:
[4]:
t.a
[4]:
tensor([[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]])
[5]:
%timeit t.a
47.6 ns ± 0.217 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)
[6]:
new_value = torch.randn(2, 3)
t.a = new_value
t
[6]:
[7]:
%timeit t.a = new_value
54.3 ns ± 0.449 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)
Tianshou Batch’s Get and Set¶
[8]:
from tianshou.data import Batch
b = Batch(**_TREE_DATA_2)
[9]:
b
[9]:
Batch(
a: tensor([[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]]),
x: Batch(
c: tensor([[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]]),
),
)
[10]:
b.a
[10]:
tensor([[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]])
[11]:
%timeit b.a
43.3 ns ± 0.357 ns per loop (mean ± std. dev. of 7 runs, 10,000,000 loops each)
[12]:
new_value = torch.randn(2, 3)
b.a = new_value
b
[12]:
Batch(
a: tensor([[ 0.8693, -0.2210, -0.6237],
[-0.3459, 0.9517, 0.2395]]),
x: Batch(
c: tensor([[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]]),
),
)
[13]:
%timeit b.a = new_value
372 ns ± 3.87 ns per loop (mean ± std. dev. of 7 runs, 1,000,000 loops each)
Initialization¶
TreeValue’s Initialization¶
[14]:
%timeit FastTreeValue(_TREE_DATA_1)
618 ns ± 3.76 ns per loop (mean ± std. dev. of 7 runs, 1,000,000 loops each)
Tianshou Batch’s Initialization¶
[15]:
%timeit Batch(**_TREE_DATA_1)
8.45 µs ± 37.2 ns per loop (mean ± std. dev. of 7 runs, 100,000 loops each)
Deep Copy Operation¶
[16]:
import copy
Deep Copy of TreeValue¶
[17]:
t3 = FastTreeValue(_TREE_DATA_3)
%timeit copy.deepcopy(t3)
130 µs ± 731 ns per loop (mean ± std. dev. of 7 runs, 10,000 loops each)
Deep Copy of Tianshou Batch¶
[18]:
b3 = Batch(**_TREE_DATA_3)
%timeit copy.deepcopy(b3)
125 µs ± 1.04 µs per loop (mean ± std. dev. of 7 runs, 10,000 loops each)
Stack, Concat and Split Operation¶
Performance of TreeValue¶
[19]:
trees = [FastTreeValue(_TREE_DATA_2) for _ in range(8)]
[20]:
t_stack = FastTreeValue.func(subside=True)(torch.stack)
t_stack(trees)
[20]:
[21]:
%timeit t_stack(trees)
23.6 µs ± 70.7 ns per loop (mean ± std. dev. of 7 runs, 10,000 loops each)
[22]:
t_cat = FastTreeValue.func(subside=True)(torch.cat)
t_cat(trees)
[22]:
[23]:
%timeit t_cat(trees)
22.2 µs ± 289 ns per loop (mean ± std. dev. of 7 runs, 10,000 loops each)
[24]:
t_split = FastTreeValue.func(rise=True)(torch.split)
tree = FastTreeValue({
'obs': torch.randn(8, 4, 84, 84),
'action': torch.randint(0, 6, size=(8, 1,)),
'reward': torch.rand(8, 1),
})
%timeit t_split(tree, 1)
50.5 µs ± 352 ns per loop (mean ± std. dev. of 7 runs, 10,000 loops each)
Performance of Tianshou Batch¶
[25]:
batches = [Batch(**_TREE_DATA_2) for _ in range(8)]
Batch.stack(batches)
[25]:
Batch(
x: Batch(
c: tensor([[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]],
[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]],
[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]],
[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]],
[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]],
[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]],
[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]],
[[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]]]),
),
a: tensor([[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]],
[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]],
[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]],
[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]],
[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]],
[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]],
[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]],
[[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]]]),
)
[26]:
%timeit Batch.stack(batches)
62.7 µs ± 346 ns per loop (mean ± std. dev. of 7 runs, 10,000 loops each)
[27]:
Batch.cat(batches)
[27]:
Batch(
x: Batch(
c: tensor([[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087],
[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087],
[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087],
[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087],
[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087],
[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087],
[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087],
[ 0.9395, 0.3747, 0.8337, 1.6885],
[ 0.7373, -0.6815, -0.3337, -0.3466],
[ 1.0900, -1.5765, 0.3794, -0.2087]]),
),
a: tensor([[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429],
[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429],
[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429],
[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429],
[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429],
[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429],
[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429],
[ 0.5957, -0.0751, -0.2476],
[ 0.6982, -0.5048, -1.6429]]),
)
[28]:
%timeit Batch.cat(batches)
117 µs ± 357 ns per loop (mean ± std. dev. of 7 runs, 10,000 loops each)
[29]:
batch = Batch({
'obs': torch.randn(8, 4, 84, 84),
'action': torch.randint(0, 6, size=(8, 1,)),
'reward': torch.rand(8, 1)}
)
%timeit list(Batch.split(batch, 1, shuffle=False, merge_last=True))
288 µs ± 2.28 µs per loop (mean ± std. dev. of 7 runs, 1,000 loops each)
[ ]: