逻辑回归与梯度下降

逻辑回归与梯度下降

已知方程

假设函数:

hθ(x(i))=g(θTx)=11+eθTx

Cost函数:
Cost(hθ(x),y)=ylog(hθ(x))+(1y)log(1hθ(x))

代价函数:
J(θ)=1mi=1mCost(hθ(x(i)),y(i))=1mi=1m[y(i)log(hθ(x(i)))+(1y(i))log(1hθ(x(i)))]

梯度下降公式:
θj:=θjαJ(θ)θj


梯度下降推导

J(θ)θjCost(hθ(x(i)),y(i))θjhθ(x(i))θjCost(hθ(x(i)),y(i))θjJ(θ)θj=1mi=1mCost(hθ(x(i)),y(i))=[y(i)1hθ(x(i))(1y(i))11hθ(x(i))]hθ(x(i))θj=11+eθTx(i)θj=1[1+eθTx(i)]2[1+eθTx(i)]θj=1[1+eθTx(i)]2(eθTx(i)θTx(i)θj)=1[1+eθTx(i)]2eθTx(i)x(i)j=11+eθTx(i)(111+eθTx(i))x(i)j=hθ(x(i))(1hθ(x(i)))x(i)j=[y(i)1hθ(x(i))(1y(i))11hθ(x(i))]hθ(x(i))θj=[y(i)1hθ(x(i))(1y(i))11hθ(x(i))]hθ(x(i))(1hθ(x(i)))x(i)j=[y(i)(1hθ(x(i)))(1y(i))hθ(x(i))]x(i)j=[hθ(x(i))y(i)]x(i)j=1mi=1m[hθ(x(i))y(i)]x(i)j

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值