Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
8161bf9b
提交
8161bf9b
authored
10月 07, 2009
作者:
Frederic Bastien
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
some improvement to Canonizer when their is DimShuffle.
上级
f784c7b5
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
20 行增加
和
0 行删除
+20
-0
opt.py
theano/tensor/opt.py
+20
-0
没有找到文件。
theano/tensor/opt.py
浏览文件 @
8161bf9b
...
@@ -547,6 +547,14 @@ class Canonizer(gof.LocalOptimizer):
...
@@ -547,6 +547,14 @@ class Canonizer(gof.LocalOptimizer):
# the dtype of the 'input' argument. The leaf-Variables of the graph covered by the
# the dtype of the 'input' argument. The leaf-Variables of the graph covered by the
# recursion may be of any Variable type.
# recursion may be of any Variable type.
if
len
(
input
.
clients
)
>
1
:
# this logic is too conservative, but doing it is better than not doing it.
#
# we don't want to canonize a subgraph that we will need to compute anyway for the other clients.
# This check is too conservative because if the other clients are also in the subgraph we are canonizing,
# then we should [probably?] recurse anyway.
return
[
input
],
[]
if
input
.
owner
is
None
or
input
.
owner
.
op
not
in
[
self
.
main
,
self
.
inverse
,
self
.
reciprocal
]:
if
input
.
owner
is
None
or
input
.
owner
.
op
not
in
[
self
.
main
,
self
.
inverse
,
self
.
reciprocal
]:
if
input
.
owner
and
isinstance
(
input
.
owner
.
op
,
T
.
DimShuffle
):
if
input
.
owner
and
isinstance
(
input
.
owner
.
op
,
T
.
DimShuffle
):
# If input is a DimShuffle of some input which does something like this:
# If input is a DimShuffle of some input which does something like this:
...
@@ -778,6 +786,18 @@ class Canonizer(gof.LocalOptimizer):
...
@@ -778,6 +786,18 @@ class Canonizer(gof.LocalOptimizer):
out
=
node
.
outputs
[
0
]
out
=
node
.
outputs
[
0
]
assert
len
(
node
.
outputs
)
==
1
assert
len
(
node
.
outputs
)
==
1
# check if any of the clients of this node would be part of this canonized graph...
# if so, we do nothing and wait for them to be transformed.
def
_bypass_dimshuffle
(
n
):
if
isinstance
(
n
.
op
,
DimShuffle
)
and
len
(
n
.
outputs
[
0
]
.
clients
)
<=
1
:
return
_bypass_dimshuffle
(
n
.
outputs
[
0
]
.
clients
.
__iter__
()
.
next
()[
0
])
else
:
return
n
for
c
,
c_idx
in
out
.
clients
:
if
c
==
'output'
:
continue
if
_bypass_dimshuffle
(
c
)
.
op
in
[
self
.
main
,
self
.
inverse
,
self
.
reciprocal
]:
return
False
# Here we make the canonical version of the graph around this node
# Here we make the canonical version of the graph around this node
# See the documentation of get_num_denum and simplify
# See the documentation of get_num_denum and simplify
orig_num
,
orig_denum
=
self
.
get_num_denum
(
node
.
outputs
[
0
])
orig_num
,
orig_denum
=
self
.
get_num_denum
(
node
.
outputs
[
0
])
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论