update
This commit is contained in:
@@ -815,6 +815,7 @@ o The cost function is convex which guarantees that gradient descent converges f
|
||||
We revisit an example similar to what we had in the first homework set. We had a function of the type
|
||||
|
||||
!bc pycod
|
||||
m = 100
|
||||
x = 2*np.random.rand(m,1)
|
||||
y = 4+3*x+np.random.randn(m,1)
|
||||
!ec
|
||||
|
||||
Reference in New Issue
Block a user