Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
289ea572
提交
289ea572
authored
2月 12, 2013
作者:
Frederic Bastien
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix some documentation syntax problem that make the cron that build the doc fail.
Should allow the documentation to be updated automatically again.
上级
555ca75c
隐藏空白字符变更
内嵌
并排
正在显示
6 个修改的文件
包含
21 行增加
和
12 行删除
+21
-12
install.txt
doc/install.txt
+2
-2
basic.txt
doc/library/tensor/basic.txt
+5
-0
conv.txt
doc/library/tensor/nnet/conv.txt
+5
-2
conv.txt
doc/library/tensor/signal/conv.txt
+5
-2
basic_ops.py
theano/sandbox/cuda/basic_ops.py
+1
-1
ops.py
theano/sandbox/linalg/ops.py
+3
-5
没有找到文件。
doc/install.txt
浏览文件 @
289ea572
...
...
@@ -657,8 +657,8 @@ Theano dependencies is easy, but be aware that it will take a long time
Homebrew
~~~~~~~~
There are some
:ref:
`instructions
<https://github.com/samueljohn/homebrew-python>` by Samuel John on how to install
There are some `instructions
<https://github.com/samueljohn/homebrew-python>`
__
by Samuel John on how to install
Theano dependencies with Homebrew instead of MacPort.
...
...
doc/library/tensor/basic.txt
浏览文件 @
289ea572
...
...
@@ -1229,6 +1229,7 @@ Linear Algebra
If an integer i, it is converted to an array containing
the last i dimensions of the first tensor and the first
i dimensions of the second tensor:
axes = [range(a.ndim - i, b.ndim), range(i)]
If an array, its two elements must contain compatible axes
...
...
@@ -1251,6 +1252,8 @@ Linear Algebra
are compatible. The resulting tensor will have shape (2, 5, 6) -- the
dimensions that are not being summed:
.. code-block:: python
a = np.random.random((2,3,4))
b = np.random.random((5,6,4,3))
...
...
@@ -1284,6 +1287,8 @@ Linear Algebra
In an extreme case, no axes may be specified. The resulting tensor
will have shape equal to the concatenation of the shapes of a and b:
.. code-block:: python
c = np.tensordot(a, b, 0)
print(a.shape) #(2,3,4)
print(b.shape) #(5,6,4,3)
...
...
doc/library/tensor/nnet/conv.txt
浏览文件 @
289ea572
...
...
@@ -7,8 +7,11 @@
.. note::
Two similar implementation exists for conv2d:
:func:`signal.conv2d <theano.tensor.signal.conv.conv2d>` and
:func:`nnet.conv2d <theano.tensor.nnet.conv.conv2d>`. The former implements a traditional
:func:`signal.conv2d <theano.tensor.signal.conv.conv2d>` and
:func:`nnet.conv2d <theano.tensor.nnet.conv.conv2d>`.
The former implements a traditional
2D convolution, while the latter implements the convolutional layers
present in convolutional neural networks (where filters are 3D and pool
over several input channels).
...
...
doc/library/tensor/signal/conv.txt
浏览文件 @
289ea572
...
...
@@ -7,8 +7,11 @@
.. note::
Two similar implementation exists for conv2d:
:func:`signal.conv2d <theano.tensor.signal.conv.conv2d>` and
:func:`nnet.conv2d <theano.tensor.nnet.conv.conv2d>. The former implements a traditional
:func:`signal.conv2d <theano.tensor.signal.conv.conv2d>` and
:func:`nnet.conv2d <theano.tensor.nnet.conv.conv2d>`.
The former implements a traditional
2D convolution, while the latter implements the convolutional layers
present in convolutional neural networks (where filters are 3D and pool
over several input channels).
...
...
theano/sandbox/cuda/basic_ops.py
浏览文件 @
289ea572
...
...
@@ -2455,7 +2455,7 @@ class GpuIncSubtensor(tensor.IncSubtensor, GpuOp):
:return: C code expression to make a copy of x
Base class uses
PyArrayObject *
, subclasses may override for
Base class uses
`PyArrayObject *`
, subclasses may override for
different types of arrays.
"""
return
"""(CudaNdarray*) CudaNdarray_Copy(
%(x)
s)"""
%
locals
()
...
...
theano/sandbox/linalg/ops.py
浏览文件 @
289ea572
...
...
@@ -433,16 +433,14 @@ class CholeskyGrad(Op):
return
Apply
(
self
,
[
x
,
l
,
dz
],
[
x
.
type
()])
def
perform
(
self
,
node
,
inputs
,
outputs
):
"""
Implements the "reverse-mode" gradient for the Cholesky factorization
of a positive-definite matrix.
"""Implements the "reverse-mode" gradient [1]_ for the
Cholesky factorization of a positive-definite matrix.
References
----------
.. [1] S. P. Smith. "Differentiation of the Cholesky Algorithm".
Journal of Computational and Graphical Statistics,
Vol. 4, No. 2 (Jun.,1995), pp. 134-147
http://www.jstor.org/stable/1390762
"""
x
=
inputs
[
0
]
L
=
inputs
[
1
]
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论