Question

computational complexity of gradient descent is,​

Answer 1

Explanation:

Gradient descent is an optimization algorithm used to minimize some function by iteratively moving in the direction of steepest descent as defined by the negative of the gradient.

Mark as Brainlist.

Answer 2

Answer:

Computational complexity of gradient descent is,time gradient (0)

Explanation:

• Zero is the time complexity of computational gradient.
• number of rows is referred by n.
• number of features is referred by d.
• Gradient descent is used when n and d are large.
• It is a better way.

#SPJ3