Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
3668e8ba
提交
3668e8ba
authored
3月 31, 2009
作者:
James Bergstra
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fixed bug in canonize related to output type-matching. added fill_chain…
fixed bug in canonize related to output type-matching. added fill_chain function. fixed local_mul_specialize too
上级
0696f748
显示空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
22 行增加
和
19 行删除
+22
-19
basic.py
theano/tensor/basic.py
+1
-1
opt.py
theano/tensor/opt.py
+21
-18
没有找到文件。
theano/tensor/basic.py
浏览文件 @
3668e8ba
...
@@ -252,7 +252,7 @@ class TensorType(Type):
...
@@ -252,7 +252,7 @@ class TensorType(Type):
def
__hash__
(
self
):
def
__hash__
(
self
):
"""Hash equal for same kinds of TensorType"""
"""Hash equal for same kinds of TensorType"""
return
hash
(
self
.
dtype
)
^
hash
(
self
.
broadcastable
)
return
hash
(
type
(
self
))
^
hash
(
self
.
dtype
)
^
hash
(
self
.
broadcastable
)
ndim
=
property
(
lambda
self
:
len
(
self
.
broadcastable
),
doc
=
"number of dimensions"
)
ndim
=
property
(
lambda
self
:
len
(
self
.
broadcastable
),
doc
=
"number of dimensions"
)
"""Number of dimensions
"""Number of dimensions
...
...
theano/tensor/opt.py
浏览文件 @
3668e8ba
...
@@ -34,6 +34,11 @@ def in2out(*local_opts, **kwargs):
...
@@ -34,6 +34,11 @@ def in2out(*local_opts, **kwargs):
failure_callback
=
TopoOptimizer
.
warn_inplace
,
failure_callback
=
TopoOptimizer
.
warn_inplace
,
**
kwargs
)
**
kwargs
)
def
_fill_chain
(
new_out
,
orig_inputs
):
for
i
in
orig_inputs
:
new_out
=
T
.
fill
(
i
,
new_out
)
return
[
new_out
]
@gof.optimizer
@gof.optimizer
...
@@ -692,9 +697,6 @@ class Canonizer(gof.LocalOptimizer):
...
@@ -692,9 +697,6 @@ class Canonizer(gof.LocalOptimizer):
elif
op
==
self
.
reciprocal
:
elif
op
==
self
.
reciprocal
:
reorg
=
len
(
iops
.
intersection
([
self
.
inverse
,
self
.
reciprocal
]))
!=
0
reorg
=
len
(
iops
.
intersection
([
self
.
inverse
,
self
.
reciprocal
]))
!=
0
# just in case
assert
len
(
node
.
outputs
)
==
1
# 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
])
...
@@ -715,17 +717,16 @@ class Canonizer(gof.LocalOptimizer):
...
@@ -715,17 +717,16 @@ class Canonizer(gof.LocalOptimizer):
elem_op
=
T
.
Elemwise
(
scalar
.
Identity
(
scalar
.
specific_out
(
getattr
(
scalar
,
out
.
type
.
dtype
))))
elem_op
=
T
.
Elemwise
(
scalar
.
Identity
(
scalar
.
specific_out
(
getattr
(
scalar
,
out
.
type
.
dtype
))))
new
=
elem_op
(
new
)
new
=
elem_op
(
new
)
if
new
.
type
!=
out
.
type
:
assert
(
new
.
type
==
out
.
type
)
==
(
not
(
new
.
type
!=
out
.
type
))
for
x
in
orig_num
+
orig_denum
:
if
x
.
type
==
out
.
type
:
if
not
(
new
.
type
==
out
.
type
):
new
=
T
.
fill
(
x
,
new
)
new
=
_fill_chain
(
new
,
node
.
inputs
)[
0
]
break
if
new
.
type
!=
out
.
type
:
if
new
.
type
==
out
.
type
:
return
[
new
]
else
:
print
>>
sys
.
stderr
,
'CANONIZE FAILED: new, out = '
,
new
,
','
,
out
,
'types'
,
new
.
type
,
','
,
out
.
type
print
>>
sys
.
stderr
,
'CANONIZE FAILED: new, out = '
,
new
,
','
,
out
,
'types'
,
new
.
type
,
','
,
out
.
type
return
False
return
False
else
:
return
[
new
]
def
__str__
(
self
):
def
__str__
(
self
):
return
getattr
(
self
,
'name'
,
'Canonizer(
%
s,
%
s,
%
s)'
%
(
self
.
main
,
self
.
inverse
,
self
.
reciprocal
))
return
getattr
(
self
,
'name'
,
'Canonizer(
%
s,
%
s,
%
s)'
%
(
self
.
main
,
self
.
inverse
,
self
.
reciprocal
))
...
@@ -817,6 +818,8 @@ register_specialize(local_pow_specialize)
...
@@ -817,6 +818,8 @@ register_specialize(local_pow_specialize)
@gof.local_optimizer
([
T
.
mul
])
@gof.local_optimizer
([
T
.
mul
])
def
local_mul_specialize
(
node
):
def
local_mul_specialize
(
node
):
def
fill_chain
(
v
):
return
_fill_chain
(
v
,
node
.
inputs
)
#here, we are past the point of canonicalization, so we don't want to put in un-necessary fills.
#here, we are past the point of canonicalization, so we don't want to put in un-necessary fills.
if
node
.
op
==
T
.
mul
:
if
node
.
op
==
T
.
mul
:
#the idea here is that we have pow(x, y)
#the idea here is that we have pow(x, y)
...
@@ -829,20 +832,20 @@ def local_mul_specialize(node):
...
@@ -829,20 +832,20 @@ def local_mul_specialize(node):
elif
N
.
all
(
y
==
-
1.0
):
elif
N
.
all
(
y
==
-
1.0
):
neg
^=
True
#toggles
neg
^=
True
#toggles
elif
N
.
all
(
y
==
0.0
):
elif
N
.
all
(
y
==
0.0
):
return
[
input
]
return
fill_chain
(
input
)
else
:
else
:
new_inputs
.
append
(
input
)
new_inputs
.
append
(
input
)
if
len
(
new_inputs
)
<
len
(
node
.
inputs
):
if
len
(
new_inputs
)
<
len
(
node
.
inputs
):
if
len
(
new_inputs
)
==
0
:
if
len
(
new_inputs
)
==
0
:
newval
=
-
y
.
flatten
()[
0
]
if
neg
else
y
.
flatten
()[
0
]
newval
=
-
y
.
flatten
()[
0
]
if
neg
else
y
.
flatten
()[
0
]
return
[
T
.
TensorConstant
(
T
.
TensorType
(
dtype
=
node
.
outputs
[
0
]
.
type
.
dtype
,
return
fill_chain
(
T
.
TensorConstant
(
T
.
TensorType
(
dtype
=
node
.
outputs
[
0
]
.
type
.
dtype
,
broadcastable
=
[
True
]
*
node
.
outputs
[
0
]
.
ndim
),
N
.
asarray
(
newval
))
]
broadcastable
=
[
True
]
*
node
.
outputs
[
0
]
.
ndim
),
N
.
asarray
(
newval
))
)
if
len
(
new_inputs
)
==
1
:
if
len
(
new_inputs
)
==
1
:
return
[
-
new_inputs
[
0
]]
if
neg
else
new_inputs
return
fill_chain
(
-
new_inputs
[
0
]
if
neg
else
new_inputs
[
0
])
else
:
else
:
return
[
-
T
.
mul
(
*
new_inputs
)]
if
neg
else
\
return
fill_chain
(
-
T
.
mul
(
*
new_inputs
)
if
neg
else
\
[
T
.
mul
(
*
new_inputs
)]
T
.
mul
(
*
new_inputs
))
else
:
else
:
return
False
return
False
register_specialize
(
local_mul_specialize
)
register_specialize
(
local_mul_specialize
)
...
@@ -985,7 +988,7 @@ def local_greedy_distributor(node):
...
@@ -985,7 +988,7 @@ def local_greedy_distributor(node):
rval
=
local_mul_canonizer
.
merge_num_denum
(
new_num
,
new_denum
)
rval
=
local_mul_canonizer
.
merge_num_denum
(
new_num
,
new_denum
)
if
rval
.
type
!=
out
.
type
:
if
not
(
rval
.
type
==
out
.
type
):
#WHY DOES THIS HAPPEN?
#WHY DOES THIS HAPPEN?
return
False
return
False
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论