Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
7611ad68
提交
7611ad68
authored
6月 26, 2015
作者:
Frédéric Bastien
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #3046 from harlouci/flake8
Flake8 for files in sandbox
上级
c855e8d6
37be8c4b
隐藏空白字符变更
内嵌
并排
正在显示
7 个修改的文件
包含
99 行增加
和
105 行删除
+99
-105
fourier.py
theano/sandbox/fourier.py
+15
-12
minimal.py
theano/sandbox/minimal.py
+6
-3
multinomial.py
theano/sandbox/multinomial.py
+2
-3
neighbourhoods.py
theano/sandbox/neighbourhoods.py
+63
-75
neighbours.py
theano/sandbox/neighbours.py
+3
-1
solve.py
theano/sandbox/solve.py
+10
-5
test_flake8.py
theano/tests/test_flake8.py
+0
-6
没有找到文件。
theano/sandbox/fourier.py
浏览文件 @
7611ad68
"""Provides Ops for FFT and DCT.
"""
from
theano.gof
import
Op
,
Apply
,
generic
from
theano
import
tensor
import
numpy.fft
import
numpy
import
numpy.fft
from
six.moves
import
xrange
from
theano
import
tensor
from
theano.gof
import
Op
,
Apply
,
generic
class
GradTodo
(
Op
):
def
make_node
(
self
,
x
):
return
Apply
(
self
,
[
x
],
[
x
.
type
()])
def
perform
(
self
,
node
,
inputs
,
outputs
):
raise
NotImplementedError
(
'TODO'
)
grad_todo
=
GradTodo
()
...
...
@@ -45,8 +46,9 @@ class FFT(Op):
self
.
inverse
=
inverse
def
__eq__
(
self
,
other
):
return
type
(
self
)
==
type
(
other
)
and
(
self
.
half
==
other
.
half
)
and
(
self
.
inverse
==
other
.
inverse
)
return
(
type
(
self
)
==
type
(
other
)
and
self
.
half
==
other
.
half
and
self
.
inverse
==
other
.
inverse
)
def
__hash__
(
self
):
return
hash
(
type
(
self
))
^
hash
(
self
.
half
)
^
9828743
^
(
self
.
inverse
)
...
...
@@ -77,21 +79,22 @@ class FFT(Op):
else
:
fft_fn
=
numpy
.
fft
.
fft
fft
=
fft_fn
(
frames
,
int
(
n
),
int
(
axis
))
fft
=
fft_fn
(
frames
,
int
(
n
),
int
(
axis
))
if
self
.
half
:
M
,
N
=
fft
.
shape
if
axis
==
0
:
if
(
M
%
2
):
raise
ValueError
(
'halfFFT on odd-length vectors is undefined'
)
spectrogram
[
0
]
=
fft
[
0
:
M
/
2
,
:]
spectrogram
[
0
]
=
fft
[
0
:
M
/
2
,
:]
elif
axis
==
1
:
if
(
N
%
2
):
raise
ValueError
(
'halfFFT on odd-length vectors is undefined'
)
spectrogram
[
0
]
=
fft
[:,
0
:
N
/
2
]
spectrogram
[
0
]
=
fft
[:,
0
:
N
/
2
]
else
:
raise
NotImplementedError
()
else
:
spectrogram
[
0
]
=
fft
def
grad
(
self
,
inp
,
out
):
frames
,
n
,
axis
=
inp
g_spectrogram
,
g_buf
=
out
...
...
@@ -112,9 +115,9 @@ def dct_matrix(rows, cols, unitary=True):
"""
rval
=
numpy
.
zeros
((
rows
,
cols
))
col_range
=
numpy
.
arange
(
cols
)
scale
=
numpy
.
sqrt
(
2.0
/
cols
)
scale
=
numpy
.
sqrt
(
2.0
/
cols
)
for
i
in
xrange
(
rows
):
rval
[
i
]
=
numpy
.
cos
(
i
*
(
col_range
*
2
+
1
)
/
(
2.0
*
cols
)
*
numpy
.
pi
)
*
scale
rval
[
i
]
=
numpy
.
cos
(
i
*
(
col_range
*
2
+
1
)
/
(
2.0
*
cols
)
*
numpy
.
pi
)
*
scale
if
unitary
:
rval
[
0
]
*=
numpy
.
sqrt
(
0.5
)
...
...
theano/sandbox/minimal.py
浏览文件 @
7611ad68
from
__future__
import
print_function
import
numpy
,
scipy
.
linalg
from
theano
import
gof
,
tensor
,
scalar
,
function
import
unittest
import
numpy
from
theano
import
gof
,
tensor
,
function
from
theano.tests
import
unittest_tools
as
utt
class
Minimal
(
gof
.
Op
):
...
...
@@ -49,7 +53,6 @@ minimal = Minimal()
# TODO: test dtype conversion
# TODO: test that invalid types are rejected by make_node
# TODO: test that each valid type for A and b works correctly
from
theano.tests
import
unittest_tools
as
utt
class
T_minimal
(
unittest
.
TestCase
):
...
...
theano/sandbox/multinomial.py
浏览文件 @
7611ad68
...
...
@@ -155,7 +155,6 @@ class MultinomialFromUniform(Op):
unis_n
=
unis
[
n
]
for
m
in
range
(
nb_outcomes
):
z_nm
=
z
[
0
][
n
,
m
]
cummul
+=
pvals
[
n
,
m
]
if
(
waiting
and
(
cummul
>
unis_n
)):
z
[
0
][
n
,
m
]
=
1
...
...
@@ -356,8 +355,8 @@ def local_gpu_multinomial(node):
return
[
host_from_gpu
(
gpu_op
(
*
[
gpu_from_host
(
i
)
for
i
in
node
.
inputs
]))
.
T
]
if
(
isinstance
(
node
.
op
,
theano
.
sandbox
.
cuda
.
GpuFromHost
)
and
node
.
inputs
[
0
]
.
owner
and
type
(
node
.
inputs
[
0
]
.
owner
.
op
)
is
MultinomialFromUniform
):
node
.
inputs
[
0
]
.
owner
and
type
(
node
.
inputs
[
0
]
.
owner
.
op
)
is
MultinomialFromUniform
):
multi
=
node
.
inputs
[
0
]
.
owner
p
,
u
=
multi
.
inputs
m
,
=
multi
.
outputs
...
...
theano/sandbox/neighbourhoods.py
浏览文件 @
7611ad68
#!/usr/bin/python
"""WARNING: This code is not recommanded. It is not finished, it is
slower then the version in sandbox/neighbours.py, and it do not work
on the GPU.
...
...
@@ -8,17 +7,17 @@ it cover more cases. But thoses cases aren't needed frequently, so you
probably don't want to use this version, go see neighbours.py!!!!!!!
"""
import
theano
from
theano
import
gof
,
Op
,
tensor
,
Variable
,
Apply
import
numpy
from
six.moves
import
xrange
import
six.moves.builtins
as
builtins
import
theano
from
theano
import
gof
,
Op
class
NeighbourhoodsFromImages
(
Op
):
def
__init__
(
self
,
n_dims_before
,
dims_neighbourhoods
,
strides
=
None
,
ignore_border
=
False
,
inverse
=
False
):
strides
=
None
,
ignore_border
=
False
,
inverse
=
False
):
"""
This extracts neighbourhoods from "images", but in a
dimension-generic manner.
...
...
@@ -75,7 +74,7 @@ class NeighbourhoodsFromImages(Op):
"""
self
.
n_dims_before
=
n_dims_before
self
.
dims_neighbourhoods
=
dims_neighbourhoods
if
not
strides
is
None
:
if
strides
is
not
None
:
self
.
strides
=
strides
else
:
self
.
strides
=
dims_neighbourhoods
...
...
@@ -85,35 +84,26 @@ class NeighbourhoodsFromImages(Op):
self
.
code_string
,
self
.
code
=
self
.
make_py_code
()
def
_compute_neigh_strides
(
self
):
neigh_strides
=
[
1
for
i
in
xrange
(
len
(
self
.
strides
))]
cur_stride
=
1
for
i
in
xrange
(
len
(
self
.
strides
)
-
1
,
-
1
,
-
1
):
neigh_strides
[
i
]
=
cur_stride
cur_stride
*=
self
.
dims_neighbourhoods
[
i
]
return
neigh_strides
def
__eq__
(
self
,
other
):
return
type
(
self
)
==
type
(
other
)
and
\
self
.
n_dims_before
==
other
.
n_dims_before
and
\
self
.
dims_neighbourhoods
==
other
.
dims_neighbourhoods
and
\
self
.
strides
==
other
.
strides
and
\
self
.
ignore_border
==
other
.
ignore_border
self
.
n_dims_before
==
other
.
n_dims_before
and
\
self
.
dims_neighbourhoods
==
other
.
dims_neighbourhoods
and
\
self
.
strides
==
other
.
strides
and
\
self
.
ignore_border
==
other
.
ignore_border
def
__hash__
(
self
):
return
hash
(
type
(
self
))
^
\
hash
(
self
.
n_dims_before
)
^
\
hash
(
self
.
dims_neighbourhoods
)
^
\
hash
(
self
.
strides
)
^
\
hash
(
self
.
ignore_border
)
hash
(
self
.
n_dims_before
)
^
\
hash
(
self
.
dims_neighbourhoods
)
^
\
hash
(
self
.
strides
)
^
\
hash
(
self
.
ignore_border
)
def
__str__
(
self
):
return
'
%
s{
%
s,
%
s,
%
s,
%
s}'
%
\
(
self
.
__class__
.
__name__
,
self
.
n_dims_before
,
self
.
dims_neighbourhoods
,
self
.
strides
,
self
.
ignore_border
)
return
'
%
s{
%
s,
%
s,
%
s,
%
s}'
%
(
self
.
__class__
.
__name__
,
self
.
n_dims_before
,
self
.
dims_neighbourhoods
,
self
.
strides
,
self
.
ignore_border
)
def
out_shape
(
self
,
input_shape
):
dims
=
list
(
input_shape
[:
self
.
n_dims_before
])
...
...
@@ -163,12 +153,12 @@ class NeighbourhoodsFromImages(Op):
x
=
theano
.
tensor
.
as_tensor_variable
(
x
)
if
self
.
inverse
:
# +1 in the inverse case
if
x
.
type
.
ndim
!=
(
self
.
n_dims_before
+
\
len
(
self
.
dims_neighbourhoods
)
+
1
):
if
x
.
type
.
ndim
!=
(
self
.
n_dims_before
+
len
(
self
.
dims_neighbourhoods
)
+
1
):
raise
TypeError
()
else
:
if
x
.
type
.
ndim
!=
(
self
.
n_dims_before
+
\
len
(
self
.
dims_neighbourhoods
)):
if
x
.
type
.
ndim
!=
(
self
.
n_dims_before
+
len
(
self
.
dims_neighbourhoods
)):
raise
TypeError
()
return
gof
.
Apply
(
self
,
[
x
],
[
x
.
type
()])
...
...
@@ -177,22 +167,24 @@ class NeighbourhoodsFromImages(Op):
z
,
=
out
if
self
.
inverse
:
# +1 in the inverse case
if
len
(
x
.
shape
)
!=
(
self
.
n_dims_before
+
\
len
(
self
.
dims_neighbourhoods
)
+
1
):
raise
ValueError
(
"Images passed as input don't match the "
+
\
"dimensions passed when this (inversed) Apply node was created"
)
if
len
(
x
.
shape
)
!=
(
self
.
n_dims_before
+
len
(
self
.
dims_neighbourhoods
)
+
1
):
raise
ValueError
(
"Images passed as input don't match the "
"dimensions passed when this (inversed) "
"Apply node was created"
)
prod
=
1
for
dim
in
self
.
dims_neighbourhoods
:
prod
*=
dim
if
x
.
shape
[
-
1
]
!=
prod
:
raise
ValueError
(
(
"Last dimension of neighbourhoods (
%
s) is not "
+
\
"the product of the neighbourhoods dimensions (
%
s)"
)
%
\
(
str
(
x
.
shape
[
-
1
]),
str
(
prod
)))
raise
ValueError
(
"Last dimension of neighbourhoods (
%
s) is not"
" the product of the neighbourhoods dimensions"
" (
%
s)"
%
(
str
(
x
.
shape
[
-
1
]),
str
(
prod
)))
else
:
if
len
(
x
.
shape
)
!=
(
self
.
n_dims_before
+
\
len
(
self
.
dims_neighbourhoods
)):
raise
ValueError
(
"Images passed as input don't match the "
+
\
"dimensions passed when this Apply node was created"
)
if
len
(
x
.
shape
)
!=
(
self
.
n_dims_before
+
len
(
self
.
dims_neighbourhoods
)):
raise
ValueError
(
"Images passed as input don't match the "
"dimensions passed when this Apply node "
"was created"
)
if
self
.
inverse
:
input_shape
,
num_strides
=
self
.
in_shape
(
x
.
shape
)
...
...
@@ -201,8 +193,6 @@ class NeighbourhoodsFromImages(Op):
input_shape
=
x
.
shape
out_shape
,
num_strides
=
self
.
out_shape
(
input_shape
)
neigh_strides
=
self
.
_compute_neigh_strides
()
if
z
[
0
]
is
None
:
if
self
.
inverse
:
z
[
0
]
=
numpy
.
zeros
(
input_shape
)
...
...
@@ -228,45 +218,42 @@ class NeighbourhoodsFromImages(Op):
return
code_before
def
_py_innerloop
(
self
,
inner_dim_no
):
base_indent
=
(
'
\t
'
*
(
self
.
n_dims_before
+
inner_dim_no
*
2
))
base_indent
=
(
'
\t
'
*
(
self
.
n_dims_before
+
inner_dim_no
*
2
))
code_before
=
base_indent
+
\
"for stride_idx_
%
d in xrange(num_strides[
%
d]):
\n
"
%
\
(
inner_dim_no
,
inner_dim_no
)
"for stride_idx_
%
d in xrange(num_strides[
%
d]):
\n
"
%
\
(
inner_dim_no
,
inner_dim_no
)
base_indent
+=
'
\t
'
code_before
+=
base_indent
+
\
"dim_
%
d_offset = stride_idx_
%
d * self.strides[
%
d]
\n
"
%
\
(
inner_dim_no
,
inner_dim_no
,
inner_dim_no
)
"dim_
%
d_offset = stride_idx_
%
d * self.strides[
%
d]
\n
"
%
\
(
inner_dim_no
,
inner_dim_no
,
inner_dim_no
)
code_before
+=
base_indent
+
\
"max_neigh_idx_
%
d = input_shape[
%
d] - dim_
%
d_offset
\n
"
%
\
(
inner_dim_no
,
self
.
n_dims_before
+
inner_dim_no
,
inner_dim_no
)
"max_neigh_idx_
%
d = input_shape[
%
d] - dim_
%
d_offset
\n
"
%
\
(
inner_dim_no
,
self
.
n_dims_before
+
inner_dim_no
,
inner_dim_no
)
code_before
+=
base_indent
+
\
(
"for neigh_idx_
%
d in xrange(min(max_neigh_idx_
%
d,"
\
+
" self.dims_neighbourhoods[
%
d])):
\n
"
)
%
\
(
inner_dim_no
,
inner_dim_no
,
inner_dim_no
)
(
"for neigh_idx_
%
d in xrange(min(max_neigh_idx_
%
d,"
" self.dims_neighbourhoods[
%
d])):
\n
"
)
%
\
(
inner_dim_no
,
inner_dim_no
,
inner_dim_no
)
return
code_before
def
_py_flattened_idx
(
self
):
return
"+"
.
join
([
"neigh_strides[
%
d]*neigh_idx_
%
d"
%
(
i
,
i
)
\
for
i
in
xrange
(
len
(
self
.
strides
))])
return
"+"
.
join
([
"neigh_strides[
%
d]*neigh_idx_
%
d"
%
(
i
,
i
)
for
i
in
xrange
(
len
(
self
.
strides
))])
def
_py_assignment
(
self
):
input_idx
=
""
.
join
([
"outer_idx_
%
d,"
%
(
i
,)
\
for
i
in
xrange
(
self
.
n_dims_before
)])
input_idx
+=
""
.
join
([
"dim_
%
d_offset+neigh_idx_
%
d,"
%
\
(
i
,
i
)
for
i
in
xrange
(
len
(
self
.
strides
))])
out_idx
=
""
.
join
(
\
[
"outer_idx_
%
d,"
%
(
i
,)
for
i
in
\
xrange
(
self
.
n_dims_before
)]
+
\
[
"stride_idx_
%
d,"
%
(
i
,)
for
i
in
\
xrange
(
len
(
self
.
strides
))])
input_idx
=
""
.
join
([
"outer_idx_
%
d,"
%
(
i
,)
for
i
in
xrange
(
self
.
n_dims_before
)])
input_idx
+=
""
.
join
([
"dim_
%
d_offset+neigh_idx_
%
d,"
%
(
i
,
i
)
for
i
in
xrange
(
len
(
self
.
strides
))])
out_idx
=
""
.
join
(
[
"outer_idx_
%
d,"
%
(
i
,)
for
i
in
xrange
(
self
.
n_dims_before
)]
+
[
"stride_idx_
%
d,"
%
(
i
,)
for
i
in
xrange
(
len
(
self
.
strides
))])
out_idx
+=
self
.
_py_flattened_idx
()
#return_val = '\t' * (self.n_dims_before + len(self.strides)*2)
#return_val += "print "+input_idx+"'\\n',"+out_idx+"\n"
#
return_val = '\t' * (self.n_dims_before + len(self.strides)*2)
#
return_val += "print "+input_idx+"'\\n',"+out_idx+"\n"
return_val
=
'
\t
'
*
(
self
.
n_dims_before
+
len
(
self
.
strides
)
*
2
)
return_val
=
'
\t
'
*
(
self
.
n_dims_before
+
len
(
self
.
strides
)
*
2
)
if
self
.
inverse
:
# remember z and x are inversed:
...
...
@@ -281,9 +268,10 @@ class NeighbourhoodsFromImages(Op):
class
ImagesFromNeighbourhoods
(
NeighbourhoodsFromImages
):
def
__init__
(
self
,
n_dims_before
,
dims_neighbourhoods
,
strides
=
None
,
ignore_border
=
False
):
NeighbourhoodsFromImages
.
__init__
(
self
,
n_dims_before
,
dims_neighbourhoods
,
strides
=
strides
,
ignore_border
=
ignore_border
,
inverse
=
True
)
strides
=
None
,
ignore_border
=
False
):
NeighbourhoodsFromImages
.
__init__
(
self
,
n_dims_before
,
dims_neighbourhoods
,
strides
=
strides
,
ignore_border
=
ignore_border
,
inverse
=
True
)
# and that's all there is to it
theano/sandbox/neighbours.py
浏览文件 @
7611ad68
...
...
@@ -3,4 +3,6 @@ Neighbours was moved into theano.tensor.nnet.neighbours.
This file was created for compatibility.
"""
from
theano.tensor.nnet.neighbours
import
(
images2neibs
,
neibs2images
,
Images2Neibs
)
Images2Neibs
)
__all__
=
[
"images2neibs"
,
"neibs2images"
,
"Images2Neibs"
]
theano/sandbox/solve.py
浏览文件 @
7611ad68
from
__future__
import
print_function
import
numpy
,
scipy
.
linalg
from
theano
import
gof
,
tensor
,
scalar
import
unittest
import
sys
import
numpy
import
scipy.linalg
import
theano
from
theano
import
gof
,
tensor
,
scalar
from
theano.tests
import
unittest_tools
as
utt
class
Solve
(
gof
.
Op
):
...
...
@@ -32,7 +39,7 @@ class Solve(gof.Op):
raise
TypeError
(
"b must be a matrix or vector"
,
b_
.
type
)
odtype
=
scalar
.
upcast
(
A_
.
dtype
,
b_
.
dtype
)
otype
=
tensor
.
TensorType
(
broadcastable
=
b_
.
broadcastable
,
dtype
=
odtype
)
return
gof
.
Apply
(
op
=
self
,
inputs
=
[
A
,
B
],
outputs
=
[
otype
()])
return
gof
.
Apply
(
op
=
self
,
inputs
=
[
A
_
,
b_
],
outputs
=
[
otype
()])
def
perform
(
self
,
node
,
inp
,
out
):
A
,
b
=
inp
...
...
@@ -49,8 +56,6 @@ solve = Solve()
# TODO: test dtype conversion
# TODO: test that invalid types are rejected by make_node
# TODO: test that each valid type for A and b works correctly
from
theano.tests
import
unittest_tools
as
utt
class
T_solve
(
unittest
.
TestCase
):
def
setUp
(
self
):
...
...
theano/tests/test_flake8.py
浏览文件 @
7611ad68
...
...
@@ -136,20 +136,14 @@ whitelist_flake8 = [
"sandbox/test_theano_object.py"
,
"sandbox/test_scan.py"
,
"sandbox/rng_mrg.py"
,
"sandbox/solve.py"
,
"sandbox/theano_object.py"
,
"sandbox/scan.py"
,
"sandbox/multinomial.py"
,
"sandbox/neighbourhoods.py"
,
"sandbox/fourier.py"
,
"sandbox/test_multinomial.py"
,
"sandbox/minimal.py"
,
"sandbox/test_rng_mrg.py"
,
"sandbox/test_neighbourhoods.py"
,
"sandbox/symbolic_module.py"
,
"sandbox/conv.py"
,
"sandbox/debug.py"
,
"sandbox/neighbours.py"
,
"sandbox/cuda/dnn.py"
,
"sandbox/cuda/var.py"
,
"sandbox/cuda/GpuConvGrad3D.py"
,
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论