Computer Science
>
>

CSE 515 Statistical methods in computer science

Winter 2021

University of Washington

It emphasizes inference in engineering settings, utilizing the powerful language of probabilistic graphical models. This course provides a good blend of probability theory, graph theory, and computation.

Course Page

Overview

This course focuses on how to address inference in complex engineering settings. While driven by applications, the course is not about these applications. Rather, it emphasizes a common foundation and conceptual framework for inference-related questions arising in various fields including, but not limited to, machine learning, signal processing, artificial intelligence, computer vision, control, and communication. We focus on inference: learning about the hidden state of the world that we care from available observations. We rely on the powerful language of probabilistic graphical models to leverage on the inherent structure of the given problem and efficiently perform inference. Graphical models build upon the beautiful marriage between probability theory and graph theory and use graphs to capture the fundamental structure of multivariate statistical models and also design efficient computation for inference tasks.

Prerequisites

Students entering the class should be comfortable with programming and should have a pre-existing working knowledge of linear algebra (e.g., MATH 308), probability and statistics (e.g., CSE 312/STAT390), and algorithms. For a brief refresher, we recommend that you consult the statistics/probability reference materials on the Textbooks page.

Learning objectives

No data.

Textbooks and other notes

Textbook and reference materials

There is no existing text that perfectly matches the content of CSE515. However, the following references contain useful additional details and insights. Email the instructor if you are interested in further reading materials.

Other courses in Theoretical Computer Science

15-453 - Formal Languages, Automata, and Computability

Spring 2015

Carnegie Mellon University

CS 263 Counting and Sampling

Autumn 2022

Stanford University

CS 251 Great Ideas in Theoretical Computer Science

Fall 2022

Carnegie Mellon University

CSE 311 Foundations of Computing I

Autumn 2021

University of Washington

Courseware availability

Lecture slides and notes available at Tentative Schedule

No videos available

Homework available at Homework

Readings available at Tentative Schedule

Covered concepts