Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
0f23f164
提交
0f23f164
authored
7月 28, 2016
作者:
Ozan Çağlayan
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
doc: Fix string Fourrier -> Fourier
上级
81e52783
显示空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
6 行增加
和
6 行删除
+6
-6
dnn.txt
doc/library/gpuarray/dnn.txt
+2
-2
dnn.txt
doc/library/sandbox/cuda/dnn.txt
+4
-4
没有找到文件。
doc/library/gpuarray/dnn.txt
浏览文件 @
0f23f164
...
...
@@ -61,7 +61,7 @@ To get an error if Theano can not use cuDNN, use this Theano flag:
usage
* ``none`` : use a slower implementation with minimal memory usage
* ``large`` : use a sometimes faster implementation with large memory usage
* ``fft`` : use the Fast Four
r
ier Transform implementation of convolution
* ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage)
* ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused
...
...
@@ -83,7 +83,7 @@ To get an error if Theano can not use cuDNN, use this Theano flag:
* ``none`` (default) : use the default non-deterministic convolution
implementation
* ``deterministic`` : use a slower but deterministic implementation
* ``fft`` : use the Fast Four
r
ier Transform implementation of convolution
* ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage)
* ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused
...
...
doc/library/sandbox/cuda/dnn.txt
浏览文件 @
0f23f164
...
...
@@ -64,9 +64,9 @@ get an error when cuDNN can not be used with them, use this flag:
usage
* ``none`` : use a slower implementation with minimal memory usage
* ``large`` : use a sometimes faster implementation with large memory usage
* ``fft`` : use the Fast Four
r
ier Transform implementation of convolution
* ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage)
* ``fft_tiling`` : use the Fast Four
r
ier Transform implementation of convolution
* ``fft_tiling`` : use the Fast Fourier Transform implementation of convolution
with tiling (high memory usage, but less then fft)
* ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused
...
...
@@ -89,7 +89,7 @@ get an error when cuDNN can not be used with them, use this flag:
* ``none`` (default) : use the default non-deterministic convolution
implementation
* ``deterministic`` : use a slower but deterministic implementation
* ``fft`` : use the Fast Four
r
ier Transform implementation of convolution
* ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage)
* ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused
...
...
@@ -104,7 +104,7 @@ get an error when cuDNN can not be used with them, use this flag:
implementation selected every time the shapes of the inputs and kernels
don't match the shapes from the last execution.
* (algo_bwd_data only) ``fft_tiling`` : use the Fast Four
r
ier
* (algo_bwd_data only) ``fft_tiling`` : use the Fast Fourier
Transform implementation of convolution with tiling (high memory
usage, but less then fft)
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论