码迷,mamicode.com
首页 >  
搜索关键字:deep    ( 1999个结果
[转载]Deep Learning(深度学习)学习笔记整理
转载自:http://blog.csdn.net/zouxy09/article/details/8775360感谢原作者:zouxy09@qq.com八、Deep learning训练过程8.1、传统神经网络的训练方法为什么不能用在深度神经网络 BP算法作为传统训练多层网络的典型算法,实际上对仅含...
分类:其他好文   时间:2015-05-06 22:28:47    阅读次数:323
【Deeplearning】关注书目
Deep Learning: A Practitioner's Approachhttp://www.amazon.com/Deep-Learning-Practitioners-Adam-Gibson/dp/1491914254/ref=sr_1_1?ie=UTF8&qid=1430704761&...
分类:其他好文   时间:2015-05-04 11:29:26    阅读次数:129
Initialization of deep networks
Initialization of deep networks24 Feb 2015Gustav LarssonAs we all know, the solution to a non-convex optimization algorithm (like stochastic gradient ...
分类:Web程序   时间:2015-05-02 13:44:49    阅读次数:167
DEEP LEARNING WITH STRUCTURE
DEEP LEARNING WITH STRUCTURECharlie Tang is aPhD studentin theMachine Learning groupat the University of Toronto, working withGeoffrey Hinton and Rusl...
分类:其他好文   时间:2015-05-02 13:44:14    阅读次数:101
POJ 3069 Saruman's Army 贪心
Saruman's ArmyDescriptionSaruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his f...
分类:其他好文   时间:2015-05-01 13:19:35    阅读次数:133
Deep Learning(深度学习)学习笔记整理系列之(三)
http://blog.csdn.net/zouxy09/article/details/8775518Deep Learning(深度学习)学习笔记整理系列zouxy09@qq.comhttp://blog.csdn.net/zouxy09作者:Zouxyversion 1.0 2013-04-0...
分类:其他好文   时间:2015-04-30 18:03:43    阅读次数:209
leetcode || 138、Copy List with Random Pointer
problem: A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. Hide Tags ...
分类:其他好文   时间:2015-04-30 10:45:06    阅读次数:113
在Windows上安装PyCUDA和Theano
最近几个月在学习Deep Learning,刚开始的时候什么条件都不具备。自己从淘宝上面买了一个GT 240,搭建一个GPU环境用于程序的调试。折腾了几个月,以前PyCUDA总是搭建失败,最近几天才尝试成功。为了学习Deep Learning的源代码,自己又搭建了Theano环境。由于时间紧张,自己概略总结如下,以备忘记。...
分类:Windows程序   时间:2015-04-29 21:42:46    阅读次数:636
poj 3134 Power Calculus iddfs(迭代深搜)
iddfs入门题。 //poj 3134 //sep9 #include using namespace std; int n,deep; int a[30]; bool iddfs(int pos) { int t; if(pos>deep) return false; if(a[pos]<<(deep-pos)<n) return false; if(a[pos]==n) ret...
分类:其他好文   时间:2015-04-29 11:38:56    阅读次数:179
POJ 2431Expedition
DescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately manag...
分类:其他好文   时间:2015-04-28 09:29:00    阅读次数:83
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!