def test_power_operators():
a = 2 * nd.ones(shape=LARGE_X)
# sqrt
result = nd.sqrt(a)
assert result[-1] == 1.4142135
assert result.shape == a.shape
# rsqrt
result = nd.rsqrt(a)
assert result[-1] == 0.70710677
assert result.shape == a.shape
# cbrt
result = nd.cbrt(a)
assert result[-1] == 1.2599211
assert result.shape == a.shape
# rcbrt
result = nd.rcbrt(a)
assert result[-1] == 0.7937005
assert result.shape == a.shape
# square
result = nd.square(a)
assert result[-1] == 4
assert result.shape == a.shape
# reciprocal
result = nd.reciprocal(a)
assert result[-1] == 0.5
assert result.shape == a.shape
def reciprocal(x):
return nd.reciprocal(x)
tree.collect_params()
nd.sum(nd.maximum(nd.array([[1, 3], [2, 6], [5, 2]]) - nd.array([3, 3]), 0) +
nd.maximum(nd.array([0, 0]) - nd.array([[1, 3], [2, 6], [5, 2]]), 0),
axis=1,
keepdims=True)
# %%
1 - nd.array([2])[0]
next(iter(OrderedDict([("hello", 1)]).items()))
# %%
tree.collect_params()
tree.collect_params()._params["tree5_node0_box0_max_list"]
nd.random.exponential(nd.reciprocal(nd.array([10])))
nd.array([1, 2, 3])[nd.array([0])]
node_0 = Node(
min_list=nd.array([0, 0]),
max_list=nd.array([7, 7]),
tau=nd.array([0.004]),
decision=lambda: Decision(split=nd.array([2]), dim=nd.array([1])))
node_0._params
node_0.collect_params()
# %%
nd.stack(*[nd.array([1, 2, 3]), nd.array([4, 5, 6])], axis=1)
nd.array([[1, 2, 3], [4, 5, 6]])
nd.stack(*[nd.array([.5])], axis=1)
nd.stack(*[
