Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
5fe09585
提交
5fe09585
authored
4月 07, 2015
作者:
Sina Honari
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
correcting the code part of faq.txt
上级
77e4a15b
显示空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
27 行增加
和
27 行删除
+27
-27
faq.txt
doc/tutorial/faq.txt
+27
-27
没有找到文件。
doc/tutorial/faq.txt
浏览文件 @
5fe09585
...
...
@@ -2,9 +2,9 @@
===========================
Frequently Asked Questions
===========================
Updating a Subset of Weights
=============================
===========================
=======
How to update a subset of weights?
=============================
=====
If you want to update only a subset of a weight matrix (such as
some rows or some columns) that are used in the forward propogation
of this iteration, then the cost function should be defined in a way
...
...
@@ -18,36 +18,36 @@ iteration only the rows of the matrix should get updated that their
corresponding words were used in the forward propogation. Here is
how the theano function should be written:
# defining a shared variable for the lookup table
>>>
# defining a shared variable for the lookup table
>>> lookup_table = theano.shared(matrix_ndarray).
# getting a subset of the table (some rows
# or some columns) by passing an integer vector of
# indices corresponding to those rows or columns.
>>>
>>>
# getting a subset of the table (some rows
>>>
# or some columns) by passing an integer vector of
>>>
# indices corresponding to those rows or columns.
>>> slice = lookup_table[vector_of_indeces]
# From now on, use only 'slice'.
# Do not call lookup_table[vector_of_indeces] again.
# This causes problems with grad as this will create new variables.
# defining cost which depends only on slice
# and not the entire lookup_table
>>>
>>>
# From now on, use only 'slice'.
>>>
# Do not call lookup_table[vector_of_indeces] again.
>>>
# This causes problems with grad as this will create new variables.
>>>
>>>
# defining cost which depends only on slice
>>>
# and not the entire lookup_table
>>> cost = something that depends on slice
>>> g = theano.grad(cost, slice)
# There are two ways for updating the parameters:
# either use inc_subtensor or set_subtensor.
# It is recommended to use inc_subtensor.
# Some theano optimizations do the conversion between
# the two functions, but not in all cases.
>>>
>>>
# There are two ways for updating the parameters:
>>>
# either use inc_subtensor or set_subtensor.
>>>
# It is recommended to use inc_subtensor.
>>>
# Some theano optimizations do the conversion between
>>>
# the two functions, but not in all cases.
>>> updates = inc_subtensor(slice, g*lr)
# OR
>>>
# OR
>>> updates = set_subtensor(slice, slice + g*lr)
# Note that currently we just cover the case here,
# not if you use inc_subtensor or set_subtensor with other types of indexing.
#defining the theano function
>>>
>>>
# Note that currently we just cover the case here,
>>>
# not if you use inc_subtensor or set_subtensor with other types of indexing.
>>>
>>>
#defining the theano function
>>> f=theano.function(..., update=updates)
Note that you can compute the gradient of the cost function w.r.t.
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论