Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
6641b3a4
提交
6641b3a4
authored
7月 22, 2011
作者:
Pascal Lamblin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add comments.
上级
0f2196fd
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
19 行增加
和
2 行删除
+19
-2
scan_opt.py
theano/scan_module/scan_opt.py
+19
-2
没有找到文件。
theano/scan_module/scan_opt.py
浏览文件 @
6641b3a4
...
@@ -45,6 +45,15 @@ def info(*msg):
...
@@ -45,6 +45,15 @@ def info(*msg):
@gof.local_optimizer
([
None
])
@gof.local_optimizer
([
None
])
def
remove_constants_and_unused_inputs_scan
(
node
):
def
remove_constants_and_unused_inputs_scan
(
node
):
'''
Move constants into the inner graph, and remove unused inputs.
Constants that are in the outer graph are represented by a free symbolic
variable in the inner graph. If we move them into the inner graph,
constant-folding can happen in the inner graph.
This is applied only on sequences and non-sequences,
not on initial states.
'''
if
not
isinstance
(
node
.
op
,
scan_op
.
Scan
):
if
not
isinstance
(
node
.
op
,
scan_op
.
Scan
):
return
False
return
False
op
=
node
.
op
op
=
node
.
op
...
@@ -54,9 +63,12 @@ def remove_constants_and_unused_inputs_scan(node):
...
@@ -54,9 +63,12 @@ def remove_constants_and_unused_inputs_scan(node):
op
.
tap_array
[:(
op
.
n_mit_mot
+
op
.
n_mit_sot
)]
]))
op
.
tap_array
[:(
op
.
n_mit_mot
+
op
.
n_mit_sot
)]
]))
st
+=
op
.
n_sit_sot
st
+=
op
.
n_sit_sot
st
+=
op
.
n_shared_outs
st
+=
op
.
n_shared_outs
op_ins
,
op_outs
=
scan_utils
.
reconstruct_graph
(
op
.
inputs
,
op
.
outputs
,
op_ins
,
op_outs
=
scan_utils
.
reconstruct_graph
(
op
.
inputs
,
op
.
outputs
)
''
)
# Corresponds to the initial states, which should stay untouched.
# We put those variables aside, and put them back at the end.
out_stuff_inner
=
op_ins
[
op
.
n_seqs
:
st
]
out_stuff_inner
=
op_ins
[
op
.
n_seqs
:
st
]
non_seqs
=
op_ins
[
st
:]
non_seqs
=
op_ins
[
st
:]
st
=
(
op
.
n_seqs
+
st
=
(
op
.
n_seqs
+
op
.
n_mit_mot
+
op
.
n_mit_mot
+
...
@@ -67,9 +79,13 @@ def remove_constants_and_unused_inputs_scan(node):
...
@@ -67,9 +79,13 @@ def remove_constants_and_unused_inputs_scan(node):
outer_non_seqs
=
node
.
inputs
[
st
:]
outer_non_seqs
=
node
.
inputs
[
st
:]
out_stuff_outer
=
node
.
inputs
[
1
+
op
.
n_seqs
:
st
]
out_stuff_outer
=
node
.
inputs
[
1
+
op
.
n_seqs
:
st
]
# To replace constants in the outer graph by clones in the inner graph
givens
=
{}
givens
=
{}
# All the inputs of the inner graph of the new scan
nw_inner
=
[]
nw_inner
=
[]
# Same for the outer graph, initialized w/ number of steps
nw_outer
=
[
node
.
inputs
[
0
]]
nw_outer
=
[
node
.
inputs
[
0
]]
all_ins
=
gof
.
graph
.
inputs
(
op_outs
)
all_ins
=
gof
.
graph
.
inputs
(
op_outs
)
for
idx
in
xrange
(
op
.
n_seqs
):
for
idx
in
xrange
(
op
.
n_seqs
):
if
(
isinstance
(
node
.
inputs
[
idx
+
1
],
tensor
.
TensorConstant
)
and
if
(
isinstance
(
node
.
inputs
[
idx
+
1
],
tensor
.
TensorConstant
)
and
...
@@ -84,6 +100,7 @@ def remove_constants_and_unused_inputs_scan(node):
...
@@ -84,6 +100,7 @@ def remove_constants_and_unused_inputs_scan(node):
elif
op_ins
[
idx
]
in
all_ins
:
elif
op_ins
[
idx
]
in
all_ins
:
nw_inner
+=
[
op_ins
[
idx
]]
nw_inner
+=
[
op_ins
[
idx
]]
nw_outer
+=
[
node
.
inputs
[
idx
+
1
]]
nw_outer
+=
[
node
.
inputs
[
idx
+
1
]]
nw_n_seqs
=
len
(
nw_inner
)
nw_n_seqs
=
len
(
nw_inner
)
# Add outputs stuff
# Add outputs stuff
nw_inner
+=
out_stuff_inner
nw_inner
+=
out_stuff_inner
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论