Courses
Start building your summer today by selecting from hundreds of Columbia courses from various topics of interest. Courses for Summer 2026 are now available, with new offerings being added throughout the winter into early spring.
Please note: listing your desired courses in your visiting application does not automatically register you for those courses, nor does it guarantee seat availability.
Key to Course Listings | Course Requirements
Course Options
Logic and formal proofs, sequences and summation, mathematical induction, binomial coefficients, elements of finite probability, recurrence relations, equivalence relations and partial orderings, and topics in graph theory (including isomorphism, traversability, planarity, and colorings).
Instructor
Ansaf Salleb-Aouissi
Modality
In-Person
Day/Time
Tu 10:10-13:20
Th 10:10-13:20
Enrollment
37 of 120
Regular languages: deterministic and non-deterministic finite automata, regular expressions. Context-free languages: context-free grammars, push-down automata. Turing machines, the Chomsky hierarchy, and the Church-Turing thesis. Introduction to Complexity Theory and NP-Completeness.
Instructor
Xi Chen
Modality
In-Person
Day/Time
Mo 10:10-13:20
We 10:10-13:20
Enrollment
33 of 120
Mathematical foundations of machine learning: Linear algebra, multivariable calculus, and probability and statistics. Comprehensive review and additional treatment of
relevant topics used in the analysis and design of machine learning models. Preliminary exposure to core algorithms such as linear regression, gradient descent, principal
component analysis, low-rank approximations, and kernel methods.
Instructor
Nakul Verma
Modality
In-Person
Day/Time
Mo 13:00-16:10
We 13:00-16:10
Enrollment
7 of 120
Algorithmic problem-solving and coding skills needed to devise solutions to interview questions for software engineering positions. Solutions are implemented in Python, Java, C, and C++. Approaches include brute-force, hashing, sorting, transform-and-conquer, greedy, and dynamic programming. Focus on experimentation and team work.
Instructor
Brian Borowski
Modality
In-Person
Day/Time
Tu 17:30-20:40
Th 17:30-20:40
Enrollment
21 of 100
Prior knowledge of Python is recommended. Provides a broad understanding of the basic techniques for building intelligent computer systems. Topics include state-space problem representations, problem reduction and and-or graphs, game playing and heuristic search, predicate calculus, and resolution theorem proving, AI systems and languages for knowledge representation, machine learning and concept formation and other topics such as natural language processing may be included as time permits.
Instructor
Tony Dear
Modality
In-Person
Day/Time
Mo 16:20-19:30
We 16:20-19:30
Enrollment
28 of 120
Prior knowledge of Python is recommended. Provides a broad understanding of the basic techniques for building intelligent computer systems. Topics include state-space problem representations, problem reduction and and-or graphs, game playing and heuristic search, predicate calculus, and resolution theorem proving, AI systems and languages for knowledge representation, machine learning and concept formation and other topics such as natural language processing may be included as time permits.
Note:
VIDEO NETWORK STUDENTS ONLY
Computational approaches to the analysis, understanding, and generation of natural language text at scale. Emphasis on machine learning techniques for NLP, including deep learning and large language models. Applications may include information extraction, sentiment analysis, question answering, summarization, machine translation, and conversational AI. Discussion of datasets, benchmarking and evaluation, interpretability, and ethical considerations.
Due to significant overlap in content, only one of COMS 4705 or Barnard COMS 3705BC may be taken for credit.
Instructor
Daniel Bauer
Modality
In-Person
Day/Time
Mo 16:20-19:30
We 16:20-19:30
Enrollment
37 of 120
Computational approaches to the analysis, understanding, and generation of natural language text at scale. Emphasis on machine learning techniques for NLP, including deep learning and large language models. Applications may include information extraction, sentiment analysis, question answering, summarization, machine translation, and conversational AI. Discussion of datasets, benchmarking and evaluation, interpretability, and ethical considerations.
Due to significant overlap in content, only one of COMS 4705 or Barnard COMS 3705BC may be taken for credit.
Note:
VIDEO NETWORK STUDENTS ONLY
Principles of Ethical Artificial Intelligence across technical and societal dimensions. Combines technical AI and machine learning implementations and ethical analysis. Students will learn to build, audit, and mitigate ethical risks in AI systems using tools like fairness libraries, explainability frameworks, and privacy-preserving techniques. Emphasizes coding, algorithmic critique, and real-world cases.
Topics include: foundations of AI ethics, fairness, interpretability, explainability, accountability, privacy, robustness, alignment, safety, and societal benefit.
Assessments include coding projects, bias auditing assignments, and ethical analysis papers.
Instructor
Ansaf Salleb-Aouissi
Modality
In-Person
Day/Time
Mo 10:10-13:20
We 10:10-13:20
Enrollment
29 of 120
Principles of Ethical Artificial Intelligence across technical and societal dimensions. Combines technical AI and machine learning implementations and ethical analysis. Students will learn to build, audit, and mitigate ethical risks in AI systems using tools like fairness libraries, explainability frameworks, and privacy-preserving techniques. Emphasizes coding, algorithmic critique, and real-world cases.
Topics include: foundations of AI ethics, fairness, interpretability, explainability, accountability, privacy, robustness, alignment, safety, and societal benefit.
Assessments include coding projects, bias auditing assignments, and ethical analysis papers.
Note:
VIDEO NETWORK STUDENTS ONLY
Instructor
Ansaf Salleb-Aouissi
Modality
On-Line Only
Enrollment
11 of 99
Basic statistical principles and algorithmic paradigms of supervised machine learning.
Prerequisites:
Multivariable calculus (e.g. MATH1201 or MATH1205 or APMA2000), linear algebra (e.g. COMS3251 or MATH2010 or MATH2015), probability (e.g. STAT1201 or STAT4001 or IEOR3658 or MATH2015), discrete math (COMS3203), and general mathematical maturity. Programming and algorithm analysis (e.g. COMS 3134). COMS 3770 is recommended for students who wish to refresh their math background.
Note:
https://www.cs.columbia.edu/~djhsu/coms4771-f25/#list-of-prerequisites
Instructor
Nakul Verma
Modality
In-Person
Day/Time
Tu 13:00-16:10
Th 13:00-16:10
Enrollment
31 of 120
Basic statistical principles and algorithmic paradigms of supervised machine learning.
Prerequisites:
Multivariable calculus (e.g. MATH1201 or MATH1205 or APMA2000), linear algebra (e.g. COMS3251 or MATH2010 or MATH2015), probability (e.g. STAT1201 or STAT4001 or IEOR3658 or MATH2015), discrete math (COMS3203), and general mathematical maturity. Programming and algorithm analysis (e.g. COMS 3134). COMS 3770 is recommended for students who wish to refresh their math background.
Note:
VIDEO NETWORK STUDENTS ONLY