A Recap of Proof Planning and “Hawkins Neuroscience 101” Matt Humphrey Working with: Manuel Blum Brendan Juba Ryan Williams.

Slides:



Advertisements
Similar presentations
Pseudo-Relevance Feedback For Multimedia Retrieval By Rong Yan, Alexander G. and Rong Jin Mwangi S. Kariuki
Advertisements

Effective Questioning
Reading Strategies.
Boosting Approach to ML
Warm Up- Pair/Share Discuss what you know about metaphors. Begin your mind mapping. Choose and say one of the three sentence frames to discuss metaphors.
Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.
Announcements Final Exam May 13th, 8 am (not my idea).
University of Pennsylvania 1 GRASP CIS 580 Machine Perception Fall 2004 Jianbo Shi Object recognition.
Management Support Systems A Hierarchy and a Guide.
Announcements Final Exam May 16 th, 8 am (not my idea). Practice quiz handout 5/8. Review session: think about good times. PS5: For challenge problems,
Proof Clustering for Proof Plans Matt Humphrey Working with: Manuel Blum Brendan Juba Ryan Williams.
Connectionist models. Connectionist Models Motivated by Brain rather than Mind –A large number of very simple processing elements –A large number of weighted.
The Data Mining Visual Environment Motivation Major problems with existing DM systems They are based on non-extensible frameworks. They provide a non-uniform.
EE141 1 Broca’s area Pars opercularis Motor cortexSomatosensory cortex Sensory associative cortex Primary Auditory cortex Wernicke’s area Visual associative.
Proof Planning as Understanding as Cortical Functions Brendan Juba With Manuel Blum Matt Humphrey Ryan Williams.
On Intelligence Jeff Hawkins –Founder, Palm Computing: Palm Pilot –Founder, Handspring: Treo –Founder: Numenta Redwood Neuroscience Institute Redwood.
Manuel Blum Ryan Williams Brendan Juba Matt Humphrey 13 June 2005 TOWARD A HIGH-LEVEL DEFINITION OF CONSCIOUSNESS.
Computer Art Semester Review Answer the following questions using the PDF documents supplied. The Links to these files are located on our class website.
ACOS 2010 Standards of Mathematical Practice
Lesson 3 Variables – How our Brains Work - Variables in Python.
Thinking About How You Read
Models and Designs Investigation 1.  Label your new section Models and Designs  Draw pictures of a “model” and “design”
L1 Sketch Tools Advanced HCI Beryl Plimmer. Agenda What’s the difference between a keyboard and a pencil?
Cognitive level of Analysis
Wheeler Lower School Mathematics Program Grades 4-5 Goals: 1.For all students to become mathematically proficient 2.To prepare students for success in.
Identifying, Responding, Analyzing, & Writing Strategies
Welcome to Thinking Maps ® 1. What are Thinking Maps & why do they work? What is the purpose of each map?What is the Memorial High School Thinking Maps.
Grade 2 - Unit 1 Lesson 1 I can retell, draw, and solve story problems. I can recognize math as a part of daily life. Lesson 2 I can create story problems.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
How We’re Going to Solve the AI Problem Pedro Domingos Dept. Computer Science & Eng. University of Washington.
/425 Declarative Methods - J. Eisner /425 Declarative Methods Prof. Jason Eisner MWF 3-4pm (sometimes 3-4:15)
Artificial Neural Network Theory and Application Ashish Venugopal Sriram Gollapalli Ulas Bardak.
Department of Computer Science, University of Waikato, New Zealand Geoffrey Holmes, Bernhard Pfahringer and Richard Kirkby Traditional machine learning.
By the end of today: Maths learning – building blocks The way maths progresses in school Understanding the way maths is taught in school Different strategies.
2 2  Background  Vision in Human Brain  Efficient Coding Theory  Motivation  Natural Pictures  Methodology  Statistical Characteristics  Models.
Dillon School District Two Revised Bloom’s Taxonomy.
Hierarchical Temporal Memory as a Means for Image Recognition by Wesley Bruning CHEM/CSE 597D Final Project Presentation December 10, 2008.
A New Theory of Neocortex and Its Implications for Machine Intelligence TTI/Vanguard, All that Data February 9, 2005 Jeff Hawkins Director The Redwood.
3. Rough set extensions  In the rough set literature, several extensions have been developed that attempt to handle better the uncertainty present in.
Big Ideas Differentiation Frames with Icons. 1. Number Uses, Classification, and Representation- Numbers can be used for different purposes, and numbers.
Complexity Non-determinism. NP complete problems. Does P=NP? Origami. Homework: continue on postings.
ECE450 - Software Engineering II1 ECE450 – Software Engineering II Today: Design Patterns IX Interpreter, Mediator, Template Method recap.
THE NATURE OF SCIENCE CHAPTER 1 SECTION 1. SCIENCE JOURNAL Open your book to page 4. Read the title, section headings and main ideas. Read the Yellow.
Puzzle Solver Sravan Bhagavatula EE 638 Project Stanford ECE.
Data Mining BY JEMINI ISLAM. Data Mining Outline: What is data mining? Why use data mining? How does data mining work The process of data mining Tools.
Get to know: YOURSELF!!!. Extrovert  Extraversion (E) I like getting my energy from active involvement in events and having a lot of different activities.
Situated Cognition: A New Direction in AI Bram van Heuveln.
1/32 This Lecture Substitution model An example using the substitution model Designing recursive procedures Designing iterative procedures Proving that.
Supporting Early Literacy Learning Session 2 Julie Zrna.
Why Can't A Computer Be More Like A Brain?. Outline Introduction Turning Test HTM ◦ A. Theory ◦ B. Applications & Limits Conclusion.
COMP 2208 Dr. Long Tran-Thanh University of Southampton Decision Trees.
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
Bloom’s Taxonomy Dr. Middlebrooks. Bloom’s Taxonomy.
To think like a Scientist… You must observe; using all 5 senses to describe the problem. Tools you can use are: microscopes, night vision goggles, telescopes,
Brain Lab Mark A. Strother Cal Farley’s. Objectives Have fun Experience (learn) a little about the brain Gain new perspectives for program development.
Key Ideas In Content Math 412 January 14, The Content Standards Number and Operations Algebra Geometry Measurement Data Analysis and Probability.
Sketch Tools L2 Advanced HCI. Agenda What is the problem with computer-based design tools? Why a toolkit? Framework Implementation Does it work? What.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Big data classification using neural network
More on scanning: NFAs and Flex
Nicolas Alzetta CoNGA: Cognition and Neuroscience Group of Antwerp
Thinking About How You Read READING STRATEGIES
Human Computable Passwords
What is Pattern Recognition?
The Big Picture Why we’re really interested in clustering proofs of theorems Manuel Blum, Matt Humphrey, Brendan Juba, Ryan Williams.
Thinking About How You Read READING STRATEGIES
Proof Planning as Understanding as Cortical Functions
Welcome to Memory Lecture 1 “Introduction to Memory”
Effective Reading Strategies.
Presentation transcript:

A Recap of Proof Planning and “Hawkins Neuroscience 101” Matt Humphrey Working with: Manuel Blum Brendan Juba Ryan Williams

What You Will See Part 1 (the “boring stuff” by Matt): –Very brief recap of proof planning –What came of the original plan –An intro to Hawkins neuroscience Part 2 (the “interesting stuff” by Brendan): –Relating brain function to proof planning –A link to “understanding” –A bit about CONSCS

And now to quickly recap… An ‘elevator talk’ about proof planning

What is a proof plan? Anything that guides a proof search –Should narrow the search space –Should give some idea of what will happen –Can be formal or informal, detailed or not “Proof by contradiction” “Use rule A, B, then C some number of times”

A More Concrete Example

Proof Clustering The idea –Cluster similar proofs together –Analyze similarity between the proofs –Generalize a rule, technique, or strategy Useful in proof planning as the rules are reused for proofs of new theorems New rules are more tools on your belt

Our Goal Implement automatic proof clustering for the Ωmega theorem prover –This implied working with extended regular expressions –[a,a,b,c], [a, b, d], [a, a, a, b, c] = (a*)b(c|d) –Wanted the smallest sparse regular expression that generated the cluster

The Outcome Generating these regular expressions was not easy to do Regular expressions were arbitrary Were they even appropriate? Instead, we looked for some real inspiration… –…and so the brain was found

Welcome Class… to “Hawkins Neuroscience 101”

Who is Jeff Hawkins anyway? Founder: Palm Computing, Handspring Deep interest in the brain all his life Redwood Neuroscience Institute “On Intelligence” –Variety of neuroscience research as input –Includes his own ideas, theories, guesses –Increasingly accepted view of the brain

The Cortex Hawkins’s point of interest in the brain –“Where the magic happens” Hierarchically-arranged in regions Communication up the hierarchy –Regions classify patterns of their inputs –Regions output a ‘named’ pattern up the hierarchy Communication down the hierarchy –A high-level region has made a prediction –Alerts lower-level regions what to expect

Examples Would Be Nice First, a basic picture recognition…

Dinner for two [pic]

Wait A Minute Don’t the higher levels have much, much, much more data to interpret? –Not really –Maybe even less But isn’t it harder to recognize ‘dinner’ than it is to recognize ‘fork’? –Surprisingly, no

Back to the Hierarchy Lowest visual level inputs pixels Second level recognizes edges, lines, etc from known patterns of pixels Third level recognizes shapes from known patterns of edges, lines, etc Fourth level recognizes objects from known patterns of shapes

One Step at a Time The jump between levels is one ‘unit of abstraction’ in a sense Patterns of level 16 output are classified and outputted by level 17 as input to 18 Level X inputs level X-1 data and outputs a classification to level X+1 Patterns of patterns of patterns of…

Naming is Powerful Some region of level 48 inputs ‘fork’, ‘knife’, ‘plate’, ‘glass’, ‘meat’, ‘potatoes’ That region outputs ‘dinner’ Not too hard for a brain

Without Names, All is Lost The raw data for ‘fork’ was: –‘ …’ –Could be a million bits of data Without names, level 48 is a mess –‘dinner’ = ‘[fork=100…101], [knife=111…110], [plate=001…100], …’ Before, we had 6 names Now, we have to decipher millions of bits

Names as Invariants If we look at a table from a 45 degree angle, we see ‘dinner’ If we look from a 60 degree angle, we still see ‘dinner’ BUT: all the raw visual data is different Still see ‘knife’, ‘fork’, etc so we still output ‘dinner’, but only due to naming Lower levels handle the small changes The bigger picture doesn’t change

A Further Example The cortex allows for extension of ideas

Memory-Prediction Model Term Hawkins gives to describe the workings of the cortex Memory refers mostly to classification as we go up the hierarchy Prediction allows us to make decisions in the world Prediction is related to the ‘down’

The Last Example (I promise) The cortex can predict and revise

Bringing It All Together All sensory data is essentially the same The brain handles generic patterns Common Cortical Algorithm –Vision handled same as touch, taste, etc –Uniformity of the cortex Patterns of different sensory perceptions combine for modeling

Most importantly, though,… …notice and remember the similarity between the proof plan and the cortical hierarchy

That’s it… …and now for Brendan…unless you have any questions before we continue.