Open in TheBrain

LEGG, Shane

<p>Oct 21, 2012 11:14 PM

&#160;

see his YouTubes...

&#160;

def &#160;Intellig measures an agent's ability to <b>achieve goals in a wide range of enviros</b>.

&#160;

Bingham... ability of agent to solve new problems...

&#160;

Colvin... LEARING to adjust to new enviros.

&#160;

ability to act purposefully , think rationally, and deal effectively with the enviro

&#160;

LEGG emphasizes achievement of goals... &#160;in a wide range of enviros...

&#160;

&#160;

broad range of tasks...

&#160;

an agent's ability to achieve goals in a wide range of enviros.

&#160;

cannot ignore computational cost...

&#160;

prior to Hutter nobody had even formally def. comput cost...

&#160;

1 3 5 7... &#160;what comes next... &#160;simplest explanation uses Ock razor to get 2-1...

&#160;

use Ockham's razor...

&#160;

Bayes Theorem... &#160;updating prob hypotheses...

&#160;

simplex explanations are more likely...

&#160;

Kolmogorov complexity.... computatble description &#160;eg

1 with a trillion zeroes after it.... &#160;&#160;there's the descr... much shorter than the actual thing...

same with pi...

&#160;

Ockhams razor &#160;ties in with Kolmogorov docmpl...

&#160;

length of a program...

&#160;

probability of a program &#160;decreases with its length by 1/2...

&#160;

Ockham... simpler hypotheses are given higher prob than complex ones...

&#160;

he introduces Kolmogovorv in 4/12 at minute 4....

&#160;

predict &#160;sequence given what you've seen...

&#160;

chsi... is a distribution... Solomonoff induction...

&#160;

we don't know what's generating the seq.

&#160;

what is the prob. that the next digit is ... 0 etc.

&#160;

works ridic well....

&#160;

for any unkonw computatble distrib.

&#160;

get the expected total prediction error...

&#160;

compute this over all possibilities...

&#160;

Kolmogorov depends on the language that is expressed in...

&#160;

apply to QM.. easy to write down (Schrodinger) but v hard or intractible to compute...

&#160;

how do u approximate &#160;Kolmogorov or Solomoff induc... must apporximate it...

&#160;

5/12 &#160;RL = REINFORCEMENT LEARNING

&#160;

agent interacts with enviro &#160;gets rewards... &#160;when &#160;rewarded that action is more probable..

&#160;

tries to compue next action &#160;(has total hx of all states, actions and rewards)

&#160;

Agent's goal is to max reward....

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;

&#160;</p>