Courses
Information Visualization (InfoVis) (Undergraduate and Graduate)
- 2026 Fall
- 2025 Spring
- 2024 Spring
- 2023 Fall
- 2023 Spring
- 2022 Spring
- 2021 Spring
With the advances in data storing and processing technologies, the size of data humans confront is increasing at an unprecedented rate. Despite the ever-increasing data size, our perceptual and cognitive abilities stay relatively unchanged, leading to an information gap between humans and data. Information visualization provides one means of addressing such information overload, as well-designed visual representations can assist our perceptual and cognitive abilities to understand, analyze, and memorize the data. In this course, students will learn to 1) design, evaluate, and critique visualization designs, 2) comprehend the characteristics of humans' perception that underpin visualization, 3) understand novel visualization and interaction techniques, and 4) implement interactive data visualizations.
What will you learn? →
| Week | Lecture | Lab |
|---|---|---|
| 1 | The VIS Landscape 6-area model, Vis tools from spreadsheets to D3, Working with AI | Course Overview Course logistics, Term project, Research at our lab |
| 2 | Definition and Justification Definitions of InfoVis, Why visualize, What-why-how framework | Tableau Building views, Derived data, Small multiples, View linking |
| 3 | Marks and Channels Channel effectiveness, Preattentive processing, Gestalt laws | Vega and Vega-Lite Grammar of graphics, Encodings, Transforms, Faceted views |
| 4 | Colors Color vision, Color spaces, Colormaps, Color deficiency | Dimensionality Reduction (1) Rank and eigenvectors, PCA, SNE and t-SNE |
| 5 | Data and Task Abstraction Dataset and attribute types, Actions and targets, Deriving data | Dimensionality Reduction (2) Barnes-Hut t-SNE, UMAP, Interpreting projections, Quality metrics |
| 6 | Visualizing Tables Scatterplots, Bar and line charts, Heatmaps, Parallel coordinates, etc. | D3.js (1) HTML and SVG, Selections, Data join, Animated transitions |
| 7 | Visualizing Graphs Node-link diagrams, Force-directed layout, Adjacency matrices, Treemaps, etc. | D3.js (2) Scales and axes, Legends, Modular views, Brushing and linking |
| 8 | Midterm Exam | |
| 9 | Human Factors Visual biases, Memory limits, Fitts's law, KLM | Project Proposal Presentation Overviews, Information density, Visual hierarchy, Scalability |
| 10 | Interaction Animated transitions, Coordinated views, Filtering, Aggregation | Papers: VIS + AI (1) |
| 11 | Novel Visualization Idioms Sets, Uncertainty, Event sequences, Dense data, Immersive vis | Papers: VIS + AI (2) |
| 12 | Scalability Precomputation, Sampling, Prefetching, Progressive visual analytics | Papers: VIS + X |
| 13 | Validation and Evaluation Four levels of vis design, Threats to validity, Experimental design | Papers: VIS + Human |
| 14 | Rules of Thumb and VIS-AI Heuristics No unjustified 3D, Overview first, Show uncertainty, No unjustified AI | Project Presentations |
| 15 | Final Exam | |
| 16 | Writing and Reviewing VIS Papers Contribution types, Paper structure, Course review | Q&A |
Introduction to Human-Computer Interaction (HCI) (Undergraduate)
- 2026 Fall
- 2025 Fall
- 2024 Fall
- 2023 Fall
- 2022 Fall
- 2021 Fall
This course provides an introduction to and overview of the field of human-computer interaction (HCI). We learn to design, prototype, and evaluate user interfaces for computers upon the theories and methodologies from computer science, cognitive psychology, and human factors. Course materials include classic and recent research papers in HCI. We cover the following topics: human factors, usability, design thinking process, design principles, and experimental design.
What will you learn? →
| Week | Lecture | Lab |
|---|---|---|
| 1 | Introduction Scope of HCI, Good vs bad design, Fitts's law preview | Course Overview Course logistics, Design project |
| 2 | Definition and History Usability and UX goals, History of HCI, Direct manipulation | 5 Chairs Design Challenge Icebreaking, Designing for a specific user |
| 3 | Human Factors Sensors and responders, Perception, Memory, Human errors | Mini-Design Project (1) Point of view, How might we questions |
| 4 | Design Thinking Process Five-stage process, Interviews, Contextual inquiry, Task analysis | Mini-Design Project (2) Brainstorming rules, Generating many ideas |
| 5 | Interaction Elements and Human Models Control-display mapping, Affordances, Mental models, Norman's gulfs | Design Project Kickoff Finding a theme, Past projects, Team formation |
| 6 | Ideation and Prototyping Personas, Storyboards, Brainstorming, Lo-fi to hi-fi prototypes | Empathize Interviews, Observation |
| 7 | Model Human Processor Three processors, Perceptual fusion, Working memory, Chunking | Define Qualitative coding, Point of view, Personas, Storyboarding |
| 8 | Midterm Exam | |
| 9 | Modeling Interaction Descriptive vs predictive models, Fitts's law, Hick-Hyman law, KLM | Ideate Brainstorming, Why prototype, User feedback tips |
| 10 | Design Heuristics and Principles Gestalt laws, Cognitive walkthrough, Nielsen's heuristics | Lo-fi Prototyping Paper prototypes, Feedback |
| 11 | Experimental Design Variables, Validity, Within vs between subjects, Pilot studies | Mid-fi Prototyping Clickable wireframes, Transitions and links |
| 12 | Hypothesis Testing T-tests, ANOVA, Chi-square test, Think-aloud, Wizard of Oz | Experimental Design Planning a user study, Final report |
| 13 | Human-AI Interaction Why AI UX is different, Microsoft's human-AI guidelines | User Testing Running user tests, Reporting results |
| 14 | Human-Data Interaction Data analysis tasks, Visual perception, Visual encoding, Color | Project Presentations (1) |
| 15 | Let's Read Together Reading HCI papers, User study design, Choosing baselines | Project Presentations (2) |
| 16 | Final Exam | |
Fundamentals of Machine Learning (Undergraduate)
- 2026 Spring
- 2025 Fall
- 2025 Spring
- 2024 Fall
This course provides an introduction to the fundamental concepts and algorithms of machine learning. We will cover the basic concepts of machine learning, including supervised methods, such as linear regression, SVM, and neural networks as well as unsupervised ones, such as clustering and dimensionality reduction. We will also discuss the theoretical aspects of machine learning, such as bias-variance tradeoff, overfitting, and generalization.
What will you learn? →
| Week | Lecture | Lab |
|---|---|---|
| 1 | Machine Learning Basics Training and testing, Loss functions, Gradient descent, Convexity | Course Overview Course logistics |
| 2 | Linear Regression Normal equation, Mini-batch SGD, Learning rates, Basis functions | Vector Derivatives Vector derivatives, Unconstrained and constrained optimization |
| 3 | Probability Axioms, Conditional probability, Bayes' theorem, Random variables | k-Nearest Neighbors Kernel regression, Distance measures, Parametric vs non-parametric |
| 4 | Information Theory Entropy, Cross-entropy, KL divergence, MLE and MAP | Convex Optimization Deriving the normal equation, Convex optimization |
| 5 | Logistic Regression Sigmoid and odds, Cross-entropy loss, Softmax regression | Bias-Variance Tradeoff True vs empirical risk, Bias-variance-noise decomposition |
| 6 | Training and Evaluation Overfitting, Regularization, Cross-validation, Precision and recall | Chain Rule Numerical differentiation, Gradients of composite functions |
| 7 | Decision Trees Information gain, ID3 and C4.5, CART, Overfitting | Midterm Review Bias and variance, Softmax regression, Evaluation metrics |
| 8 | Midterm Exam | |
| 9 | Ensemble Methods Bias-variance tradeoff, Bagging, Random forests, AdaBoost | Manifold and Feature Learning High-dimensional data, Manifold hypothesis |
| 10 | Neural Networks Perceptron, XOR and MLP, Deep neural networks, Backpropagation | Dimensionality Reduction Curse of dimensionality, PCA, t-SNE |
| 11 | Clustering (1) K-means, Gaussian mixture models, EM algorithm | Backpropagation Forward and backward passes, Error backpropagation, XOR example |
| 12 | Clustering (2) Hierarchical clustering, Dendrograms, DBSCAN | Proofs on Bagging and AdaBoost Variance of bagging, Deriving AdaBoost weights |
| 13 | Support Vector Machine Lagrange duality, Maximum margin, Soft margin, Kernel trick | Implementing Softmax Regression Softmax regression from scratch, Implementation pitfalls |
| 14 | Interpretable Machine Learning Interpretable models, PDP, Permutation importance, LIME, SHAP | Support Vector Machine, Step by Step Soft-margin SVM, Lagrangian and dual problem, Kernels |
| 15 | Final Exam | |
| 16 | Course Wrap-up and Q&A | |
Problem Solving (Undergraduate)
- 2026 Spring, Fall
- 2025 Fall
- 2024 Fall
- 2023 Fall
- 2022 Spring, Fall
- 2021 Fall
- 2020 Fall
The objective of this course is to develop problem-solving skills using the C programming language. We will first cover the important concepts in the C programming language from the very basic syntax to its advanced usages. We will practice C programming skills by solving problems from real-world programming challenges. Having background knowledge about programming is recommended but not necessary. We will focus on practicing and improving your programming skills rather than learning complex algorithms.
What will you learn? →
| Week | Lecture | Lab |
|---|---|---|
| 1 | Introduction What PS is, How online judges grade code, Time and space complexity | Course Overview Development environment, Online judge |
| 2 | Variables, Operators, and Control Flow Bits and bytes, C types and operators, Overflow, Control flow | Coding Challenges (1) LeetCode 263 (Easy), 70 (Easy), 172 (Medium), 204 (Medium) |
| 3 | Arrays and Functions Variable scope, 1D and 2D arrays, Writing functions, Call by value vs reference | Coding Challenges (2) LeetCode 283 (Easy), 136 (Easy), 53 (Medium), 169 (Easy) |
| 4 | I/O, Strings, and Structures Formatted I/O, ASCII and Unicode, C strings, Structures | Coding Challenges (3) LeetCode 13 (Easy), 171 (Easy), 3 (Medium), 28 (Easy) |
| 5 | Pointers Memory addresses, Pointer arithmetic, Function pointers | Coding Challenges (4) LeetCode 134 (Medium), 402 (Medium), 41 (Hard), 214 (Hard) |
| 6 | Dynamic Memory Allocation Heap allocation, Memory leaks, 2's complement, Bitwise tricks | Coding Challenges (5) LeetCode 2 (Medium), 19 (Medium), 209 (Medium) |
| 7 | Two Pointers Competition strategy, Two-pointer technique, Proof by contradiction | Coding Challenges (6) LeetCode 845 (Medium), 1793 (Hard), 84 (Hard), 1712 (Medium) |
| 8 | Recursion Recursive thinking, Backtracking, Memoization, Pruning the search space | Coding Challenges (7) LeetCode 1823 (Medium), 1863 (Easy), 1079 (Medium), 1444 (Hard) |
| 9 | Midterm Exam | |
| 10 | Stack, Queue, and Priority Queue Array-based stacks and queues, Heaps, Classic problems | Coding Challenges (8) LeetCode 264 (Medium), 295 (Hard), 1851 (Hard) |
| 11 | Sorting O(n log n) sorts, Counting sort, Sorting as preprocessing | Coding Challenges (9) LeetCode 215 (Medium), 2406 (Medium), 1353 (Medium) |
| 12 | Binary Search Lower and upper bounds, Off-by-one errors, Search on the answer | Coding Challenges (10) LeetCode 275 (Medium), 33 (Medium), 4 (Hard) |
| 13 | Graph, DFS, and BFS Adjacency matrix vs list, DFS and BFS, Flood fill and mazes | Coding Challenges (11) LeetCode 207 (Medium), 841 (Medium), 329 (Hard) |
| 14 | Dynamic Programming (1) Spotting DP problems, Defining states and recurrences, Fibonacci and LIS | Coding Challenges (12) LeetCode 279 (Medium), 416 (Medium), 516 (Medium) |
| 15 | Dynamic Programming (2) Sequence DP with LCS and edit distance, Interval DP, Course review | Coding Challenges (13) LeetCode 805 (Hard), 2218 (Hard), 304 (Medium) |
| 16 | Final Exam | |