Human-centered Machine Learning

Slides:



Advertisements
Similar presentations
Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, California
Advertisements

Introduction to C Programming
Decision Theory: Sequential Decisions Computer Science cpsc322, Lecture 34 (Textbook Chpt 9.3) Nov, 28, 2012.
CS433: Modeling and Simulation
INTRODUCTION TO MODELING
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
Hybrid Approach to System-Level Performance Analysis Simon Künzli Bologna, May 22, 2006 contains joint work with Francesco Poletti, Luca Benini, and Lothar.
Course Introduction CS 1037 Fundamentals of Computer Science II.
Scalable Text Mining with Sparse Generative Models
Learning Programs Danielle and Joseph Bennett (and Lorelei) 4 December 2007.
Lecture II-2: Probability Review
Knowledge Process Outsourcing1 Turning Information into Knowledge... for YOU The Gyaan Team.
 1  GSLM System Simulation Yat-wah Wan Room: B317; ywan; Ext: 3166.
Final Review for CS 562. Final Exam on December 18, 2014 in CAS 216 Time: 3PM – 5PM (~2hours) OPEN NOTES, SLIDES, BOOKS Study the topics that we covered.
Modeling and Simulation
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Advanced Java New York University School of Continuing and Professional Studies.
Polyhedral Optimization Lecture 1 – Part 1 M. Pawan Kumar Slides available online
Network Aware Resource Allocation in Distributed Clouds.
J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, 2.
04/30/13 Last class: summary, goggles, ices Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1 Image: wordpress.com/2011/11/22/lig.
1 Lecture 4. 2 Random Variables (Discrete) Real-valued functions defined on a sample space are random vars. determined by outcome of experiment, we can.
Introduction and Overview Summer 2014 COMP 2130 Introduction to Computer Systems Computing Science Thompson Rivers University.
Computer Science 340 Software Design & Testing UML Sequence Diagrams.
CS433 Modeling and Simulation Lecture 03 – Part 01 Probability Review 1 Dr. Anis Koubâa Al-Imam Mohammad Ibn Saud University
Goals of the Workshop BUILD A COMMUNITY INTERESTED IN EVALUATION DEVELOP APPROACHES TO EVALUATION THAT COMBINE ACCOUNTABILITY AND LEARNING USE EVALUATIONS.
EAS31116/B9036: Statistics in Earth & Atmospheric Sciences Lecture 3: Probability Distributions (cont’d) Instructor: Prof. Johnny Luo
Parallelization of likelihood functions for data analysis Alfio Lazzaro CERN openlab Forum on Concurrent Programming Models and Frameworks.
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
Computer Science in Context Evangelos E. Milios Professor and Graduate Coordinator Faculty of Computer Science Dalhousie University.
Statistics 349.3(02) Analysis of Time Series. Course Information 1.Instructor: W. H. Laverty 235 McLean Hall Tel:
Quiz 3: Mean: 9.2 Median: 9.75 Go over problem 1.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
EEL 6586: AUTOMATIC SPEECH PROCESSING Hidden Markov Model Lecture Mark D. Skowronski Computational Neuro-Engineering Lab University of Florida March 31,
STAT03 - Descriptive statistics (cont.) - variability 1 Descriptive statistics (cont.) - variability Lecturer: Smilen Dimitrov Applied statistics for testing.
Mining of Massive Datasets Edited based on Leskovec’s from
Presented By Dr. Paul Cottrell Company: Reykjavik.
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
CSC 108H: Introduction to Computer Programming Summer 2012 Marek Janicki.
Physical Fluctuomatics 13th Quantum-mechanical extensions of probabilistic information processing Kazuyuki Tanaka Graduate School of Information Sciences,
CHAPTER 6 Random Variables
Manuel Gomez Rodriguez
Oliver Schulte Machine Learning 726
CS 3630 Database Design and Implementation
It’s All About Me From Big Data Models to Personalized Experience
EEL 6586: AUTOMATIC SPEECH PROCESSING Hidden Markov Model Lecture
Fundamentals of estimation and detection in signals and images
Manuel Gomez Rodriguez
Of Probability & Information Theory
Autonomous Cyber-Physical Systems: Course Introduction
Model-Driven Analysis Frameworks for Embedded Systems
Weakly Learning to Match Experts in Online Community
Topics discussed in this section:
Software, O/S & Interfaces
Temporal Location-Aware Access Control Model
332:437 Lecture 3 Hardware Design Methodology and Advanced Logic Design Hardware design.
Introduction to Visual Analytics
CS5112: Algorithms and Data Structures for Applications
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Probabilistic Databases
Sets and Probabilistic Models
Human-centered Machine Learning
Analyzing Massive Graphs - ParT I
Machine learning CS 229 / stats 229
Human-centered Machine Learning
Human-centered Machine Learning
Probabilistic Databases with MarkoViews
Sets and Probabilistic Models
Human-centered Machine Learning
Lecturer: Geoff Hulten TAs: Alon Milchgrub, Andrew Wei
Presentation transcript:

Human-centered Machine Learning Human-Centered ML Part II Human-centered Machine Learning http://courses.mpi-sws.org/hcml-ws18/

Five lectures on fundamentals Lectures for Part II Five lectures on fundamentals Marked temporal Point Processes Optimal control Reinforcement learning Seven lectures on applications Information propagation Viral marketing Disease control Opinion mining Information integrity Human learning

Evaluation for Part II Paper reviewing assignments: Only for lectures on applications Due just before the lecture Two coding assignments: Information propagation From Dec 20 to Jan 17 Viral marketing From Jan 17 to Feb 5 Final exam: On Feb 7 (review on Feb 5)

Human-centered Machine Learning Introduction to Temporal Point Processes (I) Human-centered Machine Learning http://courses.mpi-sws.org/hcml-ws18/

Many discrete events in continuous time Disease dynamics Qmee, 2013 Online actions Financial trading Mobility dynamics

Variety of processes behind these events Events are (noisy) observations of a variety of complex dynamic processes… Stock trading Article creation in Wikipedia Flu spreading News spread in Twitter Reviews and sales in Amazon Ride-sharing requests A user’s reputation in Quora Fast Slow …in a wide range of temporal scales.

Example I: Information propagation S D Christine means D follows S Bob 3.00pm 3.25pm Beth 3.27pm Joe David 4.15pm Friggeri et al., 2014 They can have an impact in the off-line world

Example II: Knowledge creation ✗ Addition Refutation Question Answer Upvote

1st year computer science student Example III: Human learning 1st year computer science student Introduction to programming Discrete math Project presentation Powerpoint vs. Keynote Graph Theory Class inheritance For/do-while loops Set theory Define functions Geometry Export pptx to pdf t How to write switch Logic PP templates If … else Private functions Class destructor Plot library

Detailed event traces Detailed Traces of Activity The availability of event traces boosts a new generation of data-driven models and algorithms t

Aren’t these event traces just time series? The framework of temporal point processes provides a native representation Discrete and continuous times series Discrete events in continuous time How long is each epoch? What about aggregating events in epochs? How to aggregate events per epoch? What if no event in one epoch? What about time-related queries? Epoch 1 Epoch 2 Epoch 3

Temporal Point Processes: Intensity function

Temporal point processes Temporal point process: A random process whose realization consists of discrete events localized in time Discrete events time History, Dirac delta function Formally:

Model time as a random variable density Prob. between [t, t+dt) time Prob. not before t History, Likelihood of a timeline:

Problems of density parametrization (I) time It is difficult for model design and interpretability: Densities need to integrate to 1 (i.e., partition function) Difficult to combine timelines

Problems of density parametrization (II) Difficult to combine timelines: time + time = ✗ Sum of random processes ✗

Intensity function History, density Prob. between [t, t+dt) time Prob. not before t History, Intensity: Probability between [t, t+dt) but not before t Observation: It is a rate = # of events / unit of time

Advantages of intensity parametrization (I) time Suitable for model design and interpretable: Intensities only need to be nonnegative Easy to combine timelines

Advantages of intensity parametrization (II) Easy to combine timeline: time + time = Sum of random processes ✗

Relation between f*, F*, S*, λ* Central quantity we will use!