I would like to know what 'heuristics' actually means in artificial intelligence. For example, I am reading a paper by Engelbrecht on the convergence analysis of the particles of the algorithm. The section where the author discusses the mathematical reasons why the particles behave the way they do was entitled 'heuristics'. Does it, in any way, mean ... the mathematical rigour, methodology, convergence, etc?

Your insights would be helpful.

  • $\begingroup$ Heuristic generally is an approximate approach to solve any problem. In this case it could be the approximate model of particle behaviour. $\endgroup$ – iLoveCamelCase May 29 '15 at 6:06
  • $\begingroup$ Thanks for your responses. A related question is ... what do 'hyperheuristics', 'meta-heuristics' mean? Why are they 'beyond' the normal heuristics? $\endgroup$ – cgo May 29 '15 at 6:59
  • $\begingroup$ You can find answers to your questions on Wikipedia, see e.g. metaheuristics and hyperheuristic. $\endgroup$ – Juho May 29 '15 at 7:36
  • $\begingroup$ Still, heuristics can be studies in a rigorous way. If the author calls model assumptions "heuristics", they may not solve the problem they want/claim to be solving. $\endgroup$ – Raphael May 29 '15 at 7:57
  • 1
    $\begingroup$ The concept of a heuristic is to be understood with respect to a given purpose. For example, given a problem, you may have an algorithmic solution providing precisely the answer(s) you desire, but that is expressed as a non-deterministic algorithm, hence leaving room for different computation strategies which may results in computations that have different costs for achieving the same result. In such a case, you may want to use heuristics to make non-deterministic choices that may hopefully lead to lower computation costs. $\endgroup$ – babou May 29 '15 at 10:46

Heuristics typically have very little to do with rigor. (But you can surely study them in a rigorous way). They are rule of a thumb methods for solving (usually computationally difficult) problems, and typically they perform quite well in practice. In other words, there might not be any formal guarantees on the solution quality you get by running a heuristic, but experience and empirical analysis shows they can be quite effective. Arguably, it is rarely the case we understand their behaviour well.

Sometimes, when heuristics are analyzed formally, they turn out be to approximation algorithms. That is, methods for solving a problem with a formal guarantee on the solution quality. For example, one might have observed a heuristic usually works well, and an analysis proves it will always give a solution which is at most twice the optimum.

Perhaps in your particular case, the section "Heuristics" contains explanations (more or less formal) as to why the heuristic behaves or is expected to behave in certain ways when run.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.