Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
8d6ff922
提交
8d6ff922
authored
11月 13, 2015
作者:
Iulian Vlad Serban
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Further work on #3018.
上级
0294429e
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
29 行增加
和
35 行删除
+29
-35
opt.py
theano/tensor/opt.py
+29
-21
test_opt.py
theano/tensor/tests/test_opt.py
+0
-14
没有找到文件。
theano/tensor/opt.py
浏览文件 @
8d6ff922
...
@@ -1852,7 +1852,6 @@ def local_subtensor_make_vector(node):
...
@@ -1852,7 +1852,6 @@ def local_subtensor_make_vector(node):
except
IndexError
:
except
IndexError
:
raise
NotScalarConstantError
(
"Bad user graph!"
)
raise
NotScalarConstantError
(
"Bad user graph!"
)
# Copy over stack trace from previous output to new output
return
ret
return
ret
except
NotScalarConstantError
:
except
NotScalarConstantError
:
pass
pass
...
@@ -1998,12 +1997,13 @@ def local_alloc_unary(node):
...
@@ -1998,12 +1997,13 @@ def local_alloc_unary(node):
x
=
a
.
owner
.
inputs
[
0
]
x
=
a
.
owner
.
inputs
[
0
]
shp
=
a
.
owner
.
inputs
[
1
:]
shp
=
a
.
owner
.
inputs
[
1
:]
v
=
node
.
op
(
x
)
v
=
node
.
op
(
x
)
# T.alloc does not preserve the stacktrace of v,
# so we need to copy it over from x.
copy_stack_trace
(
node
.
outputs
[
0
],
v
)
copy_stack_trace
(
node
.
outputs
[
0
],
v
)
ret
=
T
.
alloc
(
T
.
cast
(
v
,
node
.
outputs
[
0
]
.
dtype
),
*
shp
)
ret
=
T
.
alloc
(
T
.
cast
(
v
,
node
.
outputs
[
0
]
.
dtype
),
*
shp
)
# Is it really necessary to copy over stack trace here?
# T.cast does not preserve the stacktrace of x,
# after all, T.alloc and T.cast should preserve the stack trace from x,
# so we need to copy it over to the output.
# but perhaps the trace is lost in "v = node.op(x)"?
copy_stack_trace
([
node
.
outputs
[
0
],
a
],
ret
)
copy_stack_trace
([
node
.
outputs
[
0
],
a
],
ret
)
return
[
ret
]
return
[
ret
]
...
@@ -2851,7 +2851,6 @@ def local_subtensor_merge(node):
...
@@ -2851,7 +2851,6 @@ def local_subtensor_merge(node):
@register_specialize
@register_specialize
@gof.local_optimizer
([
Subtensor
])
@gof.local_optimizer
([
Subtensor
])
def
local_subtensor_of_alloc
(
node
):
def
local_subtensor_of_alloc
(
node
):
#TODO Julian: Document this better!
"""alloc[x:y] -> alloc"""
"""alloc[x:y] -> alloc"""
if
not
isinstance
(
node
.
op
,
Subtensor
):
if
not
isinstance
(
node
.
op
,
Subtensor
):
return
False
return
False
...
@@ -3044,8 +3043,7 @@ def local_IncSubtensor_serialize(node):
...
@@ -3044,8 +3043,7 @@ def local_IncSubtensor_serialize(node):
tip
=
mi
.
owner
.
op
(
tip
,
*
mi
.
owner
.
inputs
[
1
:])
tip
=
mi
.
owner
.
op
(
tip
,
*
mi
.
owner
.
inputs
[
1
:])
# Copy over stacktrace from outputs of the original
# Copy over stacktrace from outputs of the original
# "movable" operation to the new operation.
# "movable" operation to the new operation.
# Julian: Do we want to also include the stacktace of the output (node.outputs[0])?
copy_stack_trace
(
node
.
outputs
+
mi
.
owner
.
outputs
,
tip
)
copy_stack_trace
(
mi
.
owner
.
outputs
,
tip
)
return
[
tip
]
return
[
tip
]
...
@@ -3077,9 +3075,8 @@ def local_inplace_setsubtensor(node):
...
@@ -3077,9 +3075,8 @@ def local_inplace_setsubtensor(node):
destroyhandler_tolerate_aliased
=
dta
)
destroyhandler_tolerate_aliased
=
dta
)
new_node
=
new_op
(
*
node
.
inputs
)
new_node
=
new_op
(
*
node
.
inputs
)
# Copy stacktrace from original outputs to new outputs.
# Copy stacktrace from original outputs to new outputs.
# This should be sensible, because the new operation is the
# This is sensible, because the new operation is the
# same as the old one, but now with different attributes?
# same as the old one, but now with different attributes.
# Julian: Pascal, is this correct?
copy_stack_trace
(
node
.
outputs
,
new_node
)
copy_stack_trace
(
node
.
outputs
,
new_node
)
return
[
new_node
]
return
[
new_node
]
return
False
return
False
...
@@ -3101,9 +3098,8 @@ def local_inplace_incsubtensor1(node):
...
@@ -3101,9 +3098,8 @@ def local_inplace_incsubtensor1(node):
new_node
=
new_op
(
*
node
.
inputs
)
new_node
=
new_op
(
*
node
.
inputs
)
# Copy stacktrace from original outputs to new outputs.
# Copy stacktrace from original outputs to new outputs.
# This should be sensible, because the new operation is the
# This is sensible, because the new operation is the
# same as the old one, but now with different attributes?
# same as the old one, but now with different attributes.
# Julian: same as above, is this correct?
copy_stack_trace
(
node
.
outputs
,
new_node
)
copy_stack_trace
(
node
.
outputs
,
new_node
)
return
[
new_node
]
return
[
new_node
]
return
False
return
False
...
@@ -3525,14 +3521,19 @@ def local_join_empty(node):
...
@@ -3525,14 +3521,19 @@ def local_join_empty(node):
if
ret
.
dtype
!=
o
.
dtype
:
if
ret
.
dtype
!=
o
.
dtype
:
# Join can upcast some inputs
# Join can upcast some inputs
return
return
# Copy over stacktrace from previous output (after join op)
# to new output, because an error in the new op must be caused
# by an error in the old join op.
copy_stack_trace
(
node
.
outputs
,
ret
)
if
ret
.
type
!=
o
.
type
:
if
ret
.
type
!=
o
.
type
:
assert
ret
.
dtype
==
o
.
dtype
assert
ret
.
dtype
==
o
.
dtype
assert
ret
.
ndim
==
o
.
ndim
assert
ret
.
ndim
==
o
.
ndim
ret
=
T
.
patternbroadcast
(
ret
,
node
.
outputs
[
0
]
.
broadcastable
)
ret
=
T
.
patternbroadcast
(
ret
,
node
.
outputs
[
0
]
.
broadcastable
)
# Copy over stacktrace from previous output (after join op)
# Copy over stacktrace from previous output
# to new output, because an error in the new op must be caused
# (after patternbroadcast op) for same reasons as before.
# by an error in the old join op.
copy_stack_trace
(
node
.
outputs
,
ret
)
copy_stack_trace
(
node
.
outputs
,
ret
)
return
[
ret
]
return
[
ret
]
...
@@ -3609,21 +3610,28 @@ def local_useless_switch(node):
...
@@ -3609,21 +3610,28 @@ def local_useless_switch(node):
return
False
return
False
if
correct_out
.
dtype
!=
node
.
outputs
[
0
]
.
dtype
:
if
correct_out
.
dtype
!=
node
.
outputs
[
0
]
.
dtype
:
out
=
T
.
cast
(
correct_out
,
node
.
outputs
[
0
]
.
dtype
)
out
=
T
.
cast
(
correct_out
,
node
.
outputs
[
0
]
.
dtype
)
if
correct_out
.
type
.
broadcastable
!=
node
.
outputs
[
0
]
.
type
.
broadcastable
:
# We need to copy data to the new dimensions during execution
out
=
T
.
alloc
(
correct_out
,
*
[
node
.
outputs
[
0
]
.
shape
[
i
]
for
i
in
xrange
(
correct_out
.
ndim
)])
else
:
else
:
out
=
correct_out
out
=
correct_out
if
out
.
type
.
broadcastable
!=
node
.
outputs
[
0
]
.
type
.
broadcastable
:
# We need to copy data to the new dimensions during execution
out
=
T
.
alloc
(
out
,
*
[
node
.
outputs
[
0
]
.
shape
[
i
]
for
i
in
xrange
(
out
.
ndim
)])
else
:
out
=
out
# Copy over stacktrace from selected output to new output
# Copy over stacktrace from selected output to new output
copy_stack_trace
(
node
.
outputs
+
correct_out
,
out
)
copy_stack_trace
(
node
.
outputs
+
correct_out
,
out
)
return
[
out
]
return
[
out
]
# if left is right -> left
# if left is right -> left
if
node
.
inputs
[
1
]
is
node
.
inputs
[
2
]:
if
node
.
inputs
[
1
]
is
node
.
inputs
[
2
]:
# Note: No need to copy over stacktrace, because the input node
# already has its own stacktrace
if
cond
.
type
==
node
.
inputs
[
1
]
.
type
:
if
cond
.
type
==
node
.
inputs
[
1
]
.
type
:
return
[
node
.
inputs
[
1
]]
return
[
node
.
inputs
[
1
]]
ret
=
T
.
fill
(
cond
,
node
.
inputs
[
1
])
ret
=
T
.
fill
(
cond
,
node
.
inputs
[
1
])
# Copy over stacktrace from switch output and correct branch
# Copy over stacktrace from switch output and correct branch
copy_stack_trace
(
node
.
outputs
+
node
.
inputs
[
1
],
ret
)
copy_stack_trace
(
node
.
outputs
+
node
.
inputs
[
1
],
ret
)
return
[
ret
]
return
[
ret
]
...
...
theano/tensor/tests/test_opt.py
浏览文件 @
8d6ff922
...
@@ -5750,20 +5750,6 @@ def test_local_join_empty():
...
@@ -5750,20 +5750,6 @@ def test_local_join_empty():
assert
all
([
not
isinstance
(
n
.
op
,
Join
)
or
len
(
n
.
inputs
)
==
4
assert
all
([
not
isinstance
(
n
.
op
,
Join
)
or
len
(
n
.
inputs
)
==
4
for
n
in
e
if
isinstance
(
n
.
op
,
Join
)])
for
n
in
e
if
isinstance
(
n
.
op
,
Join
)])
assert
f
.
maker
.
fgraph
.
outputs
[
0
]
.
dtype
==
config
.
floatX
assert
f
.
maker
.
fgraph
.
outputs
[
0
]
.
dtype
==
config
.
floatX
# Julian: we can enable the following test, once we
# remove default optimizations.
# When we set optimizer=None, no optimizations should be applied,
# but that's not the case now...
# test that optimizations keep stack trace
#mode = theano.compile.mode.Mode(optimizer=None).including('canonicalize_db').including("local_join_empty")
#empty_mat = numpy.asarray([[]], dtype=config.floatX)
#m = tensor.matrix('m')
#s = join(1, empty_mat, m, m, m)
#f = function([m], s, mode=mode)
#assert hasattr(f.outputs[0].variable.tag, 'trace')
#assert len(f.outputs[0].variable.tag.trace) > 0
def
test_local_join_make_vector
():
def
test_local_join_make_vector
():
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论