# Course:CPSC522

CPSC 522 Wiki | |
---|---|

CPSC 522 | |

Section: | |

Instructor: | David Poole |

Email: | poole@cs.ubc.ca |

Office: | 109 |

Office Hours: | after class every day |

Class Schedule: | |

Classroom: | DMP 101 |

Important Course Pages | |

Syllabus | |

Lecture Notes | |

Assignments | |

Course Discussion | |

Welcome to CPSC 522 Wiki. This is where the participants are writing the textbook. See http://www.cs.ubc.ca/~poole/cs522/2020/ for the main web page for the course.

## Contents

## The 2020 Rules

- These rules are editable, so you can change the rules.
- 2020 Student Presentation Schedule is the schedule for presentations.
**Please sign up early. This is first-come first-choice.**There is a maximum of 2 students per day. - January and February Assignments describes your assignments for January and February.
- March-April Assignment describes your 3rd assignment.
- Do not plagiarize; give references to all sources. Put quotes in quotes.
- All pages should follow the CPSC522 Template
- Give links, but make sure that the pages are readable (with sentences) without following the links.
- Link to all prerequisite pages (those the page builds on) in the appropriate place in the template. The prerequisite pages should not form a cycle.
- Link to all related pages; it should be easy for someone to determine that a page on a particular topic does not exist.
- The web pages created should all be in the Course:CPSC522 hierarchy, but should not contain "Course:CPSC522" in the visible link. Hint: create a link to the page before the page exists, then you will be asked to create the page,
- If you want to abandon a page that others are relying on (e.g., you are the principal author and they are coauthors) you need to negotiate with them to make sure no one is disadvantaged.
- All pages should be in the Index and the table of contents below.

## Old (2018, 2019) Rules

- 2018 Student Presentation Schedule is the schedule for presentations.
**Please sign up early. This is first-come first-choice.**There is a maximum of 3 students per day. - January Assignment describes your assignment for January.
- February Assignment describes your assignment for February.
- March-April Assignment describes your 3rd assignment.
- Do not plagiarize; give references to all sources. Put quotes in quotes.
- All pages should follow the CPSC522 Template
- Give links, but make sure that the pages are readable (with sentences) without following the links.
- Link to all prerequisite pages (those the page builds on) in the appropriate place in the template. The prerequisite pages should not form a cycle.
- Link to all related pages; it should be easy for someone to determine that a page on a particular topic does not exist.
- The web pages created should all be in the Course:CPSC522 hierarchy, but should not contain "Course:CPSC522" in the visible link. Hint: create a link to the page before the page exists, then you will be asked to create the page,
- If you want to abandon a page that others are relying on (e.g., you are the principal author and they are coauthors) you need to negotiate with them to make sure no one is disadvantaged.
- All pages should be in the Index and the table of contents below.

## Guidelines

- Keep each page as simple as possible (but not simpler); if a page starts to get complicated, consider splitting it.
- Write pages for your peers; they should all be written for incoming graduate students, and only assume background knowledge that is common among such students.
- All pages should obey the Syntax Conventions. If there is a design decision that you need to make that may have non-local implications, add it to the conventions.
- It should use formalism and mathematics when (and only when) the formalism make the description clearer. Use the code tags for math, e.g., It is worth your while to learn Latex if you don't already know it.
- If there is a simple case, and a more general case, give the simple case first. Making things complicated is easy; keeping them simple is difficult and we should strive for simplicity. Any complication needs to be carefully motivated.
- Use the "discussion" tab

Each Page should contain:

- A clear jargon-free description of what is going on. Keep jargon to a minimum.
- Motivating example(s) and, where appropriate, a simple pedagogical example (which may be different from the motivating examples) that is used to explain what is going on
- An argument of plausibility
- Evidence that it works
- Code and pseudo-code, where appropriate. This code should interact with other related code (e.g., AIFCA Python Distribution) if possible. The code should be as simple as possible to implement the techniques. Consider adding exercises as to what can be improved or made more general or bullet-proof. Use a
`code block`

for (pseudo-)code (even multi-line code). You can also use the format in http://wiki.ubc.ca/Course:CPSC_320/Midterm_2_Reference_Sheet#Pseudocode (try both and see which better suits your needs).

## Foundations

Please add your page here and in the Index.

### General

- Artificial General Intelligence (2018)
- Swarm Intelligence (2018)

### Control

- Control Theory (2016)
- Hierarchical Control (2016)

### Probability and Graphical Models

- Probability (2016)
- Graphical Models (2016)
- Bayesian Networks (2016)
- Markov Networks (2016)
- J0 Weighted Model Counting(2019)

#### Temporal Models

- Markov Chains (2018)
- Hidden Markov Models (2016)
- Kalman filter (2018)
- Dynamic Bayesian Networks (2018)

#### Inference

- Variable Elimination (2016)
- Markov Chain Monte Carlo (2016)
- Particle Filtering (2016)
- J1 Treatment of Missing Data (2019)
- J2 Bayesian Coresets (2019)

#### Causality

- Causality (2016)

#### Representations of Conditional Probability

- Neural Network (2016)
- Recurrent Neural Networks (2018)
- Decision Trees (2018)

#### Learning

- Learning Probabilistic Models with Complete Data (2018)
- Support Vector Machines (2018)
- Ensemble Learning (2018)

### NLP

### Utility and Preferences

- Bounded Rationality (2018)
- J3 Elicitation of Factored Utilities (2019)

### Acting Under Uncertainty

- Decision Networks (2016)
- Markov Decision Process (2016)
- Reinforcement Learning (2016)
- Reinforcement Learning with Function Approximation (2016)
- Game Theory (2016)
- Multi-Agent Systems (2018)
- Stochastic Optimization (2018)
- J4 Value of Information (2019)

### Logic

- Abduction (2018)
- Knowledge Compilation (2016)
- Predicate Calculus (2016)
- Markov Logic (2018)
- Higher Order Logic (2018)
- J5 Ontology (2019)

## Existing Combinations (2016)

- Recommendation System using Matrix Factorization
- Latent Dirichlet Allocation
- Deep Neural Network and Game of Go
- Problog
- Maximum Entropy Markov Models
- Ontology Search Engine
- Convolutional Neural Networks
- Learning Markov Logic Network Structure
- Decision Support System using Interactive Preference Elicitation
- Predicting Affect of User's Interaction with an Intelligent Tutoring System
- Record Linkage and identity uncertainty
- Robot Scientist
- Density-Based Unsupervised Learning
- Predicting Human Behavior in Normal-Form Games
- Identity Uncertainty
- Generative Adversarial Networks
- Inductive Logic Programming
- User-Adaptive Information Visualization

## Existing Combinations (2018)

### Neural Networks

- Financial Forecasting using LSTM Networks (2018)
- Character Level Language Models using LSTM (2018)
- Text Summarization using Machine Learning (2018)
- Password Cracking using Probabilistic Context Free Grammars and Neural Networks (2018)
- CNNs in Image Segmentation(2018)
- Image Classification With Convolutional Neural Networks (2018)
- Image Colourization using Deep Learning(2018)
- Stacked Generative Adversarial Networks (2018)

### Reinforcement Learning

- Deep Q-Learning (2018)
- Deep Reinforcement Learning (2018)
- Self-Improving Machines (2018)
- Adaptive Network Routing using Ant Colony Optimization (2018)

### Decision-theoretic Planning

### Relational Reasoning

- Transfer Learning with Markov Logic (2018)
- Cognitive Robotics (2018)

### Applications

- Affect Prediction using Eye Gaze (2018)
- Conflict-Driven Clause Learning for the Boolean Satisfiability Problem (2018)

## Existing Combinations (2019)

- F0: Ontology Extraction
- F1: Restricted Boltzmann Machines for Collaborative Filtering
- F2: Minimax Regret Preference Elicitation for Risky Prospects
- F3: Sequential Monte Carlo samplers
- F4: FastSLAM
- F5: Sequential Monte Carlo for Probabilistic Graphical Models

## Future combinations (2016)

- Sentiment Analysis: Movie Reviews
- Collaborative Filtering
- List Recommendation
- Inactive Cookie Mapping via Trail Matching
- Improve Recommendation System by Integration
- Identity Uncertainty in a restaurant data-set
- Regularization for Neural Networks
- Spam Detection
- Titanic: Machine Learning from Disaster
- Automatic Classification of Morphological Heart Arrhythmia
- Linking Sentences in Asynchronous Conversations
- Generic Aspect-based Aggregation of Sentiments
- Graph Based Key-corporation Extraction
- Improving the accuracy of Affect Prediction in an Intelligent Tutoring System
- Improving Human Behavior Prediction in Simultaneous-Move Games
- The Automation of Disease Diagnosis
- Analyzing online dating trends with Weka

## Future combinations (2018)

- Artificial Intelligence and Economic Theory
- Weak Semantic Map: Simplified Chinese
- Datacenter Traffic as Reinforcement Learning Problem
- A Theoretical Baseline of Recursive Self-improvement
- Text summarization for busy people!!
- An evaluation on selecting and applying Recommendation Methods
- Learning User Preferences of Motion Control
- Experiments with Reinforcement Learning
- A Comparison of LDA and NMF for Topic Modeling on Literary Themes
- Analysis of hierarchical prior for Language modeling
- Better Caching using reinforcement learning
- Evaluating Ant Colony Optimization in a simulation
- SLAM and Sensor Quality
- Text generation with LSTM and Markov Chain
- Topology and Embedding Multi-relational Data

## Future combinations (2019)

- Reinforcement Learning with Linear Model of Reward Corruption
- Adversarial Belief Propagation
- Using Subset Information with Matrix Factorization
- Learning Attention via Active Inference
- Regularization as an Alternative to Negative Sampling in KGs

## Suggested Unclaimed Pages

Here are some possible topics for pages. This list is not meant to limit your imagination. Some of them might be better split into multiple pages. There are many other possible topics.

When claimed, these pages should be moved from this section to the table of contents above and to the Index of existing pages. To claim a page you have to actually create it and edit it (and have your name on the page, so everyone can see who has claimed it).

- Probability - general semantics with infinitely many variables and/or variables with infinite domains
- Representations of Conditional Distributions
- Partially Observable Markov Decision Processes
- Recursive Conditioning
- Variational Inference
- Parity Methods for Probabilistic Inference
- Matrix Factorization
- Utility
- Multi-Attribute Utility
- Preference Elicitation
- Mechanism Design
- Logic Programming
- Negation as Failure
- Equality/Identity
- Inductive Logic Programming
- Ontologies
- Continual Learning