D. Qiu的专栏

Model representation Cost function Cost function intuition I Cost function intuition II Gradient descent start with some \theta_0, \theta_1keep changing \theta_0, \theta_1 to reduce

1. Learning with large datasets It's not who has the best algorithm that wins. It's who has the most data 2. Stochastic gradient descent batch gradient descent repeat

1. Unsupervised learning introduction supervised learning - training set: unpervised learning - training set:  2. K-means algorithm randomly select K cluster centroidsrepeat for every

1. Optimization Objective logistic regression let support vector machine 2. Large Margin Intuition 3. The mathematics behind large margin classification (optional)

1. Motivation I: Data Compression Reduce data from 2D to 1D 2. Motivation II: Data Visualization 3. Principal Component Analysis problem formulation reduce from 2D to 1D: find a directio

1. Cost function Neural Network (Classification) Binary classification 1 output unit Multi-class classification (K classes) K output units Cost function

1. Deciding what to try next Debugging a learning algorithm Suppose you have implemented regularized linear regression to predict housing prices, when you test your hypothesis on a new set of

1. Prioritizing what to work on: Spam classification example collect lots of datadeveloped sophisticated features based on email routing informationdeveloped sophisticated features for message bo

1. Non-linear hypotheses why introduce non-linear hypotheses? high dimensional datanon-linear hypotheses 2. Neurons and the brain Neural networks origins: algorithms that try to m

1. Classification2. Hypothesis RepresentationLogistic Regression Model the above function is called sigmoid function or logistic functionInterpretation of Hypothesis outputestimated probability tha

Multiple features for convenience of notation, define , the new hypothesis is Gradient descent for multiple variables new algorithm is Gradient descent in practive I: Feature S

1、线性回归、logistic回归和一般回归 线性回归函数（如果） 损失函数（loss function）或者错误函数（error function） 梯度下降法 梯度下降法最大的问题是解有可能是局部极小值，这与初始点的选取有关步骤 首先对赋值，这个值可以是随机的，也可以让是一个全零的向量改变的值，使得沿梯度下降的的方向减少 由于求得的是极小值，因此