Question: Gradient Descent is a method to solve constraint satisfaction optimization problems with continuous domains. Which of the following is the closest analogue to gradient descent
Gradient Descent is a method to solve constraint satisfaction optimization problems with continuous domains.
Which of the following is the closest analogue to gradient descent for discrete domains?
|
| Simulated annealing |
|
| Genetic algorithm |
|
| Greedy descent |
|
| Random restart |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
