Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
9707cf67
提交
9707cf67
authored
2月 29, 2012
作者:
Olivier Delalleau
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #494 from lamblin/fix_doc_syntax
Format fixes to keep sphinx happy
上级
873d41b0
7441389b
隐藏空白字符变更
内嵌
并排
正在显示
9 个修改的文件
包含
42 行增加
和
34 行删除
+42
-34
NEWS.txt
doc/NEWS.txt
+12
-10
core_development_guide.txt
doc/core_development_guide.txt
+1
-1
scan.txt
doc/developer/scan.txt
+1
-1
introduction.txt
doc/introduction.txt
+18
-12
randomnumbers.txt
doc/sandbox/randomnumbers.txt
+1
-1
rng_curand.py
theano/sandbox/cuda/rng_curand.py
+1
-1
ops.py
theano/sandbox/linalg/ops.py
+2
-2
basic.py
theano/sparse/basic.py
+5
-5
raw_random.py
theano/tensor/raw_random.py
+1
-1
没有找到文件。
doc/NEWS.txt
浏览文件 @
9707cf67
...
@@ -54,8 +54,7 @@ Interface Features Removed (most were deprecated):
...
@@ -54,8 +54,7 @@ Interface Features Removed (most were deprecated):
to return has been removed. Instead, apply a subtensor to the output
to return has been removed. Instead, apply a subtensor to the output
returned by scan to select a certain slice.
returned by scan to select a certain slice.
* The inner function (that scan receives) should return its outputs and
* The inner function (that scan receives) should return its outputs and
updates following this order:
updates following this order: [outputs], [updates], [condition].
[outputs], [updates], [condition].
One can skip any of the three if not used, but the order has to stay unchanged.
One can skip any of the three if not used, but the order has to stay unchanged.
Interface bug fix:
Interface bug fix:
...
@@ -74,8 +73,10 @@ Bug fixes (incorrect results):
...
@@ -74,8 +73,10 @@ Bug fixes (incorrect results):
Dieleman)
Dieleman)
* Theoretical bug: in some case we could have GPUSum return bad value.
* Theoretical bug: in some case we could have GPUSum return bad value.
We were not able to reproduce this problem
We were not able to reproduce this problem
* patterns affected ({0,1}*nb dim, 0 no reduction on this dim, 1 reduction on this dim):
01, 011, 0111, 010, 10, 001, 0011, 0101 (Frederic)
* patterns affected ({0,1}*nb dim, 0 no reduction on this dim, 1 reduction on this dim):
01, 011, 0111, 010, 10, 001, 0011, 0101 (Frederic)
* div by zero in verify_grad. This hid a bug in the grad of Images2Neibs. (James)
* div by zero in verify_grad. This hid a bug in the grad of Images2Neibs. (James)
* theano.sandbox.neighbors.Images2Neibs grad was returning a wrong value.
* theano.sandbox.neighbors.Images2Neibs grad was returning a wrong value.
The grad is now disabled and returns an error. (Frederic)
The grad is now disabled and returns an error. (Frederic)
...
@@ -98,12 +99,13 @@ Scan fixes:
...
@@ -98,12 +99,13 @@ Scan fixes:
before : most of the time crash, but could be wrong value with bad number of dimensions (so a visible bug)
before : most of the time crash, but could be wrong value with bad number of dimensions (so a visible bug)
now : do the right thing.
now : do the right thing.
* gradient with respect to outputs using multiple taps (reported by Timothy, fix by Razvan)
* gradient with respect to outputs using multiple taps (reported by Timothy, fix by Razvan)
before : it used to return wrong values
now : do the right thing.
* before : it used to return wrong values
Note: The reported case of this bug was happening in conjunction with the
* now : do the right thing.
save optimization of scan that give run time errors. So if you didn't
* Note: The reported case of this bug was happening in conjunction with the
manually disable the same memory optimization (number in the list4),
save optimization of scan that give run time errors. So if you didn't
you are fine if you didn't manually request multiple taps.
manually disable the same memory optimization (number in the list4),
you are fine if you didn't manually request multiple taps.
* Rop of gradient of scan (reported by Timothy and Justin Bayer, fix by Razvan)
* Rop of gradient of scan (reported by Timothy and Justin Bayer, fix by Razvan)
before : compilation error when computing R-op
before : compilation error when computing R-op
now : do the right thing.
now : do the right thing.
...
...
doc/core_development_guide.txt
浏览文件 @
9707cf67
...
@@ -20,7 +20,7 @@ some of them might be outdated though:
...
@@ -20,7 +20,7 @@ some of them might be outdated though:
* :ref:`pipeline` -- Describes the steps of compiling a Theano Function.
* :ref:`pipeline` -- Describes the steps of compiling a Theano Function.
* :ref:`graphstructure` -- Describes the symbolic graphs generated by
* :ref:`graphstructure
s
` -- Describes the symbolic graphs generated by
:mod:`theano.scan`.
:mod:`theano.scan`.
* :ref:`unittest` -- Tutorial on how to use unittest in testing Theano.
* :ref:`unittest` -- Tutorial on how to use unittest in testing Theano.
...
...
doc/developer/scan.txt
浏览文件 @
9707cf67
...
@@ -91,7 +91,7 @@ Naming conventions
...
@@ -91,7 +91,7 @@ Naming conventions
* ``input_state`` will stand for a state :math:`\mathbf{x}`, when it is
* ``input_state`` will stand for a state :math:`\mathbf{x}`, when it is
provided as an input to the recurrent formula (the inner function) that
provided as an input to the recurrent formula (the inner function) that
will generate the new value of the state
will generate the new value of the state
* ``output_state`` will stand for a state :math:`\math{x}` when it refers
* ``output_state`` will stand for a state :math:`\math
bf
{x}` when it refers
to the result of the recurrent formula (the output of the inner function)
to the result of the recurrent formula (the output of the inner function)
* ``output`` will stand for an output :math:`\mathbf{y}`
* ``output`` will stand for an output :math:`\mathbf{y}`
* ``input`` will be an input :math:`\mathbf{u}`
* ``input`` will be an input :math:`\mathbf{u}`
...
...
doc/introduction.txt
浏览文件 @
9707cf67
...
@@ -174,29 +174,35 @@ Here is the state of that vision as of 24 October 2011 (after Theano release
...
@@ -174,29 +174,35 @@ Here is the state of that vision as of 24 October 2011 (after Theano release
* We have many graph transformations that cover the 4 categories listed above.
* We have many graph transformations that cover the 4 categories listed above.
* We can improve the graph transformation with better storage optimization
* We can improve the graph transformation with better storage optimization
and instruction selection.
and instruction selection.
* Similar to auto-tuning during the optimization phase, but this
doesn't apply to only 1 op.
* Similar to auto-tuning during the optimization phase, but this
* Example of use: Determine if we should move computation to the
doesn't apply to only 1 op.
GPU or not depending on the input size.
* Example of use: Determine if we should move computation to the
* Possible implementation note: allow Theano Variable in the env to
GPU or not depending on the input size.
have more then 1 owner.
* Possible implementation note: allow Theano Variable in the env to
have more then 1 owner.
* We have a CUDA backend for tensors of type `float32` only.
* We have a CUDA backend for tensors of type `float32` only.
* Efforts have begun towards a generic GPU ndarray (GPU tensor) (started in the
* Efforts have begun towards a generic GPU ndarray (GPU tensor) (started in the
`compyte <https://github.com/inducer/compyte/wiki>`_ project)
`compyte <https://github.com/inducer/compyte/wiki>`_ project)
* Move GPU backend outside of Theano (on top of PyCUDA/PyOpenCL)
* Will provide better support for GPU on Windows and use an OpenCL backend on CPU.
* Move GPU backend outside of Theano (on top of PyCUDA/PyOpenCL)
* Will provide better support for GPU on Windows and use an OpenCL backend on CPU.
* Loops work, but not all related optimizations are currently done.
* Loops work, but not all related optimizations are currently done.
* The cvm linker allows lazy evaluation. It works, but some work is still
* The cvm linker allows lazy evaluation. It works, but some work is still
needed before enabling it by default.
needed before enabling it by default.
* All tests pass with linker=cvm?
* How to have `DEBUG_MODE` check it? Right now, DebugMode checks the computation non-lazily.
* All tests pass with linker=cvm?
* The profiler used by cvm is less complete than `PROFILE_MODE`.
* How to have `DEBUG_MODE` check it? Right now, DebugMode checks the computation non-lazily.
* The profiler used by cvm is less complete than `PROFILE_MODE`.
* SIMD parallelism on the CPU comes from the compiler.
* SIMD parallelism on the CPU comes from the compiler.
* Multi-core parallelism is only supported for gemv and gemm, and only
* Multi-core parallelism is only supported for gemv and gemm, and only
if the external BLAS implementation supports it.
if the external BLAS implementation supports it.
* No multi-node support.
* No multi-node support.
* Many, but not all NumPy functions/aliases are implemented.
* Many, but not all NumPy functions/aliases are implemented.
* http://www.assembla.com/spaces/theano/tickets/781
* http://www.assembla.com/spaces/theano/tickets/781
* Wrapping an existing Python function in easy, but better documentation of
* Wrapping an existing Python function in easy, but better documentation of
it would make it even easier.
it would make it even easier.
* We need to find a way to separate the shared variable memory
* We need to find a way to separate the shared variable memory
...
...
doc/sandbox/randomnumbers.txt
浏览文件 @
9707cf67
.. sandbox_randnb:
..
_
sandbox_randnb:
==============
==============
Random Numbers
Random Numbers
...
...
theano/sandbox/cuda/rng_curand.py
浏览文件 @
9707cf67
...
@@ -311,7 +311,7 @@ class CURAND_RandomStreams(object):
...
@@ -311,7 +311,7 @@ class CURAND_RandomStreams(object):
Return symbolic tensor of normally-distributed numbers.
Return symbolic tensor of normally-distributed numbers.
:param: size: Can be a list of integer or Theano variable(ex: the shape
:param: size: Can be a list of integer or Theano variable(ex: the shape
of other Theano Variable)
of other Theano Variable)
"""
"""
if
isinstance
(
size
,
tuple
):
if
isinstance
(
size
,
tuple
):
msg
=
"size must be a tuple of int or a Theano variable"
msg
=
"size must be a tuple of int or a Theano variable"
...
...
theano/sandbox/linalg/ops.py
浏览文件 @
9707cf67
...
@@ -480,8 +480,8 @@ class MatrixPinv(Op):
...
@@ -480,8 +480,8 @@ class MatrixPinv(Op):
The pseudo-inverse of a matrix A, denoted :math:`A^+`, is
The pseudo-inverse of a matrix A, denoted :math:`A^+`, is
defined as: "the matrix that 'solves' [the least-squares problem]
defined as: "the matrix that 'solves' [the least-squares problem]
:math:`Ax = b`," i.e., if :math:`
\b
ar{x}` is said solution, then
:math:`Ax = b`," i.e., if :math:`
\
\
bar{x}` is said solution, then
:math:`A^+` is that matrix such that :math:`
\b
ar{x} = A^+b`.
:math:`A^+` is that matrix such that :math:`
\
\
bar{x} = A^+b`.
Note that :math:`Ax=AA^+b`, so :math:`AA^+` is close to the identity matrix.
Note that :math:`Ax=AA^+b`, so :math:`AA^+` is close to the identity matrix.
This method is not faster then `matrix_inverse`. Its strength comes from
This method is not faster then `matrix_inverse`. Its strength comes from
...
...
theano/sparse/basic.py
浏览文件 @
9707cf67
...
@@ -861,9 +861,9 @@ class GetItem2d(gof.op.Op):
...
@@ -861,9 +861,9 @@ class GetItem2d(gof.op.Op):
class GetItemScalar that return a tensor scalar.
class GetItemScalar that return a tensor scalar.
:note: that subtensor selection always returns a matrix so
:note: that subtensor selection always returns a matrix so
indexing with [a:b, c:d] is forced. If one index is a scalar,
indexing with [a:b, c:d] is forced. If one index is a scalar,
e.g. x[a:b, c] and x[a, b:c], generate an error. Use instead
e.g. x[a:b, c] and x[a, b:c], generate an error. Use instead
x[a:b, c:c+1] and x[a:a+1, b:c].
x[a:b, c:c+1] and x[a:a+1, b:c].
The above indexing methods are not supported because the rval
The above indexing methods are not supported because the rval
would be a sparse matrix rather than a sparse vector, which is a
would be a sparse matrix rather than a sparse vector, which is a
...
@@ -2136,7 +2136,7 @@ class Usmm(gof.op.Op):
...
@@ -2136,7 +2136,7 @@ class Usmm(gof.op.Op):
alpha is a scalar
alpha is a scalar
:note: We don't implement the infer_shape as it is inserted by optimization
:note: We don't implement the infer_shape as it is inserted by optimization
only
only
"""
"""
def
__eq__
(
self
,
other
):
def
__eq__
(
self
,
other
):
return
type
(
self
)
==
type
(
other
)
return
type
(
self
)
==
type
(
other
)
...
@@ -2204,7 +2204,7 @@ class UsmmCscDense(gof.Op):
...
@@ -2204,7 +2204,7 @@ class UsmmCscDense(gof.Op):
alpha is a scalar
alpha is a scalar
:note: We don't implement the infer_shape as it is inserted by optimization
:note: We don't implement the infer_shape as it is inserted by optimization
only
only
"""
"""
def
__init__
(
self
,
inplace
):
def
__init__
(
self
,
inplace
):
self
.
inplace
=
inplace
self
.
inplace
=
inplace
...
...
theano/tensor/raw_random.py
浏览文件 @
9707cf67
...
@@ -563,7 +563,7 @@ def permutation(random_state, size=None, n=1, ndim=None, dtype='int64'):
...
@@ -563,7 +563,7 @@ def permutation(random_state, size=None, n=1, ndim=None, dtype='int64'):
the size argument and the shape of n, but you may always specify it
the size argument and the shape of n, but you may always specify it
with the `ndim` parameter.
with the `ndim` parameter.
.. note:
:
:note
:
Note that the output will then be of dimension ndim+1.
Note that the output will then be of dimension ndim+1.
"""
"""
ndim
,
size
,
bcast
=
_infer_ndim_bcast
(
ndim
,
size
)
ndim
,
size
,
bcast
=
_infer_ndim_bcast
(
ndim
,
size
)
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论