Apply into NumpyΒΆ
In following parts, we will show some demos about how to use TreeValue
in practice.
For example, now we have a group of structed data in python-dict type, we want to do different operations on differnent key-value pairs inplace, get some statistics such as mean value and task some slices.
In normal cases, we need to unroll multiple for-loop
and if-else
to implement cooresponding operations on each values, and declare additional
temporal variables to save result. All the mentioned contents are executed serially, like the next code examples:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 | import numpy as np T, B = 3, 4 def without_treevalue(batch_): mean_b_list = [] even_index_a_list = [] for i in range(len(batch_)): for k, v in batch_[i].items(): if k == 'a': v = v.astype(np.float32) even_index_a_list.append(v[::2]) elif k == 'b': v = v.astype(np.float32) transformed_v = np.power(v, 2) + 1.0 mean_b_list.append(transformed_v.mean()) elif k == 'c': for k1, v1 in v.items(): if k1 == 'd': v1 = v1.astype(np.float32) else: print('ignore keys: {}'.format(k1)) else: print('ignore keys: {}'.format(k)) for i in range(len(batch_)): for k in batch_[i].keys(): if k == 'd': batch_[i][k]['noise'] = np.random.random(size=(3, 4, 5)) mean_b = sum(mean_b_list) / len(mean_b_list) even_index_a = np.stack(even_index_a_list, axis=0) return batch_, mean_b, even_index_a |
However, with the help of TreeValue
, all the contents mentioned above can be implemented gracefully and efficiently. Users only need to func_treelize
the primitive
numpy functions and pack data with FastTreeValue
, then execute desired operations just like using standard numpy array.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | import numpy as np from treevalue import FastTreeValue, func_treelize T, B = 3, 4 power = func_treelize()(np.power) stack = func_treelize(subside=True)(np.stack) split = func_treelize(rise=True)(np.split) @func_treelize() def astype(item, *args): return item.astype(*args) def with_treevalue(batch_): batch_ = [FastTreeValue(b) for b in batch_] batch_ = stack(batch_) batch_ = astype(batch_, np.float32) batch_.b = power(batch_.b, 2) + 1.0 batch_.c.noise = np.random.random(size=(B, 3, 4, 5)) mean_b = batch_.b.mean() even_index_a = batch_.a[:, ::2] batch_ = split(batch_, indices_or_sections=B, axis=0) return batch_, mean_b, even_index_a |
And we can run these two demos for comparison:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | import copy import numpy as np from with_treevalue import with_treevalue from without_treevalue import without_treevalue T, B = 3, 4 def get_data(): return { 'a': np.random.random(size=(T, 8)), 'b': np.random.random(size=(6,)), 'c': { 'd': np.random.randint(0, 10, size=(1,)) } } if __name__ == "__main__": batch = [get_data() for _ in range(B)] batch0, mean0, even_index_a0 = without_treevalue(copy.deepcopy(batch)) batch1, mean1, even_index_a1 = with_treevalue(copy.deepcopy(batch)) assert np.abs(mean0 - mean1) < 1e-6 print('mean0 & mean1:', mean0, mean1) print('\n') assert np.abs((even_index_a0 - even_index_a1).max()) < 1e-6 print('even_index_a0:', even_index_a0) print('even_index_a1:', even_index_a1) assert len(batch0) == B assert len(batch1) == B |
The final output should be the text below, and all the assertions can be passed.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 | mean0 & mean1: 1.3046430945396423 1.3046432 even_index_a0: [[[0.79907703 0.7929432 0.8265666 0.20449655 0.37611786 0.09446114 0.5227303 0.6704473 ] [0.76245683 0.58177817 0.5954623 0.78268564 0.20607993 0.9787361 0.81490165 0.64004713]] [[0.7251114 0.6974862 0.20657182 0.23150685 0.7108442 0.8623925 0.6608489 0.8861315 ] [0.07253418 0.35003415 0.96508014 0.6448819 0.23696429 0.87358373 0.08152328 0.6306302 ]] [[0.29881802 0.9855833 0.04282988 0.3336597 0.8830339 0.93293464 0.6663246 0.5147662 ] [0.5881597 0.5877645 0.8637035 0.76545936 0.7597574 0.24841653 0.8745297 0.00387442]] [[0.8702003 0.36167762 0.884908 0.02455313 0.03636977 0.89545125 0.67505366 0.842597 ] [0.681967 0.62641376 0.92681617 0.40227306 0.36234754 0.49263224 0.4753504 0.5622153 ]]] even_index_a1: [[[0.79907703 0.7929432 0.8265666 0.20449655 0.37611786 0.09446114 0.5227303 0.6704473 ] [0.76245683 0.58177817 0.5954623 0.78268564 0.20607993 0.9787361 0.81490165 0.64004713]] [[0.7251114 0.6974862 0.20657182 0.23150685 0.7108442 0.8623925 0.6608489 0.8861315 ] [0.07253418 0.35003415 0.96508014 0.6448819 0.23696429 0.87358373 0.08152328 0.6306302 ]] [[0.29881802 0.9855833 0.04282988 0.3336597 0.8830339 0.93293464 0.6663246 0.5147662 ] [0.5881597 0.5877645 0.8637035 0.76545936 0.7597574 0.24841653 0.8745297 0.00387442]] [[0.8702003 0.36167762 0.884908 0.02455313 0.03636977 0.89545125 0.67505366 0.842597 ] [0.681967 0.62641376 0.92681617 0.40227306 0.36234754 0.49263224 0.4753504 0.5622153 ]]] |
In this case, we can see that the TreeValue
can be properly applied into the numpy
library.
The tree-structured matrix calculation can be easily built with TreeValue
like using standard numpy array.
Both the simplicity of logic structure and execution efficiency can be improve a lot.
And Last but not least, the only thing you need to do is to wrap the functions in Numpy library, and then use it painlessly like the primitive numpy.