Open in TheBrain

Never Ending Learning Mitchell video

<p>Oct 29, 2012 11:02 PM

&#160;

Tom Mitchell &#160;CMU

&#160;

humans learn many things for years &#160;and become better learners over time...

ride bikes, &#160;tennis, &#160;pick up stuff... we get better at it over decades...

&#160;

most programs live a very short life... &#160;they get runed off...

&#160;

why not machines? &#160;cumulative... &#160;underexplored

&#160;

Never Ending learning

&#160;

Task &#160;acquire a growing compeence without asymptote

over years, mult funciton

where learning one thinks improves its ability etc.

&#160;

lecture at UW &#160;Seattle...

&#160;

robots how to not run out of power...

how not to run into things...

robots, softbots...

&#160;

this was 2010 lecture...

&#160;

architectures for problem solving &#160;SOAR &#160;rosenblood

Icasus &#160;langley &#160;and Prodigy &#160;carbonnell

&#160;

large scale kno cosntruct &#160;cyc, knowitall, textrunner, woe

&#160;

life long learing &#160;

learning to learn &#160;thrun and pratt 98 &#160;and thrun and mitchel 93

&#160;

transfer learning &#160;multitask &#160;caruana &#160;95

transfer reinforcment leaning parr and russell 98

learning with struc outpus &#160;roth 2009 &#160;taskar 2009

&#160;

active larning &#160;survey &#160;multitask leaning

&#160;

curric learning &#160;bengio &#160;2009

&#160;

transfer learning... coupling... eg &#160;spam filter1 &#160;helps u learn spam filter 2...

&#160;

Cast study we're trying to work on

&#160;

NELL &#160;Never-Ending Language Learner...

&#160;

input an ontology

&#160;

eg &#160;give it a dozen univ examples... &#160;occas intearction with aperson...

&#160;

each day it reads more facts to populate ontology &#160;and it needs to

do it better(eg &#160;more facts more accurately out of the text)

&#160;

turned on in Jan 2010 &#160;running 24 by 7

&#160;

500 catgories and raltions

10 to 20 see examples

500M &#160;examples

&#160;

since Jan &#160;executing an algo...

&#160;

now has 400K &#160;extracted triples...

&#160;

&#160;

look at&#160;

&#160;

READ THE WEB... look at what its learning... its all online

&#160;

eg gazebo is a kind of furniture

&#160;

alex barzuk is

&#160;

jimi is a musician who plays the guitar...

&#160;

melbourne museum

&#160;

its learning triples...

&#160;

he looks at seattle...

&#160;

is a city...

&#160;

and provides evidence... v high confidence...

looking at half a billion web pages... &#160;collecting

&#160;

it cooccurs with other words &#160;that indicates its a city... using bayes...

&#160;

incorrect inferences do pollute the DB and v quickly..

&#160;

is seattle &#160;the capit of wash......

&#160;

has newspaper stranger; &#160;mariners, seahawks&#160;

&#160;

gray stuff... does not quite believe...

confience below some threshold...

&#160;

&#160;

400,000 of these triples... can browse at your leisure...

&#160;

worked on this for 3 years &#160;floundering around

&#160;

2 good ideas &#160;that make the algo...

&#160;

its classifying noun phrases... do they pertain to a city...

&#160;

NELL has 20 examples that are labelled...

and has 20M &#160;unlabeled...

&#160;

semi-supervised bootstrap learning...

&#160;

eg &#160;given cities &#160;like pitssue &#160;paris, seatteee, cupterino

mayor of...

live in

&#160;

live in state of denial

&#160;

but &#160;it is underconstrained... &#160;a bad example &#160;gets in there &#160;(like live in a stae of denial)

&#160;

guess what &#160;vague concept i'm thing of...

&#160;

key idea 1: &#160;its too difficult... to learn &#160;an unconstrained &#160;thing &#160;but

&#160;

force it to learn a lot of things

&#160;

couplelearning things together...

&#160;

3 difft types of coupling of functions...

&#160;

minute 21/22

coupled training tpe 1:&#160;

&#160;

co-training....

&#160;

type 1 &#160;coupling constraints in NELL...

&#160;

cotraining... &#160;multiple labesl &#160;provide a joint constraint...

&#160;

&#160;

type 2 &#160;use same x &#160;going to difft Ys...

&#160;

X &#160;goes to &#160;Y1 &#160;is it a city &#160;ot

Y2 is it a fruit;

&#160;

is it a fruit &#160;(then its not a city) &#160;and vice versa...

&#160;

&#160;

athlete implies person

&#160;

athlete implies not sport

&#160;

sport +&#62; not athlete...

&#160;

we input by hand &#160;some constraints...

&#160;

third constraint...

&#160;

athlete plays for team &#160;&#160;or athlete plays sport...

&#160;

what are the tpes of the arguemtns...

&#160;

Alex Rodriguez &#160;&#160;plays for NY Yankees &#160;then it must also say that &#160;A rod is an athlete...

&#160;

its simult learning a 1000 difft &#160;relations...

key idea number 1 &#160;is above..

&#160;

*

algo is &#160;like EM

Pure EM appraoch to coupled training..

&#160;

E &#160;jointly estimate latent labels for each func of each unlabeled example

&#160;

M &#160;retrain all functions

&#160;

locally max &#160;likelihood...

&#160;

but does work

&#160;

there really are &#160;1014 NP paris... &#160;like to do it &#160;but &#160;can't do it.. too expensive..

&#160;

NELL &#160;does E'M' &#160;&#160;

E' stepjust does this for the ones that its the most confident of

top 250 &#160;NPs... next iteration... does next 250...

&#160;

M' step:&#160;

&#160;

Q does it retract things that it prev thot was true... NO... but it should

&#160;

NELL has a KB.... grwoing set of beleifs that its decided to commit to...

&#160;

evidence integrator... &#160;&#160;looks at candidate beleifs...

&#160;

simple &#160;iterative loop...

&#160;

what set of beleifs should we beleive... &#160;simple strategy...

&#160;

arg1 is the tiget woods of arg2...

&#160;

eg &#160;pikes &#160;peak &#160;or &#160;&#160;last word &#160;is mountain

&#160;

mountain bike is not a mountain...

&#160;

the bdeatles &#160;is a good morphology

&#160;

does it end in sun for being a newspaper...

&#160;

obelinsky... prob. a name...

&#160;

morpholog &#160;analysis &#160;give remarkably good resuslts

&#160;

silliam cohen and richard wang &#160;SEAL... &#160;book author

&#160;

3 types of learned extractors... &#160;they make indep errors

if error is 20% &#160;then combined error is only .23... good error rate...

&#160;

Coupled Training Helps...

&#160;

Precisions really improve &#160;up into 90% with coupled constraints...

&#160;

food is &#160;100% &#160;movie is 100%

&#160;

&#160;but sports eqpt &#160;is terrible...

&#160;

maybe &#160;need a new predicate...

&#160;

eg add human traists &#160;(for denial)

&#160;

coupled traiing &#160;is a good idea...

&#160;

so how can we get new constraints...

&#160;

how abt getting NELL to LEARN the constraints...

&#160;

key idea 2: &#160;DISCOVER New Coupling Constraints...

&#160;

first order, proab horn clause constraints...

&#160;

eg &#160;learn this rule

&#160;

if &#160;A rod plays for Yankees then infer that &#160;A rod plays baseball...

&#160;

here's a bad rule it learned

&#160;

UW &#160;plays basketball therefore &#160;UW plays in the NBA

&#160;

had not read about college basketball...

&#160;

&#160;

comment from Dan: &#160;nowehre in the web will u find a statemtn that&#160;

UW basketball team does NOT playin the national hockey league;

&#160;

learned probab &#160;rules &#160;... horn clause rules...

&#160;

NELL as of Oct 18 2010...

&#160;

&#160;

in June &#160;humans got into the loop &#160;June 2010

&#160;

after 10 iterations,... say &#160;forget all these &#160;emotions... take abt 5 mins every 2 weeks

to correct it...

&#160;

&#160;

Q is it getting better at learning... is it happening...

&#160;

its happening for majoring of predicates but getting worse for a mnority...

&#160;

baked good &#160;ran amok &#160;(cuz of internet cookie problem)

&#160;

some new stuff...

&#160;

NELL has a fixed ontology... not useful to be fixed...

&#160;

&#160;

Mahamed and Hruschka &#160;&#160;similar to Oren's and my work...

&#160;

&#160;

consider musician &#160;and musical instrument...

&#160;

eg jimi hendriks &#160;and guitar...

&#160;

Arg 1 master &#160;Arg 2

&#160;

sitar &#160;George Harrison

tenor Sax &#160;Stan Getz...

&#160;

manually adding &#160;some relations...

&#160;

&#160;

type has member.... eg &#160;gas &#160;has member &#160;co2...

&#160;

ontology extending by reading...

&#160;

can u popularity and discusison on web to extend it

&#160;

Wonderful game that will be on the

&#160;

POLARITY &#160;play this game

&#160;

Edith Law and Burr Settles and Luis von Ahn... &#160;

&#160;

do this.... &#160;&#160;crowd sourcing... keep NELL on track...

&#160;

&#160;

bottom line:

&#160;

1) &#160;think abt how &#160;wide open &#160;never ending learning is...nobody is working on this...

lots of great phd theses....

turn it into a never ending learning robot

how never ending learning street lamp &#160;turn green or red or call police

never ending &#160;chess player...

&#160;

&#160;

&#160;

&#160;

&#160;</p>