Assertion: descent's problem | /r/Desires | different number of iterations
Facets:
value: until convergence
type: TEMPORAL
Source sentences:
text: Different problems require different number of iterations until convergence, so in general you can assume that the algorithm has found a minimum when [texi]J(\theta)[texi] decreases less than some small value [texi]\epsilon[texi] in one iteration.