Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
BaiXuePrincess
Paddle
提交
0da5cce2
P
Paddle
项目概览
BaiXuePrincess
/
Paddle
与 Fork 源项目一致
Fork自
PaddlePaddle / Paddle
通知
1
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Paddle
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
0da5cce2
编写于
7月 28, 2017
作者:
D
dongzhihong
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
"fix test case"
上级
e1cd719a
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
6 addition
and
24 deletion
+6
-24
paddle/framework/backward_test.cc
paddle/framework/backward_test.cc
+6
-24
未找到文件。
paddle/framework/backward_test.cc
浏览文件 @
0da5cce2
...
@@ -165,33 +165,12 @@ TEST(Backward, simple_op_not_need_grad) {
...
@@ -165,33 +165,12 @@ TEST(Backward, simple_op_not_need_grad) {
auto
fwd
=
f
::
OpRegistry
::
CreateOp
(
"rowwise_add"
,
{
"X"
,
"b"
},
{
"Out"
},
{});
auto
fwd
=
f
::
OpRegistry
::
CreateOp
(
"rowwise_add"
,
{
"X"
,
"b"
},
{
"Out"
},
{});
ASSERT_NE
(
fwd
,
nullptr
);
ASSERT_NE
(
fwd
,
nullptr
);
auto
gop
=
f
::
Backward
(
*
fwd
,
{
"X"
});
auto
gop
=
f
::
Backward
(
*
fwd
,
{
"X"
});
LOG
(
INFO
)
<<
"full "
<<
gop
->
DebugString
();
ASSERT_EQ
(
std
::
find
(
gop
->
outputs_
.
begin
(),
gop
->
outputs_
.
end
(),
ASSERT_NE
(
std
::
find
(
gop
->
outputs_
.
begin
(),
gop
->
outputs_
.
end
(),
"X"
+
f
::
OperatorBase
::
GRAD_VAR_SUFFIX
()),
std
::
string
(
"X"
)
+
f
::
OperatorBase
::
GRAD_VAR_SUFFIX
()),
gop
->
outputs_
.
end
());
gop
->
outputs_
.
end
());
auto
no_input_gop
=
f
::
Backward
(
*
fwd
,
{
"X"
,
"b"
});
auto
no_input_gop
=
f
::
Backward
(
*
fwd
,
{
"X"
,
"b"
});
LOG
(
INFO
)
<<
"no input gop "
<<
gop
->
DebugString
();
ASSERT_NE
(
no_input_gop
,
nullptr
);
ASSERT_NE
(
no_input_gop
,
nullptr
);
typedef
std
::
vector
<
std
::
string
>
Vec
;
auto
vector_equal
=
[](
const
Vec
&
l
,
const
Vec
&
r
)
{
return
l
.
size
()
==
r
.
size
();
for
(
size_t
i
=
0
;
i
<
l
.
size
();
++
i
)
{
if
(
l
[
i
]
!=
r
[
i
])
return
false
;
}
return
true
;
};
ASSERT_EQ
(
vector_equal
(
std
::
vector
<
std
::
string
>
{},
no_input_gop
->
outputs_
),
true
);
ASSERT_EQ
(
vector_equal
(
std
::
vector
<
std
::
string
>
{
"Out"
+
f
::
OperatorBase
::
GRAD_VAR_SUFFIX
()},
no_input_gop
->
inputs_
),
true
);
// auto no_output_gop = f::Backward(*fwd, {"Out"});
// ASSERT_EQ(std::vector<std::string>{"X" +
// f::OperatorBase::GRAD_VAR_SUFFIX(), "b"})
}
}
TEST
(
Backward
,
net_fc_backward_normal
)
{
TEST
(
Backward
,
net_fc_backward_normal
)
{
...
@@ -251,6 +230,8 @@ TEST(Backward, net_input_of_network_not_need_grad) {
...
@@ -251,6 +230,8 @@ TEST(Backward, net_input_of_network_not_need_grad) {
bwd_net
->
outputs_
.
begin
(),
bwd_net
->
outputs_
.
end
());
bwd_net
->
outputs_
.
begin
(),
bwd_net
->
outputs_
.
end
());
all_output
.
erase
(
f
::
OperatorBase
::
EMPTY_VAR_NAME
());
all_output
.
erase
(
f
::
OperatorBase
::
EMPTY_VAR_NAME
());
LOG
(
INFO
)
<<
bwd_net
->
DebugString
();
LOG
(
INFO
)
<<
bwd_net
->
ops_
.
size
();
for
(
auto
&
out
:
{
"W1"
,
"b1"
,
"hidden0"
,
"W2"
,
"b2"
})
{
for
(
auto
&
out
:
{
"W1"
,
"b1"
,
"hidden0"
,
"W2"
,
"b2"
})
{
ASSERT_NE
(
all_output
.
find
(
out
+
f
::
OperatorBase
::
GRAD_VAR_SUFFIX
()),
ASSERT_NE
(
all_output
.
find
(
out
+
f
::
OperatorBase
::
GRAD_VAR_SUFFIX
()),
all_output
.
end
());
all_output
.
end
());
...
@@ -264,6 +245,7 @@ TEST(Backward, net_input_of_network_not_need_grad) {
...
@@ -264,6 +245,7 @@ TEST(Backward, net_input_of_network_not_need_grad) {
ASSERT_TRUE
(
bwd_net
->
ops_
[
1
]
->
IsNetOp
());
ASSERT_TRUE
(
bwd_net
->
ops_
[
1
]
->
IsNetOp
());
auto
first_fc_grad
=
static_cast
<
f
::
NetOp
*>
(
bwd_net
->
ops_
[
1
].
get
());
auto
first_fc_grad
=
static_cast
<
f
::
NetOp
*>
(
bwd_net
->
ops_
[
1
].
get
());
ASSERT_EQ
(
3UL
,
first_fc_grad
->
ops_
.
size
());
ASSERT_EQ
(
3UL
,
first_fc_grad
->
ops_
.
size
());
LOG
(
INFO
)
<<
first_fc_grad
->
DebugString
();
ASSERT_EQ
(
f
::
OperatorBase
::
EMPTY_VAR_NAME
(),
ASSERT_EQ
(
f
::
OperatorBase
::
EMPTY_VAR_NAME
(),
first_fc_grad
[
2
].
Output
(
"X"
+
f
::
OperatorBase
::
GRAD_VAR_SUFFIX
()));
first_fc_grad
[
2
].
Output
(
"X"
+
f
::
OperatorBase
::
GRAD_VAR_SUFFIX
()));
}
}
...
@@ -333,7 +315,7 @@ TEST(Backward, op_part_of_output_are_not_need) {
...
@@ -333,7 +315,7 @@ TEST(Backward, op_part_of_output_are_not_need) {
TEST
(
Backward
,
op_part_of_input_are_not_need
)
{
TEST
(
Backward
,
op_part_of_input_are_not_need
)
{
auto
fwd
=
f
::
OpRegistry
::
CreateOp
(
"mul"
,
{
"a"
,
"b"
},
{
"out"
},
{});
auto
fwd
=
f
::
OpRegistry
::
CreateOp
(
"mul"
,
{
"a"
,
"b"
},
{
"out"
},
{});
auto
backward
=
f
::
Backward
(
*
fwd
,
{
"a"
});
auto
backward
=
f
::
Backward
(
*
fwd
,
{
"a"
});
ASSERT_
TRUE
(
backward
->
IsNetOp
());
ASSERT_
False
(
backward
->
IsNetOp
());
auto
net
=
static_cast
<
f
::
NetOp
*>
(
backward
.
get
());
auto
net
=
static_cast
<
f
::
NetOp
*>
(
backward
.
get
());
ASSERT_EQ
(
net
->
ops_
.
size
(),
1UL
);
ASSERT_EQ
(
net
->
ops_
.
size
(),
1UL
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录