Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
5d43badc
提交
5d43badc
authored
5月 27, 2015
作者:
--global
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix typo
上级
f7302dfd
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
3 行增加
和
3 行删除
+3
-3
scan.txt
doc/library/scan.txt
+3
-3
没有找到文件。
doc/library/scan.txt
浏览文件 @
5d43badc
...
@@ -510,7 +510,7 @@ This one is simple but still worth pointing out. Theano is able to
...
@@ -510,7 +510,7 @@ This one is simple but still worth pointing out. Theano is able to
automatically recognize and optimize many computation patterns. However, there
automatically recognize and optimize many computation patterns. However, there
are patterns that Theano doesn't optimize because doing so would change the
are patterns that Theano doesn't optimize because doing so would change the
user interface (such as merging shared variables together into a single one,
user interface (such as merging shared variables together into a single one,
for instance). Addition
n
aly, Theano doesn't catch every case that it could
for instance). Additionaly, Theano doesn't catch every case that it could
optimize and so it remains useful for performance that the user defines an
optimize and so it remains useful for performance that the user defines an
efficient graph in the first place. This is also the case, and sometimes even
efficient graph in the first place. This is also the case, and sometimes even
more so, for the graph inside of Scan. This is because it will be executed
more so, for the graph inside of Scan. This is because it will be executed
...
@@ -525,8 +525,8 @@ multiplications between matrix :math:`x_t` and each of the shared matrices
...
@@ -525,8 +525,8 @@ multiplications between matrix :math:`x_t` and each of the shared matrices
performs a single larger matrix multiplication between :math:`W` and
performs a single larger matrix multiplication between :math:`W` and
:math:`x_t`. The resulting matrix is then sliced to obtain the results of that
:math:`x_t`. The resulting matrix is then sliced to obtain the results of that
the small individual matrix multiplications would have produced. This
the small individual matrix multiplications would have produced. This
optimization replaces
many small and inefficient matrix multiplications but a
optimization replaces
several small and inefficient matrix multiplications by
single larger one and thus improves performance at the cost of a potentially
a
single larger one and thus improves performance at the cost of a potentially
higher memory usage.
higher memory usage.
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论