Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
67e5e2eb
提交
67e5e2eb
authored
9月 12, 2016
作者:
Frédéric Bastien
提交者:
GitHub
9月 12, 2016
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #4958 from nouiz/opt_speedup
Lower the number of iteration for local_add_mul_fusion
上级
3284771f
06d83438
隐藏空白字符变更
内嵌
并排
正在显示
6 个修改的文件
包含
65 行增加
和
28 行删除
+65
-28
dnn.py
theano/gpuarray/dnn.py
+3
-0
dnn.py
theano/sandbox/cuda/dnn.py
+4
-0
basic.py
theano/tensor/basic.py
+28
-13
opt.py
theano/tensor/opt.py
+21
-7
subtensor.py
theano/tensor/subtensor.py
+3
-2
test_opt.py
theano/tensor/tests/test_opt.py
+6
-6
没有找到文件。
theano/gpuarray/dnn.py
浏览文件 @
67e5e2eb
...
@@ -1005,6 +1005,9 @@ class GpuDnnPoolDesc(Op):
...
@@ -1005,6 +1005,9 @@ class GpuDnnPoolDesc(Op):
pad : tuple
pad : tuple
(padX, padY) or (padX, padY, padZ)
(padX, padY) or (padX, padY, padZ)
Note
----
Not used anymore. Only needed to reload old pickled files.
"""
"""
__props__
=
(
'ws'
,
'stride'
,
'mode'
,
'pad'
)
__props__
=
(
'ws'
,
'stride'
,
'mode'
,
'pad'
)
...
...
theano/sandbox/cuda/dnn.py
浏览文件 @
67e5e2eb
...
@@ -1365,6 +1365,10 @@ class GpuDnnPoolDesc(GpuOp):
...
@@ -1365,6 +1365,10 @@ class GpuDnnPoolDesc(GpuOp):
pad_w is the number of zero-valued pixels added to each of the left and
pad_w is the number of zero-valued pixels added to each of the left and
right borders.
right borders.
Note
----
Not used anymore. Only needed to reload old pickled files.
"""
"""
__props__
=
(
'ws'
,
'stride'
,
'mode'
,
'pad'
)
__props__
=
(
'ws'
,
'stride'
,
'mode'
,
'pad'
)
...
...
theano/tensor/basic.py
浏览文件 @
67e5e2eb
...
@@ -576,7 +576,8 @@ get_scalar_constant_value_elemwises = (
...
@@ -576,7 +576,8 @@ get_scalar_constant_value_elemwises = (
def
get_scalar_constant_value
(
orig_v
,
elemwise
=
True
,
def
get_scalar_constant_value
(
orig_v
,
elemwise
=
True
,
only_process_constants
=
False
):
only_process_constants
=
False
,
max_recur
=
10
):
"""Return the constant scalar(0-D) value underlying variable `v`.
"""Return the constant scalar(0-D) value underlying variable `v`.
If `v` is the output of dimshuffles, fills, allocs, rebroadcasts,
If `v` is the output of dimshuffles, fills, allocs, rebroadcasts,
...
@@ -596,6 +597,8 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -596,6 +597,8 @@ def get_scalar_constant_value(orig_v, elemwise=True,
If True, we only attempt to obtain the value of `orig_v` if it's
If True, we only attempt to obtain the value of `orig_v` if it's
directly constant and don't try to dig through dimshuffles, fills,
directly constant and don't try to dig through dimshuffles, fills,
allocs, and other to figure out its value.
allocs, and other to figure out its value.
max_recur : int
The maximum number of recursion.
Notes
Notes
-----
-----
...
@@ -623,7 +626,10 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -623,7 +626,10 @@ def get_scalar_constant_value(orig_v, elemwise=True,
data
=
v
.
data
data
=
v
.
data
return
numpy_scalar
(
data
)
.
copy
()
return
numpy_scalar
(
data
)
.
copy
()
if
not
only_process_constants
and
getattr
(
v
,
'owner'
,
None
):
if
(
not
only_process_constants
and
getattr
(
v
,
'owner'
,
None
)
and
max_recur
>
0
):
max_recur
-=
1
if
isinstance
(
v
.
owner
.
op
,
(
Alloc
,
DimShuffle
,
Rebroadcast
,
if
isinstance
(
v
.
owner
.
op
,
(
Alloc
,
DimShuffle
,
Rebroadcast
,
compile
.
ops
.
OutputGuard
,
compile
.
ops
.
OutputGuard
,
compile
.
DeepCopyOp
)):
compile
.
DeepCopyOp
)):
...
@@ -645,7 +651,8 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -645,7 +651,8 @@ def get_scalar_constant_value(orig_v, elemwise=True,
# We put all the scalar Ops used by get_canonical_form_slice()
# We put all the scalar Ops used by get_canonical_form_slice()
# to allow it to determine the broadcast pattern correctly.
# to allow it to determine the broadcast pattern correctly.
elif
isinstance
(
v
.
owner
.
op
,
(
ScalarFromTensor
,
TensorFromScalar
)):
elif
isinstance
(
v
.
owner
.
op
,
(
ScalarFromTensor
,
TensorFromScalar
)):
return
get_scalar_constant_value
(
v
.
owner
.
inputs
[
0
])
v
=
v
.
owner
.
inputs
[
0
]
continue
elif
isinstance
(
v
.
owner
.
op
,
scal
.
ScalarOp
):
elif
isinstance
(
v
.
owner
.
op
,
scal
.
ScalarOp
):
if
isinstance
(
v
.
owner
.
op
,
scal
.
Second
):
if
isinstance
(
v
.
owner
.
op
,
scal
.
Second
):
# We don't need both input to be constant for second
# We don't need both input to be constant for second
...
@@ -653,7 +660,7 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -653,7 +660,7 @@ def get_scalar_constant_value(orig_v, elemwise=True,
v
=
val
v
=
val
continue
continue
if
isinstance
(
v
.
owner
.
op
,
get_scalar_constant_value_elemwises
):
if
isinstance
(
v
.
owner
.
op
,
get_scalar_constant_value_elemwises
):
const
=
[
get_scalar_constant_value
(
i
)
const
=
[
get_scalar_constant_value
(
i
,
max_recur
=
max_recur
)
for
i
in
v
.
owner
.
inputs
]
for
i
in
v
.
owner
.
inputs
]
ret
=
[[
None
]]
ret
=
[[
None
]]
v
.
owner
.
op
.
perform
(
v
.
owner
,
const
,
ret
)
v
.
owner
.
op
.
perform
(
v
.
owner
,
const
,
ret
)
...
@@ -670,7 +677,7 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -670,7 +677,7 @@ def get_scalar_constant_value(orig_v, elemwise=True,
elif
elemwise
and
isinstance
(
elif
elemwise
and
isinstance
(
v
.
owner
.
op
.
scalar_op
,
v
.
owner
.
op
.
scalar_op
,
get_scalar_constant_value_elemwises
):
get_scalar_constant_value_elemwises
):
const
=
[
get_scalar_constant_value
(
i
)
const
=
[
get_scalar_constant_value
(
i
,
max_recur
=
max_recur
)
for
i
in
v
.
owner
.
inputs
]
for
i
in
v
.
owner
.
inputs
]
ret
=
[[
None
]]
ret
=
[[
None
]]
v
.
owner
.
op
.
perform
(
v
.
owner
,
const
,
ret
)
v
.
owner
.
op
.
perform
(
v
.
owner
,
const
,
ret
)
...
@@ -705,27 +712,33 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -705,27 +712,33 @@ def get_scalar_constant_value(orig_v, elemwise=True,
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
1
:]):
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
1
:]):
idx
=
v
.
owner
.
op
.
idx_list
[
0
]
idx
=
v
.
owner
.
op
.
idx_list
[
0
]
if
isinstance
(
idx
,
gof
.
Type
):
if
isinstance
(
idx
,
gof
.
Type
):
idx
=
get_scalar_constant_value
(
v
.
owner
.
inputs
[
1
])
idx
=
get_scalar_constant_value
(
v
.
owner
.
inputs
[
1
],
max_recur
=
max_recur
)
# Note the '+ 1' is because the first argument to Join
# Note the '+ 1' is because the first argument to Join
# is the axis.
# is the axis.
ret
=
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
idx
+
1
]
ret
=
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
idx
+
1
]
ret
=
get_scalar_constant_value
(
ret
)
ret
=
get_scalar_constant_value
(
ret
,
max_recur
=
max_recur
)
# join can cast implicitly its input in some case.
# join can cast implicitly its input in some case.
return
theano
.
_asarray
(
ret
,
dtype
=
v
.
type
.
dtype
)
return
theano
.
_asarray
(
ret
,
dtype
=
v
.
type
.
dtype
)
if
python_all
(
var
.
ndim
==
1
for
var
in
if
python_all
(
var
.
ndim
==
1
for
var
in
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
1
:]):
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
1
:]):
idx
=
v
.
owner
.
op
.
idx_list
[
0
]
idx
=
v
.
owner
.
op
.
idx_list
[
0
]
if
isinstance
(
idx
,
gof
.
Type
):
if
isinstance
(
idx
,
gof
.
Type
):
idx
=
get_scalar_constant_value
(
v
.
owner
.
inputs
[
1
])
idx
=
get_scalar_constant_value
(
v
.
owner
.
inputs
[
1
],
max_recur
=
max_recur
)
try
:
try
:
# TODO: assert joined axis is 0.
# TODO: assert joined axis is 0.
length
=
0
length
=
0
loop
=
False
for
joined
in
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
1
:]:
for
joined
in
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
1
:]:
ll
=
get_vector_length
(
joined
)
ll
=
get_vector_length
(
joined
)
if
idx
<
length
+
ll
:
if
idx
<
length
+
ll
:
return
get_scalar_constant_value
(
v
=
joined
[
idx
-
length
]
joined
[
idx
-
length
])
loop
=
True
break
length
+=
ll
length
+=
ll
if
loop
:
continue
except
TypeError
:
except
TypeError
:
pass
pass
except
ValueError
:
except
ValueError
:
...
@@ -742,12 +755,13 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -742,12 +755,13 @@ def get_scalar_constant_value(orig_v, elemwise=True,
idx
=
v
.
owner
.
op
.
idx_list
[
0
]
idx
=
v
.
owner
.
op
.
idx_list
[
0
]
if
isinstance
(
idx
,
gof
.
Type
):
if
isinstance
(
idx
,
gof
.
Type
):
idx
=
get_scalar_constant_value
(
v
.
owner
.
inputs
[
1
])
idx
=
get_scalar_constant_value
(
v
.
owner
.
inputs
[
1
],
max_recur
=
max_recur
)
# Python 2.4 does not support indexing with numpy.integer
# Python 2.4 does not support indexing with numpy.integer
# So we cast it.
# So we cast it.
idx
=
int
(
idx
)
idx
=
int
(
idx
)
ret
=
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
idx
]
ret
=
v
.
owner
.
inputs
[
0
]
.
owner
.
inputs
[
idx
]
ret
=
get_scalar_constant_value
(
ret
)
ret
=
get_scalar_constant_value
(
ret
,
max_recur
=
max_recur
)
# MakeVector can cast implicitly its input in some case.
# MakeVector can cast implicitly its input in some case.
return
theano
.
_asarray
(
ret
,
dtype
=
v
.
type
.
dtype
)
return
theano
.
_asarray
(
ret
,
dtype
=
v
.
type
.
dtype
)
...
@@ -762,7 +776,8 @@ def get_scalar_constant_value(orig_v, elemwise=True,
...
@@ -762,7 +776,8 @@ def get_scalar_constant_value(orig_v, elemwise=True,
idx_list
=
op
.
idx_list
idx_list
=
op
.
idx_list
idx
=
idx_list
[
0
]
idx
=
idx_list
[
0
]
if
isinstance
(
idx
,
gof
.
Type
):
if
isinstance
(
idx
,
gof
.
Type
):
idx
=
get_scalar_constant_value
(
owner
.
inputs
[
1
])
idx
=
get_scalar_constant_value
(
owner
.
inputs
[
1
],
max_recur
=
max_recur
)
grandparent
=
leftmost_parent
.
owner
.
inputs
[
0
]
grandparent
=
leftmost_parent
.
owner
.
inputs
[
0
]
gp_broadcastable
=
grandparent
.
type
.
broadcastable
gp_broadcastable
=
grandparent
.
type
.
broadcastable
ndim
=
grandparent
.
type
.
ndim
ndim
=
grandparent
.
type
.
ndim
...
...
theano/tensor/opt.py
浏览文件 @
67e5e2eb
...
@@ -7130,7 +7130,7 @@ def local_add_mul_fusion(node):
...
@@ -7130,7 +7130,7 @@ def local_add_mul_fusion(node):
"""Fuse consecutive add or mul in one such node with more inputs.
"""Fuse consecutive add or mul in one such node with more inputs.
It is better to fuse add/mul that way then in a Composite node as
It is better to fuse add/mul that way then in a Composite node as
this make the inner graph of the Comp
is
te smaller. This allow to
this make the inner graph of the Comp
osi
te smaller. This allow to
put more computation in a Composite before hitting the max
put more computation in a Composite before hitting the max
recusion limit when pickling Composite.
recusion limit when pickling Composite.
...
@@ -7140,16 +7140,30 @@ def local_add_mul_fusion(node):
...
@@ -7140,16 +7140,30 @@ def local_add_mul_fusion(node):
return
False
return
False
s_op
=
node
.
op
.
scalar_op
.
__class__
s_op
=
node
.
op
.
scalar_op
.
__class__
new_inp
=
[]
fused
=
False
for
inp
in
node
.
inputs
:
for
inp
in
node
.
inputs
:
if
(
inp
.
owner
and
if
(
inp
.
owner
and
isinstance
(
inp
.
owner
.
op
,
Elemwise
)
and
isinstance
(
inp
.
owner
.
op
,
Elemwise
)
and
isinstance
(
inp
.
owner
.
op
.
scalar_op
,
s_op
)):
isinstance
(
inp
.
owner
.
op
.
scalar_op
,
s_op
)):
l
=
list
(
node
.
inputs
)
new_inp
.
extend
(
inp
.
owner
.
inputs
)
l
.
remove
(
inp
)
fused
=
True
output_node
=
node
.
op
(
*
(
l
+
inp
.
owner
.
inputs
))
else
:
new_inp
.
append
(
inp
)
copy_stack_trace
(
node
.
outputs
[
0
],
output_node
)
return
[
output_node
]
# We ca not compare the number of inputs as Mul and Add could have
# 0 or 1 inputs in some corner cases.
if
fused
:
output
=
node
.
op
(
*
new_inp
)
copy_stack_trace
(
node
.
outputs
[
0
],
output
)
# Do the recursion here to help lower the number of
# FusionOptimizer iteration.
if
output
.
owner
:
output2
=
local_add_mul_fusion
(
output
.
owner
)
if
output2
:
return
output2
return
[
output
]
if
config
.
tensor
.
local_elemwise_fusion
:
if
config
.
tensor
.
local_elemwise_fusion
:
_logger
.
debug
(
"enabling optimization fusion elemwise in fast_run"
)
_logger
.
debug
(
"enabling optimization fusion elemwise in fast_run"
)
...
...
theano/tensor/subtensor.py
浏览文件 @
67e5e2eb
...
@@ -398,7 +398,7 @@ class Subtensor(Op):
...
@@ -398,7 +398,7 @@ class Subtensor(Op):
raise
AdvancedIndexingError
(
Subtensor
.
e_indextype
,
entry
)
raise
AdvancedIndexingError
(
Subtensor
.
e_indextype
,
entry
)
def
get_constant_idx
(
self
,
inputs
,
allow_partial
=
False
,
def
get_constant_idx
(
self
,
inputs
,
allow_partial
=
False
,
only_process_constants
=
False
):
only_process_constants
=
False
,
elemwise
=
True
):
"""
"""
Return the idx_list with constant inputs replaced by their
Return the idx_list with constant inputs replaced by their
python scalar equivalent.
python scalar equivalent.
...
@@ -442,7 +442,8 @@ class Subtensor(Op):
...
@@ -442,7 +442,8 @@ class Subtensor(Op):
try
:
try
:
return
get_scalar_constant_value
(
return
get_scalar_constant_value
(
val
,
val
,
only_process_constants
=
only_process_constants
)
only_process_constants
=
only_process_constants
,
elemwise
=
elemwise
)
except
theano
.
tensor
.
NotScalarConstantError
:
except
theano
.
tensor
.
NotScalarConstantError
:
if
allow_partial
:
if
allow_partial
:
return
val
return
val
...
...
theano/tensor/tests/test_opt.py
浏览文件 @
67e5e2eb
...
@@ -2048,9 +2048,9 @@ class test_local_subtensor_lift(unittest.TestCase):
...
@@ -2048,9 +2048,9 @@ class test_local_subtensor_lift(unittest.TestCase):
Subtensor
,
tensor
.
DimShuffle
]))
Subtensor
,
tensor
.
DimShuffle
]))
prog
=
f
.
maker
.
fgraph
.
toposort
()
prog
=
f
.
maker
.
fgraph
.
toposort
()
assert
isinstance
(
prog
[
0
]
.
op
,
tensor
.
DimShuffle
)
assert
isinstance
(
prog
[
0
]
.
op
,
tensor
.
Subtensor
)
assert
isinstance
(
prog
[
1
]
.
op
,
tensor
.
Subtensor
)
# first subtensor
assert
isinstance
(
prog
[
1
]
.
op
,
tensor
.
DimShuffle
)
assert
isinstance
(
prog
[
2
]
.
op
,
tensor
.
Subtensor
)
# first subtensor
assert
isinstance
(
prog
[
2
]
.
op
,
tensor
.
Subtensor
)
assert
isinstance
(
prog
[
3
]
.
op
.
scalar_op
,
theano
.
scalar
.
assert
isinstance
(
prog
[
3
]
.
op
.
scalar_op
,
theano
.
scalar
.
Composite
)
# Composite{add,add}
Composite
)
# Composite{add,add}
assert
len
(
prog
)
==
4
assert
len
(
prog
)
==
4
...
@@ -2069,9 +2069,9 @@ class test_local_subtensor_lift(unittest.TestCase):
...
@@ -2069,9 +2069,9 @@ class test_local_subtensor_lift(unittest.TestCase):
Subtensor
,
tensor
.
DimShuffle
]))
Subtensor
,
tensor
.
DimShuffle
]))
prog
=
f
.
maker
.
fgraph
.
toposort
()
prog
=
f
.
maker
.
fgraph
.
toposort
()
assert
isinstance
(
prog
[
0
]
.
op
,
tensor
.
DimShuffle
)
assert
isinstance
(
prog
[
0
]
.
op
,
tensor
.
Subtensor
)
assert
isinstance
(
prog
[
1
]
.
op
,
tensor
.
Subtensor
)
# first subtensor
assert
isinstance
(
prog
[
1
]
.
op
,
tensor
.
DimShuffle
)
assert
isinstance
(
prog
[
2
]
.
op
,
tensor
.
Subtensor
)
# first subtensor
assert
isinstance
(
prog
[
2
]
.
op
,
tensor
.
Subtensor
)
assert
isinstance
(
prog
[
3
]
.
op
.
scalar_op
,
theano
.
scalar
.
assert
isinstance
(
prog
[
3
]
.
op
.
scalar_op
,
theano
.
scalar
.
Composite
)
# Composite{add,add}
Composite
)
# Composite{add,add}
assert
len
(
prog
)
==
4
assert
len
(
prog
)
==
4
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论