Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
53532957
提交
53532957
authored
7月 24, 2014
作者:
abergeron
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #1993 from nouiz/crash_inc_sub_grad
Crash fix in IncSubtensor.grad
上级
d19e66d9
852114f3
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
104 行增加
和
80 行删除
+104
-80
subtensor.py
theano/tensor/subtensor.py
+63
-56
test_inc_subtensor.py
theano/tensor/tests/test_inc_subtensor.py
+41
-24
没有找到文件。
theano/tensor/subtensor.py
浏览文件 @
53532957
...
...
@@ -594,8 +594,7 @@ class Subtensor(Op):
@staticmethod
def
helper_c_code
(
node
,
name
,
inputs
,
outputs
,
sub
,
idx_list
,
view_ndim
,
c_prefix
=
None
,
strides_mul
=
None
,
):
strides_mul
=
None
):
"""
The parameters c_prefix are there to allow reusing this
function on PyArray and CudaNdarray object.
...
...
@@ -682,7 +681,8 @@ class Subtensor(Op):
subensor_spec
=
"npy_intp * subtensor_spec = NULL;"
if
is_slice
:
is_slice_init
=
"int is_slice[] = {"
+
","
.
join
([
str
(
s
)
for
s
in
is_slice
])
+
"};"
is_slice_init
=
"int is_slice[] = {"
+
","
.
join
([
str
(
s
)
for
s
in
is_slice
])
+
"};"
else
:
is_slice_init
=
"int* is_slice = NULL;"
subtensor_init
=
"
\n
"
.
join
(
init_cmds
)
...
...
@@ -897,7 +897,8 @@ class Subtensor(Op):
%(z)
s = xview;
"""
%
locals
()
return
decl
+
checkNDim
+
"{"
+
get_xview
+
build_view
+
finish_view
+
"}"
return
(
decl
+
checkNDim
+
"{"
+
get_xview
+
build_view
+
finish_view
+
"}"
)
def
c_code_cache_version
(
self
):
hv
=
self
.
helper_c_code_cache_version
()
...
...
@@ -1022,9 +1023,9 @@ def inc_subtensor(x, y, inplace=False, set_instead_of_inc=False,
destroyhandler_tolerate_aliased
=
[[
0
,
1
]]
else
:
destroyhandler_tolerate_aliased
=
[]
the_op
=
IncSubtensor
(
x
.
owner
.
op
.
idx_list
,
inplace
,
set_instead_of_inc
,
destroyhandler_tolerate_aliased
=
destroyhandler_tolerate_aliased
)
the_op
=
IncSubtensor
(
x
.
owner
.
op
.
idx_list
,
inplace
,
set_instead_of_inc
,
destroyhandler_tolerate_aliased
=
destroyhandler_tolerate_aliased
)
real_x
=
x
.
owner
.
inputs
[
0
]
real_idxargs
=
x
.
owner
.
inputs
[
1
:]
return
the_op
(
real_x
,
y
,
*
real_idxargs
)
...
...
@@ -1105,10 +1106,10 @@ class IncSubtensor(Op):
self
.
set_instead_of_inc
=
set_instead_of_inc
def
__eq__
(
self
,
other
):
return
type
(
self
)
==
type
(
other
)
\
and
self
.
idx_list
==
other
.
idx_list
\
and
self
.
inplace
==
other
.
inplace
\
and
self
.
set_instead_of_inc
==
other
.
set_instead_of_inc
return
(
type
(
self
)
==
type
(
other
)
and
self
.
idx_list
==
other
.
idx_list
and
self
.
inplace
==
other
.
inplace
and
self
.
set_instead_of_inc
==
other
.
set_instead_of_inc
)
def
__hash__
(
self
):
msg
=
[]
...
...
@@ -1120,12 +1121,12 @@ class IncSubtensor(Op):
idx_list
=
tuple
(
msg
)
# backport
#idx_list = tuple((entry.start, entry.stop, entry.step)
#
idx_list = tuple((entry.start, entry.stop, entry.step)
# if isinstance(entry, slice)
# else entry
# for entry in self.idx_list)
return
hashtype
(
self
)
^
hash
(
idx_list
)
^
hash
(
self
.
inplace
)
\
^
hash
(
self
.
set_instead_of_inc
)
return
(
hashtype
(
self
)
^
hash
(
idx_list
)
^
hash
(
self
.
inplace
)
^
hash
(
self
.
set_instead_of_inc
)
)
def
__str__
(
self
):
indices
=
[]
...
...
@@ -1225,7 +1226,7 @@ class IncSubtensor(Op):
if
not
self
.
set_instead_of_inc
:
sub_x
+=
y
else
:
#sub_x += -sub_x + y
#
sub_x += -sub_x + y
x
.
__setitem__
(
cdata
,
y
)
else
:
# scalar case
...
...
@@ -1295,7 +1296,7 @@ class IncSubtensor(Op):
**
helper_args
)
#Make a view on the output, as we will write into it.
#
Make a view on the output, as we will write into it.
alloc_zview
=
self
.
make_view_array
(
z
,
view_ndim
)
build_view
=
"""
...
...
@@ -1460,7 +1461,8 @@ class IncSubtensor(Op):
gx
=
g_output
gy
=
Subtensor
(
idx_list
=
self
.
idx_list
)(
g_output
,
*
idx_list
)
if
gy
.
broadcastable
!=
y
.
broadcastable
:
y_broad
=
(
True
,)
*
(
gy
.
ndim
-
y
.
ndim
)
+
y
.
broadcastable
y_dim_added
=
gy
.
ndim
-
y
.
ndim
y_broad
=
(
True
,)
*
y_dim_added
+
y
.
broadcastable
assert
sum
(
gy
.
broadcastable
)
<
sum
(
y_broad
)
axis_to_sum
=
[]
for
i
in
range
(
gy
.
ndim
):
...
...
@@ -1468,7 +1470,7 @@ class IncSubtensor(Op):
axis_to_sum
.
append
(
i
)
elif
(
gy
.
broadcastable
[
i
]
is
True
and
y_broad
[
i
]
is
False
):
# This mean that T
H
eano where able to infer that
# This mean that T
h
eano where able to infer that
# gy.shape[i] is 1, so y.shape[i] is 1, but we
# didn't know it. It is fine.
pass
...
...
@@ -1476,7 +1478,10 @@ class IncSubtensor(Op):
assert
gy
.
broadcastable
[
i
]
==
y_broad
[
i
]
gy
=
gy
.
sum
(
axis
=
axis_to_sum
,
keepdims
=
True
)
if
gy
.
ndim
!=
y
.
ndim
:
gy
=
gy
.
dimshuffle
(
*
range
(
y
.
ndim
,
gy
.
ndim
))
assert
gy
.
ndim
>
y
.
ndim
for
i
in
range
(
y_dim_added
):
assert
gy
.
broadcastable
[
i
]
gy
=
gy
.
dimshuffle
(
*
range
(
y_dim_added
,
gy
.
ndim
))
assert
gy
.
broadcastable
==
y
.
broadcastable
return
[
gx
,
gy
]
+
[
DisconnectedType
()()]
*
len
(
idx_list
)
...
...
@@ -1540,8 +1545,9 @@ class AdvancedSubtensor1(Op):
if
not
numpy
.
can_cast
(
i
.
dtype
,
numpy
.
intp
):
# Check if there was actually an incorrect conversion
if
numpy
.
any
(
i
!=
i_
):
raise
IndexError
(
'index contains values that are bigger '
'than the maximum array size on this system.'
,
i
)
raise
IndexError
(
'index contains values that are bigger '
'than the maximum array size on this system.'
,
i
)
i
=
i_
out
[
0
]
=
x
.
take
(
i
,
axis
=
0
,
out
=
o
)
...
...
@@ -1732,9 +1738,10 @@ class AdvancedIncSubtensor1(Op):
opname
=
'set'
else
:
opname
=
'increment'
raise
TypeError
(
'cannot
%
s x subtensor with ndim=
%
s'
' by y with ndim=
%
s to x subtensor with ndim=
%
s '
%
(
opname
,
x_
.
type
.
ndim
,
y_
.
type
.
ndim
))
raise
TypeError
(
'cannot
%
s x subtensor with ndim=
%
s'
' by y with ndim=
%
s to x subtensor with ndim=
%
s '
%
(
opname
,
x_
.
type
.
ndim
,
y_
.
type
.
ndim
))
return
Apply
(
self
,
[
x_
,
y_
,
ilist_
],
[
x_
.
type
()])
...
...
@@ -1837,7 +1844,7 @@ def adv_index_broadcastable_pattern(a, idx):
newidx
=
tuple
(
map
(
replace_slice
,
idx
))
#2 - True = 1; 2 - False = 2
#
2 - True = 1; 2 - False = 2
fakeshape
=
[
2
-
bc
for
bc
in
a
.
broadcastable
]
retshape
=
numpy
.
empty
(
fakeshape
)[
newidx
]
.
shape
return
tuple
([
dim
==
1
for
dim
in
retshape
])
...
...
@@ -1867,7 +1874,7 @@ class AdvancedSubtensor(Op):
return
gof
.
Apply
(
self
,
(
x
,)
+
index
,
[
theano
.
tensor
.
tensor
(
dtype
=
x
.
type
.
dtype
,
broadcastable
=
bcast
)])
broadcastable
=
bcast
)])
def
R_op
(
self
,
inputs
,
eval_points
):
if
eval_points
[
0
]
is
None
:
...
...
@@ -1897,13 +1904,11 @@ class AdvancedSubtensor(Op):
if
(
numpy
.
__version__
<=
'1.6.1'
and
out
[
0
]
.
size
!=
numpy
.
uint32
(
out
[
0
]
.
size
)):
warnings
.
warn
(
'Numpy versions 1.6.1 and below have a bug preventing '
'advanced indexing from correctly filling arrays that '
'are too big (>= 2^32 elements). It is possible that '
'out[0] (
%
s), with shape
%
s, is not correctly filled.'
%
(
out
[
0
],
out
[
0
]
.
shape
))
# return
#raise NotImplementedError()
'Numpy versions 1.6.1 and below have a bug preventing '
'advanced indexing from correctly filling arrays that '
'are too big (>= 2^32 elements). It is possible that '
'out[0] (
%
s), with shape
%
s, is not correctly filled.'
%
(
out
[
0
],
out
[
0
]
.
shape
))
def
connection_pattern
(
self
,
node
):
...
...
@@ -1955,8 +1960,9 @@ class AdvancedIncSubtensor(Op):
def
__str__
(
self
):
return
"
%
s{
%
s,
%
s}"
%
(
self
.
__class__
.
__name__
,
"inplace="
+
str
(
self
.
inplace
),
" set_instead_of_inc="
+
str
(
self
.
set_instead_of_inc
))
"inplace="
+
str
(
self
.
inplace
),
" set_instead_of_inc="
+
str
(
self
.
set_instead_of_inc
))
def
make_node
(
self
,
x
,
y
,
*
inputs
):
x
=
theano
.
tensor
.
as_tensor_variable
(
x
)
...
...
@@ -1990,17 +1996,18 @@ class AdvancedIncSubtensor(Op):
op
.
allow_legacy_perform
=
True
else
:
raise
NotImplementedError
(
'Could not import inplace_increment, so some advanced '
'indexing features are disabled. They will be '
'available if you update NumPy to version 1.8 or '
'later, or to the latest development version. '
'You may need to clear the cache (theano-cache clear) '
'afterwards.'
)
'Could not import inplace_increment, so some advanced '
'indexing features are disabled. They will be '
'available if you update NumPy to version 1.8 or '
'later, or to the latest development version. '
'You may need to clear the cache (theano-cache clear) '
'afterwards.'
)
return
gof
.
Apply
(
op
,
(
x
,
y
)
+
inputs
,
[
theano
.
tensor
.
tensor
(
dtype
=
x
.
type
.
dtype
,
broadcastable
=
x
.
type
.
broadcastable
)])
(
x
,
y
)
+
inputs
,
[
theano
.
tensor
.
tensor
(
dtype
=
x
.
type
.
dtype
,
broadcastable
=
x
.
type
.
broadcastable
)])
def
perform
(
self
,
node
,
inputs
,
out_
):
# TODO: 1. opt to make this in place 2. generalize as described in
...
...
@@ -2020,21 +2027,21 @@ class AdvancedIncSubtensor(Op):
out
[
0
][
inputs
[
2
:]]
+=
inputs
[
1
]
else
:
raise
NotImplementedError
(
'Could not import inplace_increment, so some advanced '
'indexing features are disabled. They will be '
'available if you update NumPy to version 1.8 or '
'later, or to the latest development version. '
'You may need to clear the cache (theano-cache clear) '
'afterwards.'
)
'Could not import inplace_increment, so some advanced '
'indexing features are disabled. They will be '
'available if you update NumPy to version 1.8 or '
'later, or to the latest development version. '
'You may need to clear the cache (theano-cache clear) '
'afterwards.'
)
if
(
numpy
.
__version__
<=
'1.6.1'
and
out
[
0
]
.
size
!=
numpy
.
uint32
(
out
[
0
]
.
size
)):
warnings
.
warn
(
'Numpy versions 1.6.1 and below have a bug preventing '
'advanced indexing from correctly filling arrays that '
'are too big (>= 2^32 elements). It is possible that '
'out[0] (
%
s), with shape
%
s, is not correctly filled.'
%
(
out
[
0
],
out
[
0
]
.
shape
))
'Numpy versions 1.6.1 and below have a bug preventing '
'advanced indexing from correctly filling arrays that '
'are too big (>= 2^32 elements). It is possible that '
'out[0] (
%
s), with shape
%
s, is not correctly filled.'
%
(
out
[
0
],
out
[
0
]
.
shape
))
def
infer_shape
(
self
,
node
,
ishapes
):
return
[
ishapes
[
0
]]
...
...
@@ -2092,6 +2099,6 @@ def take(a, indices, axis=None, mode='raise'):
ndim
=
indices
.
ndim
else
:
shape
=
theano
.
tensor
.
concatenate
(
[
a
.
shape
[:
axis
],
indices
.
shape
,
a
.
shape
[
axis
+
1
:]])
[
a
.
shape
[:
axis
],
indices
.
shape
,
a
.
shape
[
axis
+
1
:]])
ndim
=
a
.
ndim
+
indices
.
ndim
-
1
return
take
(
a
,
indices
.
flatten
(),
axis
,
mode
)
.
reshape
(
shape
,
ndim
)
theano/tensor/tests/test_inc_subtensor.py
浏览文件 @
53532957
...
...
@@ -83,11 +83,11 @@ class Test_inc_subtensor(unittest.TestCase):
f
(
rng_randX
(
3
,
1
),
rng_randX
(
1
))
# These ones should not
self
.
assertRaises
(
ValueError
,
f
,
rng_randX
(
3
,
1
),
rng_randX
(
2
))
f
,
rng_randX
(
3
,
1
),
rng_randX
(
2
))
self
.
assertRaises
(
ValueError
,
f
,
rng_randX
(
3
,
1
),
rng_randX
(
3
))
f
,
rng_randX
(
3
,
1
),
rng_randX
(
3
))
self
.
assertRaises
(
ValueError
,
f
,
rng_randX
(
3
,
1
),
rng_randX
(
0
))
f
,
rng_randX
(
3
,
1
),
rng_randX
(
0
))
def
test_simple_3d
(
self
):
"""Increments or sets part of a tensor by a scalar using full slice and
...
...
@@ -100,30 +100,42 @@ class Test_inc_subtensor(unittest.TestCase):
sl2
=
slice
(
sl2_end
)
sl3
=
2
for
do_set
in
[
True
,
False
]:
print
"Set"
,
do_set
val_a
=
numpy
.
ones
((
5
,
3
,
4
))
val_inc
=
2.3
val_sl2_end
=
2
if
do_set
:
resut
=
tt
.
set_subtensor
(
a
[
sl1
,
sl3
,
sl2
],
increment
)
else
:
resut
=
tt
.
inc_subtensor
(
a
[
sl1
,
sl3
,
sl2
],
increment
)
for
method
in
[
tt
.
set_subtensor
,
tt
.
inc_subtensor
]:
print
"MethodSet"
,
method
f
=
theano
.
function
([
a
,
increment
,
sl2_end
],
resu
t
)
resut
=
method
(
a
[
sl1
,
sl3
,
sl2
],
incremen
t
)
val_a
=
numpy
.
ones
((
5
,
3
,
4
))
val_inc
=
2.3
val_sl2_end
=
2
f
=
theano
.
function
([
a
,
increment
,
sl2_end
],
resut
)
expected_result
=
numpy
.
copy
(
val_a
)
result
=
f
(
val_a
,
val_inc
,
val_sl2_end
)
if
do_set
:
if
method
is
tt
.
set_subtensor
:
expected_result
[:,
sl3
,
:
val_sl2_end
]
=
val_inc
else
:
expected_result
[:,
sl3
,
:
val_sl2_end
]
+=
val_inc
utt
.
assert_allclose
(
result
,
expected_result
)
# Test when we broadcast the result
resut
=
method
(
a
[
sl1
,
sl2
],
increment
)
f
=
theano
.
function
([
a
,
increment
,
sl2_end
],
resut
)
expected_result
=
numpy
.
copy
(
val_a
)
result
=
f
(
val_a
,
val_inc
,
val_sl2_end
)
if
method
is
tt
.
set_subtensor
:
expected_result
[:,
:
val_sl2_end
]
=
val_inc
else
:
expected_result
[:,
:
val_sl2_end
]
+=
val_inc
utt
.
assert_allclose
(
result
,
expected_result
)
def
test_grad_inc_set
(
self
):
def
inc_slice
(
*
s
):
def
just_numeric_args
(
a
,
b
):
...
...
@@ -138,19 +150,24 @@ class Test_inc_subtensor(unittest.TestCase):
for
f_slice
in
[
inc_slice
,
set_slice
]:
# vector
utt
.
verify_grad
(
f_slice
(
slice
(
2
,
4
,
None
)),
(
numpy
.
asarray
([
0
,
1
,
2
,
3
,
4
,
5.
]),
numpy
.
asarray
([
9
,
9.
]),
))
f_slice
(
slice
(
2
,
4
,
None
)),
(
numpy
.
asarray
([
0
,
1
,
2
,
3
,
4
,
5.
]),
numpy
.
asarray
([
9
,
9.
]),
))
# matrix
utt
.
verify_grad
(
f_slice
(
slice
(
1
,
2
,
None
),
slice
(
None
,
None
,
None
)),
(
numpy
.
asarray
([[
0
,
1
],
[
2
,
3
],
[
4
,
5.
]]),
numpy
.
asarray
([[
9
,
9.
]]),
))
f_slice
(
slice
(
1
,
2
,
None
),
slice
(
None
,
None
,
None
)),
(
numpy
.
asarray
([[
0
,
1
],
[
2
,
3
],
[
4
,
5.
]]),
numpy
.
asarray
([[
9
,
9.
]]),
))
#single element
#
single element
utt
.
verify_grad
(
f_slice
(
2
,
1
),
(
numpy
.
asarray
([[
0
,
1
],
[
2
,
3
],
[
4
,
5.
]]),
numpy
.
asarray
(
9.
),))
f_slice
(
2
,
1
),
(
numpy
.
asarray
([[
0
,
1
],
[
2
,
3
],
[
4
,
5.
]]),
numpy
.
asarray
(
9.
),))
# broadcast
utt
.
verify_grad
(
f_slice
(
2
),
(
numpy
.
asarray
([[
0
,
1
],
[
2
,
3
],
[
4
,
5.
]]),
numpy
.
asarray
(
9.
),))
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论