Computer Science
388 LECTURES · PAGE 6 OF 17
Generative AI: Adapting LLMs with Parameter-Efficient Fine-Tuning
Generative AI: Text-to-Image Models
How Hard is too Hard? An Introduction to Complexity
AI Agent Simulation of Human Behavior
An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC Learning
Gravitational Waveform Modeling with Physics-Informed Neural Networks and Surrogates
Learning from Complexity
A Probabilistic Construction of Bipartite Ramanujan Graphs
Generative AI: Large Language Models (LLMs) and Retrieval Augmented Generation (RAG)
Lecture 16: Data Compression and Shannon's Noiseless Coding Theorem
A Complexity Lower Bound on Algebra Isomorphisms
Reverse Mathematics of Complexity Lower Bounds, Part II
Lecture 2: Independence and Conditioning
Fiction and Stories in Games
Embodied Intelligence with Morphing Materials and Mechanisms
Automorphism in Gauge Theory and Clifford-Hierarchy Stabilizer Codes
Abstraction and Simulation
Puzzles
Transmitting Information Reliably over a Noisy Channel & Shannon's Noisy Coding Theorem
AI in Healthcare: Why Hospitals Are Moving Cautiously Toward Consolidation
All-Pairs Min-Cut vs. All-Pairs Shortest-Path
Deep Learning for Natural Language: Transformers, Self-Supervised Learning
A More Efficient Sifting Lemma and a Stronger 3-Player Communication Lower Bound
Frontier Systems: Opening Lecture