Judea Pearl The A.I. Guy (2011 Turing Award Winner) Matt Hegarty CSCE 221-200 Spring 2013.

Slides:



Advertisements
Similar presentations
BEST REFERRAL PROGRAM AWARD
Advertisements

The Use of Bayesian Statistics in Court By: Nick Emerick 5/4/11.
My Wild & Crazy Idea: Causal Computational Learning Theory Scott Aaronson But first: what ever happened to my WACI from a few years ago: a Web 2.0 mathematics.
Recursive Noisy-OR Authors : Lemmer and Gossink. 2 Recursive Noisy-Or Model A technique which allows combinations of dependent causes to be entered and.
Representations for KBS: Uncertainty & Decision Support
The Power of Preprocessing Bart M. P. Jansen September 29th, Algorithms & Visualization seminar, TU Eindhoven.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 190 Computing in the Modern World Judea Pearl 2011 ACM A.M. Turing Award.
The GraphSLAM Algorithm Daniel Holman CS 5391: AI Robotics March 12, 2014.
Pearl’s Belief Propagation Algorithm Exact answers from tree-structured Bayesian networks Heavily based on slides by: Tomas Singliar,
Department of Mathematics and Computer Science
John McCarthy. biography Was born in Boston, Massachusetts on September 4, Family of two Irish immigrants, John Patrick and Ida Glatt McCarthy.
What disciplines students learn in Electrical and Computer Engineering Technology.
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
1 CALCULUS Even more graphing problems
Clinical Decision Making
Propagation in Poly Trees Given a Bayesian Network BN = {G, JDP} JDP(a,b,c,d,e) = p(a)*p(b|a)*p(c|e,b)*p(d)*p(e|d) a d b e c.
Architecture and Real Time Systems Lab University of Massachusetts, Amherst An Application Driven Reliability Measures and Evaluation Tool for Fault Tolerant.
Representing Uncertainty CSE 473. © Daniel S. Weld 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one.
5/25/2005EE562 EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 16, 6/1/2005 University of Washington, Department of Electrical Engineering Spring 2005.
Alyce Brady CS 510: Computer Algorithms Depth-First Graph Traversal Algorithm.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 190 Computing in the Modern World Two Example Bayesian Networks March.
What is an Algorithm? (And how do we analyze one?) COMP 122, Spring 04.
Christos Harilaos Papadimitriou Who is this man?.
CIS 410/510 Probabilistic Methods for Artificial Intelligence Instructor: Daniel Lowd.
Technion – Israel Institute of Technology Department of Electrical Engineering High Speed Digital Systems Lab Written by: Haim Natan Benny Pano Supervisor:
CSE 515 Statistical Methods in Computer Science Instructor: Pedro Domingos.
CSCE 221H-200Gregory Donelan II. Early Life Was Born in Yealmpton, England on January 13 th, 1934 Won a scholarship to Eton College in 1946, where he.
Soft Computing Lecture 17 Introduction to probabilistic reasoning. Bayesian nets. Markov models.
Overview of Computing. Computer Science What is computer science? The systematic study of computing systems and computation. Contains theories for understanding.
Wook-Sung Yoo, Ph.D. Software Engineering Program Fairfield University
Artificial Intelligence
IVAN SUTHERLAND BRANDON GODDARD CSCE H APR 10, 2014.
ALAN KAY “THE BEST WAY TO PREDICT THE FUTURE IS TO INVENT IT” Presented by: Brennen Taylor CSCE 221 – Spring 2014.
1 Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation Orna Grumberg Technion Haifa, Israel Joint work with Rachel Tzoref.
Module 1- Getting Started Tell me what to do Using sets of instructions…
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
Leslie Valiant Margaret Neterval (mon2hu) and Emily McClure (eem9dp)
Bayesian Networks for Data Mining David Heckerman Microsoft Research (Data Mining and Knowledge Discovery 1, (1997))
Introduction to Bayesian Networks
Modified Chinese Checkers Sabrina Wang, Ben Perlmutter, Melinda Lim.
Chapter 7 – Deadlock (Pgs 283 – 306). Overview  When a set of processes is prevented from completing because each is preventing the other from accessing.
Physics Fluctuomatics (Tohoku University) 1 Physical Fluctuomatics 12th Bayesian network and belief propagation in statistical inference Kazuyuki Tanaka.
Slides for “Data Mining” by I. H. Witten and E. Frank.
An Introduction to Variational Methods for Graphical Models
Leslie Valiant “truly a heroic figure in theoretical computer science”- ACM Turing Award Committee Nafe Alsawfta CSCE 221 Spring 2014.
Bayesian networks and their application in circuit reliability estimation Erin Taylor.
Lecture 29 Conditional Independence, Bayesian networks intro Ch 6.3, 6.3.1, 6.5, 6.5.1,
Principles of Software Engineering: Why Study Software Engineering? COSI 120b, Spring 2005.
Cognitive Computer Vision Kingsley Sage and Hilary Buxton Prepared under ECVision Specific Action 8-3
CSE 473 Uncertainty. © UW CSE AI Faculty 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one has stood.
KAIS T Sensor Deployment Based on Virtual Forces Reference: Yi Zou and Krishnendu Chakarabarty, “Sensor Deployment and Target Localization Based on Virtual.
An Algorithm to Learn the Structure of a Bayesian Network Çiğdem Gündüz Olcay Taner Yıldız Ethem Alpaydın Computer Engineering Taner Bilgiç Industrial.
Bayesian Decision Theory Introduction to Machine Learning (Chap 3), E. Alpaydin.
Graduate School of Information Sciences, Tohoku University
CS 4700: Foundations of Artificial Intelligence
Inconsistent Constraints
A Bayesian Approach to Learning Causal networks
Probabilistic Horn abduction and Bayesian Networks
Chung-Kuan Cheng Position:
Representing Uncertainty
Computer Science Department Ambassador
كلية المجتمع الخرج البرمجة - المستوى الثاني
Luger: Artificial Intelligence, 5th edition
CSCE 190 Computing in the Modern World Judea Pearl ACM A. M
A graphing calculator is required for some problems or parts of problems 2000.
CSCE 190 Computing in the Modern World
Graduate School of Information Sciences, Tohoku University
Project 2 Guidelines.
Graduate School of Information Sciences, Tohoku University
Graduate School of Information Sciences, Tohoku University
Presentation transcript:

Judea Pearl The A.I. Guy (2011 Turing Award Winner) Matt Hegarty CSCE Spring 2013

His Life September 4, Tel Aviv, Israel Mandatory military service B.S. Electrical Engineering – 1960 (Technion) M.S. Electronics – 1961(Rutgers) M.S. Physics and PhD in Electrical Engineering – 1965 (Rutgers and PTI Brooklyn)

Why Judea is Awesome Bayesian Networks A way for A.I. to handle causality – Often compared to what Boolean operations were to logical calculus He also did research in physics. And computer hardware He's also a musician And he runs the Daniel Pearl Foundation (More on this later)

The Problem with Causality Probability is hard Example: Deaths from Smallpox vs deaths from Smallpox Vaccines Diagnostic vs Causal Positive feedback – You can't do both at once The solution: Directed Graphs

Bayesian Networks Courtesy of Wikipedia

Why this won a Turing Award Prior to Bayesian networks, predictive algorithms always ran in best case N^2 time. In order to get an accurate prediction, N nodes were needed for each N parameter. Bayesian Networks only need local information to perform probability calculations. Therefore operations can be run in linear time. This made probabilistic modeling a viable option for problems of a non-trivial size.

Daniel Judea's son Daniel was kidnapped and murdered in His captors demanded the release of all Pakistani terror detainees He was beheaded and cut into 10 pieces by Pakistani militants

The Foundation Founded by Judea and Ruth after Daniel's death Honors Daniel's memory, promotes understanding between Muslims and Jews Helps aspiring journalists and puts on concerts across the world