Kadd_to LogisticRegression def fit(self, x, Y, epochs-100e, print_loss=True): This function implements the Gradient Descent Algorithm Arguments: training data matrix: each column is a training example. X -- The number of columns is equal to the number of training examples Y -- true "label" vector: shape (1, m) epochs -- Return: params -- dictionary containing weights losses loss values of every 100 epochs -- grads -- dictionary containing dw and dw_e losses = [] for i in range(epochs): # Get the number of training examples m = x. shape[1] ### START YOUR CODE HERE ### # calculate the hypothesis outputs A (2 2 lines of code) Z = A = # Calculate loss (* 1 line of code) loss = # calculate the gredients for w and w_e dw = dw_e = # weight updates self.W = self.w_e = ### YOUR CODE ENDS ###
Kadd_to LogisticRegression def fit(self, x, Y, epochs-100e, print_loss=True): This function implements the Gradient Descent Algorithm Arguments: training data matrix: each column is a training example. X -- The number of columns is equal to the number of training examples Y -- true "label" vector: shape (1, m) epochs -- Return: params -- dictionary containing weights losses loss values of every 100 epochs -- grads -- dictionary containing dw and dw_e losses = [] for i in range(epochs): # Get the number of training examples m = x. shape[1] ### START YOUR CODE HERE ### # calculate the hypothesis outputs A (2 2 lines of code) Z = A = # Calculate loss (* 1 line of code) loss = # calculate the gredients for w and w_e dw = dw_e = # weight updates self.W = self.w_e = ### YOUR CODE ENDS ###
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Fill in the blanks
![Kadd_to Logisticregression
def fit(self, x, Y, epochs-100e, print_loss=True):
This function implements the Gradient Descent Algorithm
Arguments:
x -- training data matrix: each column is a training example.
The number of columns is equal to the number of training examples
Y -- true "label" vector: shape (1, m)
epochs --
Return:
params --
dictionary containing weights
losses
loss values of every 100 epochs
--
grads --
dictionary containing dw and dw_e
losses = []
for i in range(epochs):
# Get the number of training examples
m = x. shape[1]
### START YOUR CODE HERE ###
# Calculate the hypothesis outputs A (* 2 lines of code)
Z =
A =
# Calculate loss (* 1 line of code)
loss =
# calculate the gredients for w and w_e
dw =
dw_e =
# weight updates
self.W =
self.w_e =
### YOUR CODE ENDS ###](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F87a3401d-ebaa-4c6f-8559-6e893e4d1e7e%2Fedafece2-161b-456c-86b2-6be1743b5ef0%2Fx492u6ej_processed.png&w=3840&q=75)
Transcribed Image Text:Kadd_to Logisticregression
def fit(self, x, Y, epochs-100e, print_loss=True):
This function implements the Gradient Descent Algorithm
Arguments:
x -- training data matrix: each column is a training example.
The number of columns is equal to the number of training examples
Y -- true "label" vector: shape (1, m)
epochs --
Return:
params --
dictionary containing weights
losses
loss values of every 100 epochs
--
grads --
dictionary containing dw and dw_e
losses = []
for i in range(epochs):
# Get the number of training examples
m = x. shape[1]
### START YOUR CODE HERE ###
# Calculate the hypothesis outputs A (* 2 lines of code)
Z =
A =
# Calculate loss (* 1 line of code)
loss =
# calculate the gredients for w and w_e
dw =
dw_e =
# weight updates
self.W =
self.w_e =
### YOUR CODE ENDS ###
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
Step 1
%%add_to MultivariateNetwork def fit(self, X, Y, epochs=1000, print_loss=True): losses = [] print("W.T.shape = ", self.W.T.shape) print("X.shape = ", X.shape) print("Y.shape = ", Y.shape) print("W.shape = ", self.W.shape) for i in range(epochs): ### START YOUR CODE HERE ###
m = X.shape[1]
Y_hat = np.dot(self.W.T, X) # Calculate loss (≈ 1 line of code) loss = (1/(2*m)) * np.dot((Y_hat - Y), (Y_hat - Y).T) # Calculate the gredients for W and w_0 (≈ 2 lines of code) # dw = np.dot(np.sum(Y_hat - Y), X) dw = np.sum((Y_hat - Y) * X) dw_0 = np.sum(Y_hat - Y) dw /= m dw_0 /= m # Weight updates (≈ 2 lines of code) self.W -= self.alpha * dw self.w_0 -= self.alpha * dw_0 ### YOUR CODE ENDS ###
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education