Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
191a96e7
提交
191a96e7
authored
1月 16, 2010
作者:
Pascal Lamblin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Refactor code of test_get_rid_of_advanced_indexing_version_of_xent, get more expressions tested.
上级
f06506db
显示空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
68 行增加
和
23 行删除
+68
-23
test_nnet.py
theano/tensor/tests/test_nnet.py
+68
-23
没有找到文件。
theano/tensor/tests/test_nnet.py
浏览文件 @
191a96e7
...
@@ -318,6 +318,9 @@ def test_asymptotic_32():
...
@@ -318,6 +318,9 @@ def test_asymptotic_32():
def
test_get_rid_of_advanced_indexing_version_of_xent
():
def
test_get_rid_of_advanced_indexing_version_of_xent
():
verbose
=
0
if
0
:
mode
=
'DEBUG_MODE'
else
:
mode
=
'FAST_RUN'
rng
=
numpy
.
random
.
RandomState
(
utt
.
fetch_seed
())
rng
=
numpy
.
random
.
RandomState
(
utt
.
fetch_seed
())
...
@@ -329,46 +332,88 @@ def test_get_rid_of_advanced_indexing_version_of_xent():
...
@@ -329,46 +332,88 @@ def test_get_rid_of_advanced_indexing_version_of_xent():
b
=
T
.
dvector
(
'b'
)
b
=
T
.
dvector
(
'b'
)
y
=
T
.
lvector
(
'y'
)
y
=
T
.
lvector
(
'y'
)
expressions_to_test
=
[
def
print_graph
(
func
):
for
i
,
node
in
enumerate
(
func
.
maker
.
env
.
toposort
()):
print
i
,
node
# Last node should be the output
print
i
,
pprint
(
node
.
outputs
[
0
])
## Basic case
expressions
=
[
T
.
sum
(
-
T
.
log
(
softmax
(
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
T
.
sum
(
-
T
.
log
(
softmax
(
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
sum
(
T
.
log
(
softmax
(
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
sum
(
T
.
log
(
softmax
(
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
sum
(
T
.
log
(
softmax
(
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
]),
-
T
.
sum
(
T
.
log
(
softmax
(
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
]),
T
.
sum
(
-
T
.
log
(
softmax
(
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
])]
T
.
sum
(
-
T
.
log
(
softmax
(
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
])]
def
assert_optimizer_worked
(
expr
):
for
expr
in
expressions
:
f
=
theano
.
function
([
x
,
y
],
expr
,
mode
=
'FAST_RUN'
)
# Verify the optimizer worked on the expressions
if
0
:
f
=
theano
.
function
([
x
,
y
],
expr
,
mode
=
mode
)
for
i
,
node
in
enumerate
(
f
.
maker
.
env
.
toposort
()):
if
verbose
:
print_graph
(
f
)
print
i
,
node
f
(
x_val
,
y_val
)
assert
len
(
f
.
maker
.
env
.
toposort
())
==
4
assert
len
(
f
.
maker
.
env
.
toposort
())
==
4
for
expr
in
expressions_to_test
:
f
(
x_val
,
y_val
)
assert_optimizer_worked
(
expr
)
## Gradient wrt x
# Also verify the gradient wrt x
for
expr
in
expressions_to_test
:
g
=
theano
.
function
([
x
,
y
],
T
.
grad
(
expr
,
x
),
mode
=
mode
)
grad_x
=
T
.
grad
(
expr
,
x
)
if
verbose
:
print_graph
(
g
)
g
=
theano
.
function
([
x
,
y
],
grad_x
,
mode
=
'FAST_RUN'
)
if
0
:
for
i
,
node
in
enumerate
(
g
.
maker
.
env
.
toposort
()):
print
i
,
node
g
(
x_val
,
y_val
)
assert
len
(
g
.
maker
.
env
.
toposort
())
==
4
assert
len
(
g
.
maker
.
env
.
toposort
())
==
4
g
(
x_val
,
y_val
)
## Test that a biased softmax is optimized correctly
## Test that a biased softmax is optimized correctly
for
expr
in
[
bias_expressions
=
[
T
.
sum
(
-
T
.
log
(
softmax
(
x
+
b
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
T
.
sum
(
-
T
.
log
(
softmax
(
x
+
b
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
sum
(
T
.
log
(
softmax
(
b
+
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
sum
(
T
.
log
(
softmax
(
b
+
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
sum
(
T
.
log
(
softmax
(
x
+
b
))[
T
.
arange
(
y
.
shape
[
0
]),
y
]),
-
T
.
sum
(
T
.
log
(
softmax
(
x
+
b
))[
T
.
arange
(
y
.
shape
[
0
]),
y
]),
T
.
sum
(
-
T
.
log
(
softmax
(
b
+
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
])]
:
T
.
sum
(
-
T
.
log
(
softmax
(
b
+
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
])]
f
=
theano
.
function
([
x
,
b
,
y
],
expr
,
mode
=
'FAST_RUN'
)
if
1
:
for
expr
in
bias_expressions
:
for
i
,
node
in
enumerate
(
f
.
maker
.
env
.
toposort
()):
f
=
theano
.
function
([
x
,
b
,
y
],
expr
,
mode
=
mode
)
print
i
,
node
if
verbose
:
print_graph
(
f
)
assert
len
(
f
.
maker
.
env
.
toposort
())
==
2
# [big_op, sum]
assert
len
(
f
.
maker
.
env
.
toposort
())
==
2
# [big_op, sum]
f
(
x_val
,
b_val
,
y_val
)
f
(
x_val
,
b_val
,
y_val
)
g
=
theano
.
function
([
x
,
b
,
y
],
T
.
grad
(
expr
,
x
),
mode
=
mode
)
if
verbose
:
print_graph
(
g
)
assert
len
(
g
.
maker
.
env
.
toposort
())
==
4
g
(
x_val
,
b_val
,
y_val
)
## Test that using "mean" instead of sum works, too
mean_expressions
=
[
T
.
mean
(
-
T
.
log
(
softmax
(
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
mean
(
T
.
log
(
softmax
(
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
mean
(
T
.
log
(
softmax
(
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
]),
T
.
mean
(
-
T
.
log
(
softmax
(
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
])]
for
expr
in
mean_expressions
:
f
=
theano
.
function
([
x
,
y
],
expr
,
mode
=
mode
)
if
verbose
:
print_graph
(
f
)
assert
len
(
f
.
maker
.
env
.
toposort
())
==
7
f
(
x_val
,
y_val
)
g
=
theano
.
function
([
x
,
y
],
T
.
grad
(
expr
,
x
),
mode
=
mode
)
if
verbose
:
print_graph
(
g
)
assert
len
(
g
.
maker
.
env
.
toposort
())
==
8
g
(
x_val
,
y_val
)
mean_bias_expressions
=
[
T
.
mean
(
-
T
.
log
(
softmax
(
x
+
b
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
mean
(
T
.
log
(
softmax
(
b
+
x
)[
T
.
arange
(
y
.
shape
[
0
]),
y
])),
-
T
.
mean
(
T
.
log
(
softmax
(
x
+
b
))[
T
.
arange
(
y
.
shape
[
0
]),
y
]),
T
.
mean
(
-
T
.
log
(
softmax
(
b
+
x
))[
T
.
arange
(
y
.
shape
[
0
]),
y
])]
for
expr
in
mean_bias_expressions
:
f
=
theano
.
function
([
x
,
b
,
y
],
expr
,
mode
=
mode
)
if
verbose
:
print_graph
(
f
)
assert
len
(
f
.
maker
.
env
.
toposort
())
==
5
g
=
theano
.
function
([
x
,
b
,
y
],
T
.
grad
(
expr
,
x
),
mode
=
mode
)
if
verbose
:
print_graph
(
g
)
assert
len
(
g
.
maker
.
env
.
toposort
())
==
8
g
(
x_val
,
b_val
,
y_val
)
# hint - call the argmax push-down optimization first too
# hint - call the argmax push-down optimization first too
if
__name__
==
'__main__'
:
if
__name__
==
'__main__'
:
unittest
.
main
()
unittest
.
main
()
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论