首页 > 其他 > 详细

[ML] Gradient Descend Algorithm [Octave code]

时间:2017-03-09 00:18:42      阅读:182      评论:0      收藏:0      [点我收藏+]
function [theta, J_history] = gradientDescentMulti(X, y, theta, alpha, num_iters)
m = length(y); % number of training examples
J_history = zeros(num_iters, 1);

for iter = 1:num_iters
    theta = theta - alpha * X‘ * (X * theta - y) / m;
    iter = iter +1;
   J_history(iter) = computeCostMulti(X, y, theta);

end

end

  

 

[ML] Gradient Descend Algorithm [Octave code]

原文:http://www.cnblogs.com/KennyRom/p/6523378.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!