Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
8ba5f98d
提交
8ba5f98d
authored
3月 22, 2011
作者:
Razvan Pascanu
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
A better implementation of the subtensor subtensor merge optimization
上级
613a642a
显示空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
27 行增加
和
36 行删除
+27
-36
opt.py
theano/tensor/opt.py
+27
-36
没有找到文件。
theano/tensor/opt.py
浏览文件 @
8ba5f98d
...
@@ -1232,50 +1232,39 @@ def merge_two_slices(slice1, len1, slice2, len2):
...
@@ -1232,50 +1232,39 @@ def merge_two_slices(slice1, len1, slice2, len2):
# according to the two steps we have 4 different combinations of
# according to the two steps we have 4 different combinations of
# positive/negative. I will denote the case I'm looking at by
# positive/negative. I will denote the case I'm looking at by
# suffixes to the variables (nn,np,pn,pp):
# suffixes to the variables (nn,np,pn,pp):
pp_start
=
sl1
.
start
+
sl2
.
start
*
sl1
.
step
pp_start
=
sl1
.
start
+
sl2
.
start
pp_stop
=
sl1
.
start
+
sl2
.
stop
*
sl1
.
step
pp_stop
=
sl1
.
start
+
sl2
.
stop
pp_step
=
sl1
.
step
*
sl2
.
step
pp_step
=
sl1
.
step
*
sl2
.
step
pn_st
art
=
sl1
.
start
+
sl2
.
start
pn_st
op
=
sl1
.
start
+
sl2
.
start
*
sl1
.
step
pn_st
op
=
sl1
.
start
+
sl2
.
sto
p
pn_st
art
=
sl1
.
start
+
sl2
.
stop
*
sl1
.
ste
p
pn_step
=
sl1
.
step
*
sl2
.
step
*
-
1
pn_step
=
sl1
.
step
*
sl2
.
step
*
-
1
pn_stop
=
T
.
switch
(
T
.
eq
(
pn_stop
,
-
1
),
-
len1
-
1
,
pn_stop
)
np_st
art
=
sl1
.
stop
-
sl2
.
stop
np_st
op
=
sl1
.
stop
-
sl2
.
stop
*
sl1
.
step
-
1
np_st
op
=
sl1
.
stop
-
sl2
.
start
np_st
art
=
sl1
.
stop
-
sl2
.
start
*
sl1
.
step
-
1
np_step
=
sl1
.
step
*
sl2
.
step
*
-
1
np_step
=
sl1
.
step
*
sl2
.
step
*
-
1
np_stop
=
T
.
switch
(
T
.
eq
(
np_stop
,
-
1
),
-
len1
-
1
,
np_stop
)
nn_start
=
sl1
.
stop
-
sl2
.
start
nn_start
=
sl1
.
stop
-
sl2
.
start
*
sl1
.
step
nn_stop
=
sl1
.
stop
-
sl2
.
stop
nn_stop
=
sl1
.
stop
-
sl2
.
stop
*
sl1
.
step
nn_step
=
sl1
.
step
*
sl2
.
step
nn_step
=
sl1
.
step
*
sl2
.
step
start
=
const_fold
(
T
.
switch
(
T
.
lt
(
reverse2
*
reverse1
,
0
),
T
.
switch
(
T
.
lt
(
reverse1
,
0
),
np_start
,
pn_start
),
T
.
switch
(
T
.
lt
(
reverse1
,
0
),
nn_start
,
pp_start
))
.
owner
)[
0
]
if
reverse1
is
None
and
reverse2
is
None
:
stop
=
const_fold
(
T
.
switch
(
T
.
lt
(
reverse2
*
reverse1
,
0
),
start
=
pp_start
T
.
switch
(
T
.
lt
(
reverse1
,
0
),
np_stop
,
pn_stop
),
stop
=
pp_stop
T
.
switch
(
T
.
lt
(
reverse1
,
0
),
nn_stop
,
pp_stop
step
=
pp_step
))
.
owner
)[
0
]
elif
reverse1
is
not
None
and
reverse2
is
None
:
start
=
T
.
switch
(
lt
(
reverse1
,
0
),
np_start
,
pp_start
)
stop
=
T
.
switch
(
lt
(
reverse1
,
0
),
np_stop
,
pp_stop
)
step
=
T
.
switch
(
lt
(
reverse1
,
0
),
np_step
,
pp_step
)
elif
reverse1
is
None
and
reverse2
is
not
None
:
start
=
T
.
switch
(
lt
(
reverse2
,
0
),
pn_start
,
pp_start
)
stop
=
T
.
switch
(
lt
(
reverse2
,
0
),
pn_stop
,
pp_stop
)
step
=
T
.
switch
(
lt
(
reverse2
,
0
),
pn_step
,
pp_step
)
else
:
start
=
T
.
switch
(
lt
(
reverse2
*
reverse1
,
0
),
T
.
switch
(
lt
(
reverse1
,
0
),
np_start
,
pn_start
),
T
.
switch
(
lt
(
reverse1
,
0
),
nn_start
,
pp_start
))
stop
=
T
.
switch
(
lt
(
reverse2
*
reverse1
,
0
),
T
.
switch
(
lt
(
reverse1
,
0
),
np_stop
,
pn_stop
),
T
.
switch
(
lt
(
reverse1
,
0
),
nn_stop
,
pp_stop
))
step
=
T
.
switch
(
lt
(
reverse2
*
reverse1
,
0
),
T
.
switch
(
lt
(
reverse1
,
0
),
np_step
,
pn_step
),
T
.
switch
(
lt
(
reverse1
,
0
),
nn_step
,
pp_step
))
return
slice
(
start
,
stop
,
step
)
step
=
const_fold
(
T
.
switch
(
T
.
lt
(
reverse2
*
reverse1
,
0
),
T
.
switch
(
T
.
lt
(
reverse1
,
0
),
np_step
,
pn_step
),
T
.
switch
(
T
.
lt
(
reverse1
,
0
),
nn_step
,
pp_step
))
.
owner
)[
0
]
return
slice
(
start
,
stop
,
step
)
@register_canonicalize
@register_canonicalize
@register_specialize
@register_specialize
...
@@ -1314,8 +1303,8 @@ def local_subtensor_merge(node):
...
@@ -1314,8 +1303,8 @@ def local_subtensor_merge(node):
if
type
(
slice1
)
is
slice
:
if
type
(
slice1
)
is
slice
:
merged_slices
.
append
(
merged_slices
.
append
(
merge_two_slices
(
slice1
,
merge_two_slices
(
slice1
,
slices2
[
pos_2
],
xshape
[
pos_1
],
xshape
[
pos_1
],
slices2
[
pos_2
],
ushape
[
pos_2
]))
ushape
[
pos_2
]))
pos_2
+=
1
pos_2
+=
1
else
:
else
:
...
@@ -1326,7 +1315,9 @@ def local_subtensor_merge(node):
...
@@ -1326,7 +1315,9 @@ def local_subtensor_merge(node):
sl_ins
=
T
.
Subtensor
.
collapse
(
sl_ins
=
T
.
Subtensor
.
collapse
(
merged_slices
,
merged_slices
,
lambda
x
:
isinstance
(
x
,
T
.
Variable
))
lambda
x
:
isinstance
(
x
,
T
.
Variable
))
return
[
subtens
.
make_node
(
node
.
inputs
[
0
],
*
sl_ins
)
.
outputs
[
0
]]
out
=
subtens
.
make_node
(
x
,
*
sl_ins
)
.
outputs
[
0
]
return
[
out
]
@register_canonicalize
@register_canonicalize
@gof.local_optimizer
([
None
])
@gof.local_optimizer
([
None
])
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论