Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
499b7575
提交
499b7575
authored
10月 02, 2008
作者:
Olivier Breuleux
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
cleaned up klass
上级
5deab31d
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
0 行增加
和
551 行删除
+0
-551
klass.py
sandbox/klass.py
+0
-551
没有找到文件。
sandbox/klass.py
浏览文件 @
499b7575
import
theano
import
theano
from
theano
import
tensor
as
T
from
theano
import
gof
from
theano
import
gof
from
collections
import
defaultdict
from
collections
import
defaultdict
from
itertools
import
chain
from
itertools
import
chain
...
@@ -324,553 +323,3 @@ class KlassInstance(object):
...
@@ -324,553 +323,3 @@ class KlassInstance(object):
self
[
attr
]
=
value
self
[
attr
]
=
value
from
pylearn
import
nnet_ops
as
NN
import
numpy
as
N
# class Regression(Klass):
# def __init__(self, input = None, target = None):
# if not input:
# input = T.matrix('input')
# if not target:
# target = T.matrix('target')
# # PARAMETERS
# self.w = KlassMember(T.matrix()) #the linear transform to apply to our input points
# self.b = KlassMember(T.vector()) #a vector of biases, which make our transform affine instead of linear
# # HYPER-PARAMETERS
# self.l2_coef = KlassMember(T.scalar())
# self.stepsize = KlassMember(T.scalar()) # a stepsize for gradient descent
# # REGRESSION MODEL AND COSTS TO MINIMIZE
# self.prediction = NN.softmax(T.dot(input, self.w) + self.b)
# self.cross_entropy = -T.sum(target * T.log(self.prediction) + (1 - target) * T.log(1 - self.prediction), axis=1)
# self.xe_cost = T.sum(self.cross_entropy)
# self.wreg = self.l2_coef * T.sum(self.w * self.w)
# self.cost = self.xe_cost + self.wreg
# # GET THE GRADIENTS NECESSARY TO FIT OUR PARAMETERS
# self.grad_w, self.grad_b = T.grad(self.cost, [self.w, self.b])
# self.update = KlassMethod([input, target],
# self.cost,
# w = self.w - self.stepsize * self.grad_w,
# b = self.b - self.stepsize * self.grad_b)
# self.apply = KlassMethod(input, self.prediction)
# def initialize(self, obj, input_size = None, target_size = None, **init):
# if (input_size is None) ^ (target_size is None):
# raise ValueError("Must specify input_size and target_size or neither.")
# obj.l2_coef = 0
# super(Regression, self).initialize(obj, **init)
# if input_size is not None:
# obj.w = N.random.uniform(size = (input_size, target_size), low = -0.5, high = 0.5)
# obj.b = N.zeros(target_size)
class
RegressionLayer
(
Klass
):
def
__init__
(
self
,
input
=
None
,
target
=
None
,
regularize
=
True
):
# MODEL CONFIGURATION
self
.
regularize
=
regularize
# ACQUIRE/MAKE INPUT AND TARGET
if
not
input
:
input
=
T
.
matrix
(
'input'
)
if
not
target
:
target
=
T
.
matrix
(
'target'
)
# HYPER-PARAMETERS
self
.
l2_coef
=
KlassMember
(
T
.
scalar
())
self
.
stepsize
=
KlassMember
(
T
.
scalar
())
# a stepsize for gradient descent
# PARAMETERS
self
.
w
=
KlassMember
(
T
.
matrix
())
#the linear transform to apply to our input points
self
.
b
=
KlassMember
(
T
.
vector
())
#a vector of biases, which make our transform affine instead of linear
# REGRESSION MODEL
self
.
activation
=
T
.
dot
(
input
,
self
.
w
)
+
self
.
b
self
.
prediction
=
self
.
build_prediction
()
# CLASSIFICATION COST
self
.
classification_cost
=
self
.
build_classification_cost
(
target
)
# REGULARIZATION COST
self
.
regularization
=
self
.
build_regularization
()
# TOTAL COST
self
.
cost
=
self
.
classification_cost
if
self
.
regularize
:
self
.
cost
=
self
.
cost
+
self
.
regularization
# GET THE GRADIENTS NECESSARY TO FIT OUR PARAMETERS
self
.
grad_w
,
self
.
grad_b
=
T
.
grad
(
self
.
cost
,
[
self
.
w
,
self
.
b
])
# INTERFACE METHODS
self
.
update
=
KlassMethod
([
input
,
target
],
self
.
cost
,
w
=
self
.
w
-
self
.
stepsize
*
self
.
grad_w
,
b
=
self
.
b
-
self
.
stepsize
*
self
.
grad_b
)
self
.
apply
=
KlassMethod
(
input
,
self
.
prediction
)
def
params
(
self
):
return
self
.
w
,
self
.
b
def
initialize
(
self
,
obj
,
input_size
=
None
,
target_size
=
None
,
**
init
):
super
(
RegressionLayer
,
self
)
.
initialize
(
obj
,
**
init
)
if
input_size
and
target_size
:
sz
=
(
input_size
,
target_size
)
obj
.
w
=
N
.
random
.
uniform
(
size
=
sz
,
low
=
-
0.5
,
high
=
0.5
)
obj
.
b
=
N
.
zeros
(
target_size
)
def
build_regularization
(
self
):
return
T
.
zero
()
# no regularization!
class
SoftmaxXERegression
(
RegressionLayer
):
def
build_prediction
(
self
):
return
NN
.
softmax
(
self
.
activation
)
def
build_classification_cost
(
self
,
target
):
self
.
classification_cost_matrix
=
target
*
T
.
log
(
self
.
prediction
)
+
(
1
-
target
)
*
T
.
log
(
1
-
self
.
prediction
)
self
.
classification_costs
=
-
T
.
sum
(
self
.
classification_cost_matrix
,
axis
=
1
)
return
T
.
sum
(
self
.
classification_costs
)
def
build_regularization
(
self
):
return
self
.
l2_coef
*
T
.
sum
(
self
.
w
*
self
.
w
)
#softmax_xe_regression = RegressionLayer(NN.softmax, xe)
class
AutoEncoder
(
Klass
):
def
__init__
(
self
,
input
=
None
,
regularize
=
True
,
tie_weights
=
True
):
# MODEL CONFIGURATION
self
.
regularize
=
regularize
self
.
tie_weights
=
tie_weights
# ACQUIRE/MAKE INPUT
if
not
input
:
input
=
T
.
matrix
(
'input'
)
# HYPER-PARAMETERS
self
.
stepsize
=
KlassMember
(
T
.
scalar
())
self
.
l2_coef
=
KlassMember
(
T
.
scalar
())
# PARAMETERS
self
.
w1
=
KlassMember
(
T
.
matrix
())
if
not
tie_weights
:
self
.
w2
=
KlassMember
(
T
.
matrix
())
else
:
self
.
w2
=
self
.
w1
.
T
self
.
b1
=
KlassMember
(
T
.
vector
())
self
.
b2
=
KlassMember
(
T
.
vector
())
# HIDDEN LAYER
self
.
hidden_activation
=
T
.
dot
(
input
,
self
.
w1
)
+
self
.
b1
self
.
hidden
=
self
.
build_hidden
()
# RECONSTRUCTION LAYER
self
.
output_activation
=
T
.
dot
(
self
.
hidden
,
self
.
w2
)
+
self
.
b2
self
.
output
=
self
.
build_output
()
# RECONSTRUCTION COST
self
.
reconstruction_cost
=
self
.
build_reconstruction_cost
(
input
)
# REGULARIZATION COST
self
.
regularization
=
self
.
build_regularization
()
# TOTAL COST
self
.
cost
=
self
.
reconstruction_cost
if
self
.
regularize
:
self
.
cost
=
self
.
cost
+
self
.
regularization
# GRADIENTS AND UPDATES
params
=
self
.
params
()
gradients
=
T
.
grad
(
self
.
cost
,
params
)
updates
=
dict
((
p
,
p
-
self
.
stepsize
*
g
)
for
p
,
g
in
zip
(
params
,
gradients
))
# INTERFACE METHODS
self
.
update
=
KlassMethod
(
input
,
self
.
cost
,
updates
)
self
.
reconstruction
=
KlassMethod
(
input
,
self
.
output
)
self
.
representation
=
KlassMethod
(
input
,
self
.
hidden
)
def
params
(
self
):
if
self
.
tie_weights
:
return
self
.
w1
,
self
.
b1
,
self
.
b2
else
:
return
self
.
w1
,
self
.
w2
,
self
.
b1
,
self
.
b2
def
initialize
(
self
,
obj
,
input_size
=
None
,
hidden_size
=
None
,
**
init
):
if
(
input_size
is
None
)
^
(
hidden_size
is
None
):
raise
ValueError
(
"Must specify hidden_size and target_size or neither."
)
obj
.
l2_coef
=
0
super
(
AutoEncoder
,
self
)
.
initialize
(
obj
,
**
init
)
if
input_size
is
not
None
:
sz
=
(
input_size
,
hidden_size
)
obj
.
w1
=
N
.
random
.
uniform
(
size
=
sz
,
low
=
-
0.5
,
high
=
0.5
)
if
not
self
.
tie_weights
:
obj
.
w2
=
N
.
random
.
uniform
(
size
=
list
(
reversed
(
sz
)),
low
=
-
0.5
,
high
=
0.5
)
obj
.
b1
=
N
.
zeros
(
hidden_size
)
obj
.
b2
=
N
.
zeros
(
input_size
)
def
build_regularization
(
self
):
return
T
.
zero
()
# no regularization!
class
SigmoidXEAutoEncoder
(
AutoEncoder
):
def
build_hidden
(
self
):
return
NN
.
sigmoid
(
self
.
hidden_activation
)
def
build_output
(
self
):
return
NN
.
sigmoid
(
self
.
output_activation
)
def
build_reconstruction_cost
(
self
,
input
):
self
.
reconstruction_cost_matrix
=
input
*
T
.
log
(
self
.
output
)
+
(
1
-
input
)
*
T
.
log
(
1
-
self
.
output
)
self
.
reconstruction_costs
=
-
T
.
sum
(
self
.
reconstruction_cost_matrix
,
axis
=
1
)
return
T
.
sum
(
self
.
reconstruction_costs
)
def
build_regularization
(
self
):
if
self
.
tie_weights
:
return
self
.
l2_coef
*
T
.
sum
(
self
.
w1
*
self
.
w1
)
else
:
return
self
.
l2_coef
*
T
.
sum
(
self
.
w1
*
self
.
w1
)
+
T
.
sum
(
self
.
w2
*
self
.
w2
)
class
Stacker
(
Klass
):
def
__init__
(
self
,
metaklasses
,
input
=
None
,
target
=
None
,
regularize
=
False
):
current
=
input
self
.
layers
=
[]
for
i
,
(
metaklass
,
outname
)
in
enumerate
(
metaklasses
):
layer
=
metaklass
(
current
,
regularize
=
regularize
)
self
.
layers
.
append
(
layer
)
setattr
(
self
,
"layer
%
i"
%
(
i
+
1
),
layer
)
current
=
getattr
(
current
,
outname
)
self
.
output
=
current
self
.
classification_cost
=
self
.
build_classification_cost
()
self
.
regularization
=
self
.
build_regularization
()
self
.
cost
=
self
.
classification_cost
if
regularize
:
self
.
cost
=
self
.
cost
+
self
.
regularization
params
=
self
.
params
()
gradients
=
T
.
grad
(
self
.
cost
,
params
)
updates
=
dict
((
p
,
p
-
self
.
stepsize
*
g
)
for
p
,
g
in
zip
(
params
,
gradients
))
# INTERFACE METHODS
self
.
update
=
KlassMethod
(
input
,
self
.
cost
,
updates
)
self
.
compute
=
KlassMethod
(
input
,
self
.
output
)
# r = SoftmaxXERegression(regularize = False)
# o = r.make(mode = 'FAST_RUN',
# input_size = 4,
# target_size = 2,
# stepsize = 0.1)
# inputs = N.asarray([[x%2,(x>>1)%2,(x>>2)%2,(x>>3)%2] for x in xrange(16)])
# targets = N.asarray([[1, 0] if (x>>1)%2 else [0, 1] for x in xrange(16)])
# print o.w
# for i in xrange(100):
# o.update(inputs, targets)
# print N.hstack([targets, o.apply(inputs)]).round()
# aa = SigmoidXEAutoEncoder(tie_weights = True)
# o = aa.make(mode = 'FAST_RUN',
# input_size = 4,
# hidden_size = 2,
# stepsize = 0.1)
# inputs = N.asarray([[x%2,(x>>1)%2,(x>>2)%2,(x>>3)%2] for x in xrange(16) if x % 2])
# print o.w1
# #print o.w2
# for i in xrange(1000):
# o.update(inputs)
# print N.hstack([inputs, o.reconstruction(inputs)]).round()
# print o.representation(inputs)
# def make_incdec_klass():
# k = Klass()
# n = T.scalar('n')
# k.c = KlassMember(T.scalar()) # state variables must be wrapped with KlassMember
# k.inc = KlassMethod(n, [], c = k.c + n) # k.c <= k.c + n
# k.dec = KlassMethod(n, [], c = k.c - n) # k.c <= k.c - n
# k.plus10 = KlassMethod([], k.c + 10) # k.c is always accessible since it is a member of this klass
# return k
# k = Klass()
# k.incdec1 = make_incdec_klass()
# k.incdec2 = make_incdec_klass()
# k.sum = KlassMethod([], k.incdec1.c + k.incdec2.c)
# inst = k.make(**{'incdec1.c': 0, 'incdec2.c': 0}) # I'm considering allowing k.make(incdec1__c = 0, incdec2__c = 0)... thoughts?
# inst.incdec1.inc(2)
# inst.incdec1.dec(4)
# inst.incdec2.inc(6)
# assert inst.incdec1.c == -2 and inst.incdec2.c == 6
# assert inst.sum() == 4 # -2 + 6
# print inst.sum(), inst.incdec1.c, inst.incdec2.c
# k = Klass()
# k.x, k.y = T.scalars('xy')
# k.z = k.x + k.y
# k.s = KlassMember(T.scalar())
# k.f = KlassMethod(['x', 'y'], 'z', s = k.x)
# k2 = Klass()
# k2.paf = k
# k2.x, k2.y = T.scalars('ab')
# k2.z = k2.x + k2.y + k.s
# k2.t = KlassMember(T.scalar())
# k2.f = KlassMethod(['x', 'y'], k2.z, {k2.t: k2.t + 3, k.s: k.s + 5})
# obj = k2.make(**{'paf.s': 2, 't': 3})
# print obj.t, obj.paf.s
# print obj.f(7, 8)
# print obj.t, obj.paf.s
# print obj.paf.f(1, 2)
# print obj.t, obj.paf.s
# print obj['paf.s']
# print obj[k2.paf.s]
# class AutoEncoder(Klass):
# def __init__(self, activation_function):
# self.activation_function = activation_function
# def build(__self, input):
# self = copy(__self)
# self.input = input
# self.W1, self.W2 = T.matrices(2)
# self.b1, self.b2 = T.vectors(2)
# self.lr = T.scalar()
# return self
# def initialize(self, nhid...):
# pass
# class Stacker(Klass):
# def build(self, input, target, *builders):
# self.input, self.target = input, target
# self.lr = T.scalar()
# current = self.input
# layers = []
# for i, builder in enumerate(builders):
# layer = builder(current)
# layers.append(layer)
# setattr(self, 'layer%i' % (i+1), layer)
# current = layer.hidden
# self.output = current.output
# self.update = KlassMethod(['input', 'target'], 'cost')
# model = Stacker(AutoEncoder, AutoEncoder, NNLayer)
# model.var = T.mean(T.sqr(model.costs)) - T.sqr(model.cost)
# model.variance = KlassMethod(['input', 'target'], 'var')
# model.var_stor = T.scalar()
# model.update.extend(var_stor = model.var)
# class Stacked(Klass):
# def __init__(self, x, y, stepsize):
# lay1 = Regression(x, y)
# lay2 = Regression(lay1.interesting_representation, y)
# cost1 = lay1.cost + lay2coef * lay2.cost
# cost2 = lay2.cost
# cost3 = rbm_interpreation_cost(lay2)
# T.sum(lay2.cross_entropy) + l2_coef * (T.sum(T.sum(w1*w1)) + T.sum(T.sum(w2*w2)))
# self.update = KlassMethod([x, y, stepsize],
# lay2.cost,
# **{lay1.w: lay1.w - stepsize * grad_w1,
# etc})
# def initialize_storage(self, stor):
# stor = super().initialize_storage(stor)
# stor.lay1.b = stor.lay2.b
# def _instance_print_w(self):
# print self.w.value
# class LinReg(object):
# __metaklass__ = Stacked
# def __init__(self, x, y):
# #make... initialize, allocate... blah blah blah
# def print_w(self):
# #
# # GET THE GRADIENTS NECESSARY TO FIT OUR PARAMETERS
# update_fn = theano.function(
# inputs = [x, y, stepsize,
# In(w,
# name='w',
# value=numpy.zeros((n_in, n_out)),
# update=w - stepsize * grad_w,
# mutable=True,
# strict=True)
# In(b,
# name='b',
# value=numpy.zeros(n_out),
# update=b - lr * grad_b,
# mutable=True,
# strict=True)
# ],
# outputs = cost,
# mode = 'EXPENSIVE_OPTIMIZATIONS')
# apply_fn = theano.function(
# inputs = [x, In(w, value=update_fn.storage[w]), In(b, value=update_fn.storage[b])],
# outputs = [prediction])
# return update_fn, apply_fn
# class AutoEncoder(Klass):
# # def __init__(self, activation_function, cost_function, tie_weights = True):
# # self.activation_function = activation_function
# # self.cost_function = cost_function
# # self.tie_weights = tie_weights
# def __init__(self, input = None, tie_weights = True):
# self.tie_weights = tie_weights
# if not input:
# input = T.matrix('input')
# self.stepsize = KlassMember(T.scalar())
# self.l2_coef = KlassMember(T.scalar())
# self.code = SoftmaxXERegression(input) #RegressionLayer(self.activation_function, self.cost_function).build(input)
# self.hidden = self.code.prediction
# self.decode = SoftmaxXERegression(self.hidden, transpose_weights = True) #RegressionLayer(self.activation_function, self.cost_function, code.w.T).build(self.hidden)
# self.rec = self.decode.prediction
# self.build_classification_cost(input)
# self.grad_w1, self.grad_w2, self.grad_b1, self.grad_b2 = \
# T.grad(self.cost, [self.code.w, self.decode.w, self.code.b, self.decode.b])
# if self.tie_weights:
# self.update = KlassMethod(input,
# self.cost,
# {self.code.w: self.code.w - self.stepsize * (self.grad_w1 + self.grad_w2),
# self.code.b: self.code.b - self.stepsize * self.grad_b1,
# self.decode.b: self.decode.b - self.stepsize * self.grad_b2})
# else:
# self.update = KlassMethod(input,
# self.cost,
# {self.code.w: self.code.w - self.stepsize * self.grad_w1,
# self.code.b: self.code.b - self.stepsize * self.grad_b1,
# self.decode.w: self.decode.w - self.stepsize * self.grad_w2,
# self.decode.b: self.decode.b - self.stepsize * self.grad_b2})
# self.reconstruction = KlassMethod(input, self.rec)
# self.representation = KlassMethod(input, self.hidden)
# return self
# def initialize_storage(self, stor):
# super(AutoEncoder, self).initialize_storage(stor)
# if self.tie_weights:
# stor.decode.w = stor.code.w
# def initialize(self, obj, input_size = None, hidden_size = None, **init):
# if (input_size is None) ^ (hidden_size is None):
# raise ValueError("Must specify input_size and hidden_size or neither.")
# obj.l2_coef = 0
# super(AutoEncoder, self).initialize(obj, **init)
# if input_size is not None:
# reg = RegressionLayer(self.activation_function, self.cost_function)
# reg.initialize(obj.code, input_size, hidden_size, stepsize = obj.stepsize)
# reg2 = RegressionLayer(self.activation_function, self.cost_function, transpose_weights = True)
# reg2.initialize(obj.decode, hidden_size, input_size, stepsize = obj.stepsize)
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论