COMP 690: Deep Generative Models

COMP 690: Deep Generative Models

Fall 2026 · Department of Computer Science, University of North Carolina at Chapel Hill

Overview

This course provides an advanced introduction to deep generative models — the algorithms behind modern image, video, 3D, action, and language generation systems. It is open to graduate students and senior undergraduates. The course is split roughly in half: Part I covers the core principles and theory behind the major model families (autoregressive models, variational autoencoders, normalizing flows, generative adversarial networks, energy-based and score-based models, diffusion models, and flow matching), along with discrete generative models and techniques for efficient training and fast inference; Part II turns to applications, exploring how these techniques drive current state-of-the-art systems in unified multimodal (omni) models, video synthesis, 3D content creation, robotics, and the sciences. Students will read and present recent papers and complete a research-style final project.

Logistics

Time
Tuesday & Thursday, 5:00 – 6:15 PM
Dates
August 20 – December 10, 2026
Location
FB 007
Instructor
Jason Ren
Office Hours
Tuesdays 4:00 – 5:00 PM, FB 240
Prerequisites
Familiarity with probability, linear algebra, and deep learning fundamentals (e.g., a prior ML/DL course)

Grading

  • 50% — Final project
    • 5% — Proposal
    • 20% — Presentation
    • 25% — Final artifacts
  • 25% — Paper reviews
  • 25% — Paper presentation

Plus a 5% bonus for active class participation. Good discussions happen when everyone shows up having read the papers, so please come prepared and jump in when you have thoughts or questions. Don't worry if a paper isn't fully clear to you — you're probably not the only one, and asking about it is often exactly what gets a discussion going.

Final Project

The final project is the heart of this course — a chance to turn what you've learned about generative modeling into a piece of original research. We're far more excited by an ambitious, original idea than by a safe, predictable one. We strongly encourage novel ideas, algorithms, or applications — even (especially!) if your experiments are still preliminary by the end of the semester. Simply reproducing numbers from an existing paper, running an existing pipeline on a similar new dataset, or tuning parameters/prompts on top of someone else's method is unlikely to be very exciting to us, and won't be evaluated as favorably as a genuine attempt at something new. Take the risk — we'd rather see you chase a hard, interesting question than play it safe.

  • Proposal: 5-minute in-class presentation, plus a written proposal (up to 2 pages) covering:
    • Overview: What problem are you tackling, and what's your core idea?
    • Related work: What relevant work exists (not limited to papers covered in this course)? What makes your project distinct from what's already been done?
    • Approach: What representations and algorithms will you use? What's the technical novelty — can you explain it clearly, and ideally formalize it?
    • Experiments: How will you evaluate your approach — through ablations, comparisons to existing methods, or both? What data will you use, and what baselines will you compare against? If you plan to collect your own data, explain how.
    • Others: What do you hope to learn or produce from this project? What's still uncertain at this stage? Share any early results if you have them.
  • Final artifacts:
    • A report (up to 8 pages) covering:
      • Introduction: Summarize the problem, your main idea, and your results.
      • Related work: Give a thorough account of related papers (not limited to those in the schedule). If you're proposing something new or extending prior work, contrast it directly against that work; if you're analyzing existing techniques, situate them relative to the broader literature.
      • Approach: Describe your method in enough detail that a reader could re-implement it without consulting outside sources — clearly state the inputs, outputs, and any assumptions or design decisions you made along the way.
      • Experiments & Results: For each experiment, explain what you ran, why you ran it, and what you learned from the outcome. Back this up with figures, tables, and qualitative examples wherever they help make the point.
      • Limitations: Be upfront about where your approach falls short and what constraints shaped your results.
      • LLM usage: Use of LLMs is allowed — describe how they were used throughout the project.
      • Team contributions: Clearly state each team member's individual contributions and how the work was split.
      • Conclusion: Recap the main idea and findings, and discuss what you'd explore next.
    • A results webpage showcasing qualitative results (visualizations, images/videos, figures)
    • Source code
    • Dataset & Benchmark (if applicable)
  • Project presentation: 10-minute talk + 5-minute Q&A
  • Team size: Up to 3 people

All written components (proposal and final report) should use the CVPR template.

You're welcome to stop by office hours at any point in the semester to talk through your project — whether that's brainstorming ideas, debugging a puzzling result, working through a failure, or just planning next steps.

Paper Reviews

Before each Readingclass, every student must submit a short review of one of the suggested papers via [Google Form link — TBD]. The form will contain the following questions:

  • What's the main contribution or novelty of this paper?
  • What's the most questionable claim in the paper, and how would you attack it?
  • What are the strongest and weakest results in the paper, and how would you improve them?
  • Do the experiments actually support the paper's claims?
  • How could this work be extended?
  • What questions do you have for the instructor/presenter — confusing points, open questions, etc.?
  • ...

Reviews are due 11:59 PM ET the day before class. We don't accept late submissions, but everyone gets two missed reviews forgiven over the semester. You may skip submitting a review for the class in which you are presenting a paper.

Paper Presentation

For each paper covered in a Readingsession, either a student or the instructor will present it — one person per paper — and lead the in-class discussion. The instructor will then close out the session with a 10-minute summary discussion tying all the papers together.

  • Sign up for papers here: [Google Sheet link — TBD]
    • Each student will present X papers over the semester (the exact number will be determined once final enrollment is set)
    • The instructor will present any papers that remain unclaimed
  • Aim for roughly a 20-minute talk (about 15 slides) that's well-organized and polished, covering:
    • A clear statement of the problem
    • Why the problem matters — what makes it interesting, important, and/or hard
    • The paper's key contributions and technical ideas
    • The experimental setup and results
    • Strengths and weaknesses
    • Open questions, possible extensions, and/or applications worth discussing
  • Keep slides visual — lean on figures, animations, and videos rather than text. Feel free to pull material from the authors' project page or webpage, and it's fine to reuse the authors' own slides, but clearly cite any slide that isn't originally yours.
  • [Required!] Email the instructor a draft of your slides two days before your presentation (Sun 5 PM for Tue classes, Tue 5 PM for Thu classes) to get feedback.
  • [Required!] Email your final slides to the instructor before class, making sure you have incorporated that feedback.

Schedule

The schedule is tentative and subject to change.

Week Date Topic Course Material Presenter
Part I: Principles & Theory
1 Thu, Aug 20 Lecture Introduction Slides Jason
2 Tue, Aug 25 Lecture Autoregressive (AR) Slides Jason
Thu, Aug 27 Reading Autoregressive (AR)
  1. Hoffmann et al., Training Compute-Optimal Large Language Models (Chinchilla), NeurIPS 2022
  2. Ouyang et al., Training Language Models to Follow Instructions with Human Feedback (InstructGPT), NeurIPS 2022
  3. Tian et al., Visual Autoregressive Modeling: Scalable Image Generation via Next-Scale Prediction, NeurIPS 2024
TBD
3 Tue, Sep 1 Lecture Variational Autoencoder (VAE) Slides Jason
Thu, Sep 3 Reading Variational Autoencoder (VAE)
  1. Higgins et al., beta-VAE: Learning Basic Visual Concepts with a Constrained Variational Framework, ICLR 2017
  2. Vahdat & Kautz, NVAE: A Deep Hierarchical Variational Autoencoder, NeurIPS 2020
  3. Child, Very Deep VAEs Generalize Autoregressive Models and Can Outperform Them on Images, ICLR 2021
TBD
4 Tue, Sep 8 Lecture Normalizing flows Slides
  1. Lilian Weng, Flow-based Deep Generative Models (blog post)
Jason
Thu, Sep 10 Reading Normalizing flows
  1. Kingma & Dhariwal, Glow: Generative Flow with Invertible 1x1 Convolutions, NeurIPS 2018
  2. Zhai et al., Normalizing Flows are Capable Generative Models (TarFlow), ICML 2025
  3. Gu et al., STARFlow: Scaling Latent Normalizing Flows for High-resolution Image Synthesis, NeurIPS 2025
TBD
5 Tue, Sep 15 Lecture Generative adversarial network (GAN) Slides Jason
Thu, Sep 17 Reading Generative adversarial network (GAN)
  1. Zhu et al., Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks (CycleGAN), ICCV 2017
  2. Sauer et al., StyleGAN-T: Unlocking the Power of GANs for Fast Large-Scale Text-to-Image Synthesis, ICML 2023
  3. Kang et al., Scaling up GANs for Text-to-Image Synthesis, CVPR 2023
TBD
6 Tue, Sep 22 Lecture Discrete generative models (AR, VAE, GAN) Slides
  1. van den Oord et al., Neural Discrete Representation Learning (VQ-VAE), NeurIPS 2017
  2. Esser et al., Taming Transformers for High-Resolution Image Synthesis (VQGAN), CVPR 2021
  3. Chang et al., MaskGIT: Masked Generative Image Transformer, CVPR 2022
Jason
Thu, Sep 24 Lecture Energy-based model (EBM) Slides
  1. LeCun et al., A Tutorial on Energy-Based Learning, 2006
  2. Du & Mordatch, Implicit Generation and Generalization in Energy-Based Models, NeurIPS 2019
Jason
7 Tue, Sep 29 Lecture Score-based models Slides Jason
Thu, Oct 1 Presentation Proposal presentation & discussion All students
8 Tue, Oct 6 No class — Well-Being Day
Thu, Oct 8 Lecture Diffusion models Slides
  1. Sohl-Dickstein et al., Deep Unsupervised Learning using Nonequilibrium Thermodynamics, ICML 2015
  2. Song & Ermon, Generative Modeling by Estimating Gradients of the Data Distribution, NeurIPS 2019
  3. Ho et al., Denoising Diffusion Probabilistic Models, NeurIPS 2020
Jason
9 Tue, Oct 13 Reading Diffusion models
  1. Ho & Salimans, Classifier-Free Diffusion Guidance, NeurIPS 2021
  2. Salimans & Ho, Progressive Distillation for Fast Sampling of Diffusion Models, ICLR 2022
  3. Rombach et al., High-Resolution Image Synthesis with Latent Diffusion Models, CVPR 2022
TBD
Thu, Oct 15 No class — Fall Break
10 Tue, Oct 20 Lecture Flow matching Slides
  1. Lipman et al., Flow Matching for Generative Modeling, ICLR 2023
  2. Albergo & Vanden-Eijnden, Building Normalizing Flows with Stochastic Interpolants, ICLR 2023
  3. Liu et al., Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow, ICLR 2023
Jason
Thu, Oct 22 Reading Flow matching
  1. Esser et al., Scaling Rectified Flow Transformers for High-Resolution Image Synthesis, ICML 2024
  2. Ma et al., SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformers, ECCV 2024
  3. Chen & Lipman, Riemannian Flow Matching on General Geometries, ICLR 2024
TBD
11 Tue, Oct 27 Lecture Discrete generative models (diffusion, flow matching) Slides
  1. Austin et al., Structured Denoising Diffusion Models in Discrete State-Spaces, NeurIPS 2021
  2. Sahoo et al., Simple and Effective Masked Diffusion Language Models (MDLM), NeurIPS 2024
  3. Gat et al., Discrete Flow Matching, NeurIPS 2024
Jason
Thu, Oct 29 Lecture Efficiency & acceleration Slides
  1. Song et al., Denoising Diffusion Implicit Models (DDIM), ICLR 2021
  2. Song et al., Consistency Models, ICML 2023
  3. Leviathan et al., Fast Inference from Transformers via Speculative Decoding, ICML 2023
Jason
12 Tue, Nov 3 Lecture AR + Diffusion Slides
  1. Li et al., Autoregressive Image Generation without Vector Quantization, NeurIPS 2024
  2. Arriola et al., Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Models, ICLR 2025
  3. Chen et al., Diffusion Forcing: Next-token Prediction Meets Full-Sequence Diffusion, NeurIPS 2024
Jason
Part II: Applications
Thu, Nov 5 Reading Application - Omni Models
  1. ByteDance Seed, Emerging Properties in Unified Multimodal Pretraining (BAGEL), arXiv 2025
  2. Zhou et al., Transfusion: Predict the Next Token and Diffuse Images with One Multi-Modal Model, arXiv 2024
  3. Xie et al., Show-o: One Single Transformer to Unify Multimodal Understanding and Generation, arXiv 2024
TBD
13 Tue, Nov 10 Reading Application - Video Generation
  1. Huang et al., Self Forcing: Bridging the Train-Test Gap in Autoregressive Video Diffusion, NeurIPS 2025
  2. Bruce et al., Genie: Generative Interactive Environments, arXiv 2024
  3. Meta Movie Gen Team, Movie Gen: A Cast of Media Foundation Models, arXiv 2024
TBD
Thu, Nov 12 No class — CVPR deadline
14 Tue, Nov 17 Reading Application - 3D Generation
  1. Xiang et al., Structured 3D Latents for Scalable and Versatile 3D Generation (TRELLIS), CVPR 2025
  2. Hong et al., LRM: Large Reconstruction Model for Single Image to 3D, ICLR 2024
  3. Siddiqui et al., MeshGPT: Generating Triangle Meshes with Decoder-Only Transformers, CVPR 2024
TBD
Thu, Nov 19 Reading Application - Robotics I
  1. Janner et al., Planning with Diffusion for Flexible Behavior Synthesis, ICML 2022
  2. Chi et al., Diffusion Policy: Visuomotor Policy Learning via Action Diffusion, RSS 2023
  3. Yang et al., UniSim: Learning Interactive Real-World Simulators, ICLR 2024
TBD
15 Tue, Nov 24 Reading Application - Robotics II (World Action Models)
  1. Ye et al., World Action Models are Zero-shot Policies, arXiv 2026
  2. Zhu et al., Unified World Models: Coupling Video and Action Diffusion for Pretraining on Large Robotic Datasets, arXiv 2025
  3. NVIDIA, Cosmos 3: Omnimodal World Models for Physical AI, arXiv 2026
TBD
Thu, Nov 26 No class — Thanksgiving
16 Tue, Dec 1 Reading Application - Science
  1. Hoogeboom et al., Equivariant Diffusion for Molecule Generation in 3D (EDM), ICML 2022
  2. Watson et al., De novo design of protein structure and function with RFdiffusion, Nature 2023
  3. Abramson et al., Accurate structure prediction of biomolecular interactions with AlphaFold 3, Nature 2024
TBD
Thu, Dec 3 Presentation Final project presentations All students
17 Tue, Dec 8 Presentation Final project presentations All students
Thu, Dec 10 No class — final report due 5:00 PM ET

Resources

Related courses

Blogs & tutorials

Misc.

  • Honor Code: All students are expected to abide by the UNC Student Code of Conduct.
  • Academic Integrity: For your presentations and projects, you are allowed to use materials from external sources. However, you must clearly acknowledge those sources.