提交 5e4a1b6b authored 作者: Frédéric Bastien's avatar Frédéric Bastien 提交者: GitHub

Merge pull request #4799 from ozancaglayan/docfix

doc: Fix string Fourrier -> Fourier
...@@ -61,7 +61,7 @@ To get an error if Theano can not use cuDNN, use this Theano flag: ...@@ -61,7 +61,7 @@ To get an error if Theano can not use cuDNN, use this Theano flag:
usage usage
* ``none`` : use a slower implementation with minimal memory usage * ``none`` : use a slower implementation with minimal memory usage
* ``large`` : use a sometimes faster implementation with large memory usage * ``large`` : use a sometimes faster implementation with large memory usage
* ``fft`` : use the Fast Fourrier Transform implementation of convolution * ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage) (very high memory usage)
* ``guess_once`` : the first time a convolution is executed, the * ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused 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: ...@@ -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 * ``none`` (default) : use the default non-deterministic convolution
implementation implementation
* ``deterministic`` : use a slower but deterministic implementation * ``deterministic`` : use a slower but deterministic implementation
* ``fft`` : use the Fast Fourrier Transform implementation of convolution * ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage) (very high memory usage)
* ``guess_once`` : the first time a convolution is executed, the * ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused implementation to use is chosen according to cuDNN's heuristics and reused
......
...@@ -64,9 +64,9 @@ get an error when cuDNN can not be used with them, use this flag: ...@@ -64,9 +64,9 @@ get an error when cuDNN can not be used with them, use this flag:
usage usage
* ``none`` : use a slower implementation with minimal memory usage * ``none`` : use a slower implementation with minimal memory usage
* ``large`` : use a sometimes faster implementation with large memory usage * ``large`` : use a sometimes faster implementation with large memory usage
* ``fft`` : use the Fast Fourrier Transform implementation of convolution * ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage) (very high memory usage)
* ``fft_tiling`` : use the Fast Fourrier Transform implementation of convolution * ``fft_tiling`` : use the Fast Fourier Transform implementation of convolution
with tiling (high memory usage, but less then fft) with tiling (high memory usage, but less then fft)
* ``guess_once`` : the first time a convolution is executed, the * ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused 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: ...@@ -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 * ``none`` (default) : use the default non-deterministic convolution
implementation implementation
* ``deterministic`` : use a slower but deterministic implementation * ``deterministic`` : use a slower but deterministic implementation
* ``fft`` : use the Fast Fourrier Transform implementation of convolution * ``fft`` : use the Fast Fourier Transform implementation of convolution
(very high memory usage) (very high memory usage)
* ``guess_once`` : the first time a convolution is executed, the * ``guess_once`` : the first time a convolution is executed, the
implementation to use is chosen according to cuDNN's heuristics and reused 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: ...@@ -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 implementation selected every time the shapes of the inputs and kernels
don't match the shapes from the last execution. don't match the shapes from the last execution.
* (algo_bwd_data only) ``fft_tiling`` : use the Fast Fourrier * (algo_bwd_data only) ``fft_tiling`` : use the Fast Fourier
Transform implementation of convolution with tiling (high memory Transform implementation of convolution with tiling (high memory
usage, but less then fft) usage, but less then fft)
......
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论