Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
机器未来
Paddle
提交
94d72752
P
Paddle
项目概览
机器未来
/
Paddle
与 Fork 源项目一致
Fork自
PaddlePaddle / Paddle
通知
1
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
1
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
P
Paddle
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
1
Issue
1
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
94d72752
编写于
12月 17, 2019
作者:
Z
zhouwei25
提交者:
Tao Luo
12月 17, 2019
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
add one losing patch file of warpctc (#21757)
上级
a5a8d144
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
97 addition
and
0 deletion
+97
-0
patches/warpctc/tests/test.h
patches/warpctc/tests/test.h
+97
-0
未找到文件。
patches/warpctc/tests/test.h
0 → 100644
浏览文件 @
94d72752
// Copyright (c) 2019 PaddlePaddle Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#pragma once
#include <algorithm>
#include <numeric>
#include <random>
#include <stdexcept>
#include <vector>
#include <ctc.h>
inline
void
throw_on_error
(
ctcStatus_t
status
,
const
char
*
message
)
{
if
(
status
!=
CTC_STATUS_SUCCESS
)
{
throw
std
::
runtime_error
(
message
+
(
", stat = "
+
std
::
string
(
ctcGetStatusString
(
status
))));
}
}
#ifdef __CUDACC__
#include <thrust/system/cuda/error.h>
#include <thrust/system_error.h>
inline
void
throw_on_error
(
cudaError_t
error
,
const
char
*
message
)
{
if
(
error
)
{
throw
thrust
::
system_error
(
error
,
thrust
::
cuda_category
(),
message
);
}
}
#endif
std
::
vector
<
float
>
genActs
(
int
size
)
{
std
::
vector
<
float
>
arr
(
size
);
std
::
mt19937
gen
(
0
);
std
::
uniform_real_distribution
<>
dis
(
0
,
1
);
for
(
int
i
=
0
;
i
<
size
;
++
i
)
arr
[
i
]
=
dis
(
gen
);
return
arr
;
}
std
::
vector
<
int
>
genLabels
(
int
alphabet_size
,
int
L
)
{
std
::
vector
<
int
>
label
(
L
);
std
::
mt19937
gen
(
1
);
std
::
uniform_int_distribution
<>
dis
(
1
,
alphabet_size
-
1
);
for
(
int
i
=
0
;
i
<
L
;
++
i
)
{
label
[
i
]
=
dis
(
gen
);
}
// guarantee repeats for testing
if
(
L
>=
3
)
{
label
[
L
/
2
]
=
label
[
L
/
2
+
1
];
label
[
L
/
2
-
1
]
=
label
[
L
/
2
];
}
return
label
;
}
float
rel_diff
(
const
std
::
vector
<
float
>&
grad
,
const
std
::
vector
<
float
>&
num_grad
)
{
float
diff
=
0.
;
float
tot
=
0.
;
for
(
size_t
idx
=
0
;
idx
<
grad
.
size
();
++
idx
)
{
diff
+=
(
grad
[
idx
]
-
num_grad
[
idx
])
*
(
grad
[
idx
]
-
num_grad
[
idx
]);
tot
+=
grad
[
idx
]
*
grad
[
idx
];
}
return
diff
/
tot
;
}
// Numerically stable softmax for a minibatch of 1
void
softmax
(
const
float
*
const
acts
,
int
alphabet_size
,
int
T
,
float
*
probs
)
{
for
(
int
t
=
0
;
t
<
T
;
++
t
)
{
float
max_activation
=
-
std
::
numeric_limits
<
float
>::
infinity
();
for
(
int
a
=
0
;
a
<
alphabet_size
;
++
a
)
max_activation
=
std
::
max
(
max_activation
,
acts
[
t
*
alphabet_size
+
a
]);
float
denom
=
0
;
for
(
int
a
=
0
;
a
<
alphabet_size
;
++
a
)
denom
+=
std
::
exp
(
acts
[
t
*
alphabet_size
+
a
]
-
max_activation
);
for
(
int
a
=
0
;
a
<
alphabet_size
;
++
a
)
probs
[
t
*
alphabet_size
+
a
]
=
std
::
exp
(
acts
[
t
*
alphabet_size
+
a
]
-
max_activation
)
/
denom
;
}
}
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录