2009
DOI: 10.2478/v10229-011-0004-6
|View full text |Cite
|
Sign up to set email alerts
|

Bias and No Free Lunch in Formal Measures of Intelligence

Abstract: Bias and No Free Lunch in Formal Measures of IntelligenceThis paper shows that a constraint on universal Turing machines is necessary for Legg's and Hutter's formal measure of intelligence to be unbiased. Their measure, defined in terms of Turing machines, is adapted to finite state machines. A No Free Lunch result is proved for the finite version of the measure.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
31
0
4

Year Published

2011
2011
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 27 publications
(35 citation statements)
references
References 5 publications
0
31
0
4
Order By: Relevance
“…Note that a meaningful choice of each environment is much more effective than choosing them arbitrarily. This can replace or complement those evaluations based on repositories and it is certainly more effective than choosing all the environments or selecting them by a (universal) distribution, as in [46] (including some improvements over the distribution, such as the one introduced by [39]). …”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Note that a meaningful choice of each environment is much more effective than choosing them arbitrarily. This can replace or complement those evaluations based on repositories and it is certainly more effective than choosing all the environments or selecting them by a (universal) distribution, as in [46] (including some improvements over the distribution, such as the one introduced by [39]). …”
Section: Discussionmentioning
confidence: 99%
“…Although not explicitly used as an estimation of difficulty (but rather as a way to derive a distribution), this approach becomes much more cumbersome [39] than it might seem, because the relation between complexity and difficulty is intricate. In [34], another variant of Kolmogorov complexity (Kt max ) was suggested as a measure of complexity for the environments, but it was already stated that this approximation was unidirectional: some very complex environments might be easy, i.e., high rewards could be obtained by very simple policies ( [34, sec.…”
Section: Looking At the Problemmentioning
confidence: 99%
“…These weights are such that an agent's intelligence lies between zero and one. The choice of PUTM must be constrained to avoid bias in this measure [3]. There are at least two ways in which this measure is inconsistent with our intuitions about measuring human intelligence:…”
Section: Introductionmentioning
confidence: 99%
“…It sums rewards from the first time step, with no time to learn. AIXI always makes optimal actions [4] (as long as it is defined using the same universal Turing machine used to define the measure [3]), but AIXI is not computable. We allow humans time to learn before judging their intelligence.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, aggregating results using this distribution would assign higher intelligence to simple programs. One possible solution is to set a minimum complexity value [13], but this is clearly an arbitrary choice. An alternative option would be to define intelligence as the maximum complexity level where a system can score 'significantly better' than random.…”
Section: Introductionmentioning
confidence: 99%