What is the term for the opposite of eager/greedy search?
Asked Answered
P

2

8

So an eager search is where you take an initial solution even if a better solution is just down the road...

what is the opposite term for eager search? All my google results get me a reference to Paul Revere's ride. In these times of chaos and uncertainty a comforting thought indeed, but not really... useful.

Is there such a term?

Planoconvex answered 19/10, 2012 at 15:24 Comment(4)
Breadth first search? Worst first Search? Brute Force search? Incomplete search? Bozo (search random bins forever) search? Not a very specific question...Hedi
@EricLeschinski no no, not the algorithm, the term. I mean, we have eager loading and lazy loading as relative opposites, does that imply that "lazy search" is the opposite of greedy?Planoconvex
"Thorough search"? In the context of regular expressions a "greedy" match is the opposite of what you describe, that is, a match of as many characters as possible rather than stopping at the first - and I've usually heard "non-greedy" as the opposite of that.Supraorbital
lol @ Paul RevereNeutral
W
4

I think it is not correct to consider "greedy" and "eager" to be the same.

Greedy and Thrifty Optimizations

Greedy algorithms refer to the optimization paradigm to consider the locally best choice as the best global choice. This of course is done iteratively so that the local neighbourhood changes. The algorithm always the best choice of the options it "sees" in current iteration. An example for a greedy optimization algorithm would be gradient descend.

A non-greedy / thrifty optimization algorithm considers options more globally. It tries to check out many more options. Examples would be Bayesian Optimization and many forms of swarm optimization techniques, especially firefly optimization (afaik they find all the locally optima).

Eeager and Lazy Learning

"Eager" is used in the context of "eager learning". The opposite of "eager learning" is "lazy learning". The terms denote whether the mathematical modelling of the data happens during a separate previous learning phase, or only when the method is applied to new data. For example, polynomial regression is eager, while Gaussian processing regression or kernel regression are lazy.

This is closely related to whether the method is parametric (often eager learning) or non-parametric (often lazy learning), but not always. For example decision trees are eager learners, but still non-parametric.

Wideranging answered 16/1, 2018 at 14:27 Comment(0)
E
1

"Thrifty" is the only term I've seen used (other that "non-greedy"). It's intuitive enough that most people grasp the meaning from context.

Erse answered 19/2, 2016 at 23:53 Comment(0)

© 2022 - 2024 — McMap. All rights reserved.