<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wait_ButterFly的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wait_ButterFly</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wait_ButterFly]]></copyright><item><title><![CDATA[Pytorch model]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/111601046</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/111601046</guid><author>wait_ButterFly</author><pubDate>Wed, 23 Dec 2020 23:02:35 +0800</pubDate><description><![CDATA[Pytorch modelmodel.modulesmodel.named_modulesmodel.childrenmodel.named_childrenmodel.parametersmodel.named_parametersmodel.state_dict参考
搭建一个简单网络，继承nn.Modules
import torch 
import torch.nn as nn 

class Net(nn.Module):

    def __init__(self, num_class=10):]]></description><category></category></item><item><title><![CDATA[python 内建函数]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/111011471</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/111011471</guid><author>wait_ButterFly</author><pubDate>Thu, 10 Dec 2020 22:28:55 +0800</pubDate><description><![CDATA[python 内建函数内建函数__all____main____call____repr__参考blog
内建函数
all
用于导入模块时做出限制；
被导入模块若定义了__all__属性，则只有__all__内指定的属性、方法、类可被导入；若没定义，则导入模块内的所有公有属性，方法和类
#bb.py
__all__=('A','func')
class A():
    def __init__(self,name,age):
        self.name=name
        self.age=]]></description><category></category></item><item><title><![CDATA[mxnet 多卡训练]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110942756</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110942756</guid><author>wait_ButterFly</author><pubDate>Wed, 09 Dec 2020 22:59:16 +0800</pubDate><description><![CDATA[mxnet多卡训练 gluon单卡训练多卡训练补充参考blog
单卡训练
devices = mx.gpu(0) #指定GPU 
#batch_data,batch_label 表示从生成器中获取的数据和label 
#将nd.array类型数据放到devices（指定GPU（0,1,2,3)或者cpu）上
data = mx.nd.array(batch_data).as_in_context(devices)
label = mx.nd.array(batch_label).as_in_context(]]></description><category></category></item><item><title><![CDATA[常见激活函数对比]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110913944</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110913944</guid><author>wait_ButterFly</author><pubDate>Wed, 09 Dec 2020 00:50:13 +0800</pubDate><description><![CDATA[常见激活函数激活函数的作用非线性激活函数sigmodtanh 激活函数relu 激活函数 Rectified Linear UnitsLrelu&amp;PreluELUSwishMaxout参考blog
激活函数的作用
激活函数的主要功能是为神经网络非线性能力 ，去掉激活函数层，神经网络仅剩下线性函数，多层线性函数的拟合还是线性的，无法更好的建模生活中的大多数非线性问题。
线性激活函数（不是重点）
非线性激活函数（sigmod,tanh,relu,lrelu,Prelu,swish）
考量：

可微性：因]]></description><category></category></item><item><title><![CDATA[mxnet symbol 和gluon 模型加载]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110913613</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110913613</guid><author>wait_ButterFly</author><pubDate>Wed, 09 Dec 2020 00:06:43 +0800</pubDate><description><![CDATA[mxnet symbol 和gluon 模型加载常规流程数据准备定义精度评价函数定义网络训练symbol与Gluon 模型加载gluon保存和加载模型结构和参数参考博客
常规流程
使用mxnet搭建模型模型的流程：主要包括数据准备，模型构建，超级参数选择,优化器，loss评价标准
数据准备
from mxnet import gluon
from mxnet.gluon import nn
import matplotlib.pyplot as plt
from mxnet import autograd ]]></description><category></category></item><item><title><![CDATA[常见优化器SGD-NadaMax]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110847768</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/110847768</guid><author>wait_ButterFly</author><pubDate>Tue, 08 Dec 2020 00:51:44 +0800</pubDate><description><![CDATA[常见优化器SGD-NadaMax

转载https://zhuanlan.zhihu.com/p/81020717

SGD
	Momentum
	Nesterov Momentum
	AdaGrad
	RMSProp
	AdaDelta
	Adam
	AdaMax
	Nadam
	NadaMax
SGD

随机梯度下降算法，最常用地mSGD，小批量随机梯度下降求解参数。





 

Momentum

动量梯度下降算法

代码


import numpy as np  
class Mo...]]></description><category></category></item><item><title><![CDATA[latex 初探]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/89788805</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/89788805</guid><author>wait_ButterFly</author><pubDate>Fri, 03 May 2019 16:28:14 +0800</pubDate><description><![CDATA[Latex 总结

原创：https://blog.youkuaiyun.com/xuwang777/article/details/79162037/
一：IEEEtran格式详解第一个.tex

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\documentclass[journal,twocolumn]{IEEEtran}%期刊，双栏，...]]></description><category></category></item><item><title><![CDATA[深度学习论文（发展阶段）]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/88608944</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/88608944</guid><author>wait_ButterFly</author><pubDate>Sat, 16 Mar 2019 23:50:58 +0800</pubDate><description><![CDATA[转载：https://blog.youkuaiyun.com/lioncv/article/details/22372757





【1】A fast learning algorithm for deep belief nets: 2006

Hinton关于deep learning的代表作。Papershows how to use “complementary prior” to elimin...]]></description><category></category></item><item><title><![CDATA[目标检测]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87984747</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87984747</guid><author>wait_ButterFly</author><pubDate>Wed, 27 Feb 2019 18:52:22 +0800</pubDate><description><![CDATA[转载文章：https://blog.youkuaiyun.com/xiao__run/article/details/80393016
主要部分

R-CNN
Fast R-CNN
Faster R-CNN
Light-Head R-CNN
Cascade R-CNN
SPP-Net
YOLO
YOLOv2
YOLOv3
SSD
DSSD
FSSD
ESSD
MDSSD
Pelee
R-FCN
FPN
Ret...]]></description><category></category></item><item><title><![CDATA[leetcode-reverse-linked-list-ii]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87798503</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87798503</guid><author>wait_ButterFly</author><pubDate>Wed, 20 Feb 2019 15:08:19 +0800</pubDate><description><![CDATA[reverse-linked-list-ii

描述

Reverse a linked list from position m to n. Do it in one-pass.
Note: 1 ≤ m ≤ n ≤ length of list.
Example:
Input: 1-&amp;gt;2-&amp;gt;3-&amp;gt;4-&amp;gt;5-&amp;gt;NULL, m = 2, n = 4
Output: 1-...]]></description><category></category></item><item><title><![CDATA[leetcode-rotate-list]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87793918</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87793918</guid><author>wait_ButterFly</author><pubDate>Wed, 20 Feb 2019 14:06:10 +0800</pubDate><description><![CDATA[rotate-list

描述

Given a linked list, rotate the list to the right by k places, where k is non-negative.
Example 1:
Input: 1-&amp;gt;2-&amp;gt;3-&amp;gt;4-&amp;gt;5-&amp;gt;NULL, k = 2
Output: 4-&amp;gt;5-&amp;gt;1-&amp;gt;2-&amp;gt;3-&amp;...]]></description><category></category></item><item><title><![CDATA[leetcode-partition-list]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87792311</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87792311</guid><author>wait_ButterFly</author><pubDate>Wed, 20 Feb 2019 13:41:46 +0800</pubDate><description><![CDATA[partition-list

描述

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the...]]></description><category></category></item><item><title><![CDATA[leetcode-remove duplicates from sorted list]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87734265</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87734265</guid><author>wait_ButterFly</author><pubDate>Tue, 19 Feb 2019 21:07:57 +0800</pubDate><description><![CDATA[remove duplicates from sorted list

描述

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
Example 1:
Input: 1-&amp;gt;2-&amp;gt;3-...]]></description><category></category></item><item><title><![CDATA[leetcode-swap nodes in pairs]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87650048</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87650048</guid><author>wait_ButterFly</author><pubDate>Mon, 18 Feb 2019 22:05:50 +0800</pubDate><description><![CDATA[swap nodes in pairs

描述

Given a linked list, swap every two adjacent nodes and return its head.
You may not modify the values in the list’s nodes, only nodes itself may be changed.
Example:
Given 1-&amp;...]]></description><category></category></item><item><title><![CDATA[leetcode-Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87647518</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87647518</guid><author>wait_ButterFly</author><pubDate>Mon, 18 Feb 2019 21:27:31 +0800</pubDate><description><![CDATA[Remove Nth Node From End of List
描述

Given a linked list, remove the n-th node from the end of list and return its head.
Example:
Given linked list: 1-&amp;gt;2-&amp;gt;3-&amp;gt;4-&amp;gt;5, and n = 2.
After removin...]]></description><category></category></item><item><title><![CDATA[leetcode-middle-of-the-linked-list]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87643771</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87643771</guid><author>wait_ButterFly</author><pubDate>Mon, 18 Feb 2019 20:28:45 +0800</pubDate><description><![CDATA[middle-of-the-linked-list

描述

Given a non-empty, singly linked list with head node head, return a middle node of linked list.
If there are two middle nodes, return the second middle node
Example 1:
I...]]></description><category></category></item><item><title><![CDATA[leetcode-链表-Palindrome Linked List]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87481310</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/87481310</guid><author>wait_ButterFly</author><pubDate>Sat, 16 Feb 2019 23:21:04 +0800</pubDate><description><![CDATA[Palindrome Linked List

描述

Given a singly linked list, determine if it is a palindrome.
Example 1:
Input: 1-&amp;amp;gt;2
Output: false
Example 2:
Input: 1-&amp;amp;gt;2-&amp;amp;gt;2-&amp;amp;gt;1
Output: true


思路

1.翻转链表，逐一比较 (占...]]></description><category></category></item><item><title><![CDATA[leetcode-reverse linked list]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/86751920</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/86751920</guid><author>wait_ButterFly</author><pubDate>Sat, 02 Feb 2019 20:21:11 +0800</pubDate><description><![CDATA[题目 reverse linked list

描述

Reverse a singly linked list.
Example:
Input: 1-&amp;amp;gt;2-&amp;amp;gt;3-&amp;amp;gt;4-&amp;amp;gt;5-&amp;amp;gt;NULL
Output: 5-&amp;amp;gt;4-&amp;amp;gt;3-&amp;amp;gt;2-&amp;amp;gt;1-&amp;amp;gt;NULL

解法
c++  慢慢
]]></description><category></category></item><item><title><![CDATA[leetcode -remove linked list elements]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/86745587</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/86745587</guid><author>wait_ButterFly</author><pubDate>Fri, 01 Feb 2019 21:58:49 +0800</pubDate><description><![CDATA[题目 remove linked list elements
描述

Remove all elements from a linked list of integers that have value val.
Example:
Input:  1-&amp;amp;gt;2-&amp;amp;gt;6-&amp;amp;gt;3-&amp;amp;gt;4-&amp;amp;gt;5-&amp;amp;gt;6, val = 6
Output: 1-&amp;amp;gt;2-&amp;am]]></description><category></category></item><item><title><![CDATA[leetcode - intersection oftwo Linked Lists]]></title><link>https://blog.youkuaiyun.com/wait_ButterFly/article/details/86744829</link><guid>https://blog.youkuaiyun.com/wait_ButterFly/article/details/86744829</guid><author>wait_ButterFly</author><pubDate>Fri, 01 Feb 2019 21:07:07 +0800</pubDate><description><![CDATA[题目
描述

Write a program to find the node at which the intersection of two singly linked lists begins.
For example, the following two linked lists:
begin to intersect at node c1.
Example 1:
Input: inter...]]></description><category></category></item></channel></rss>